About the Execution of GreatSPN+red for Anderson-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10687.447 | 3600000.00 | 11469629.00 | 3529.80 | TFFFFFFTFFFF?F?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r003-smll-171620117600380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Anderson-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117600380
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-12-LTLFireability-00
FORMULA_NAME Anderson-PT-12-LTLFireability-01
FORMULA_NAME Anderson-PT-12-LTLFireability-02
FORMULA_NAME Anderson-PT-12-LTLFireability-03
FORMULA_NAME Anderson-PT-12-LTLFireability-04
FORMULA_NAME Anderson-PT-12-LTLFireability-05
FORMULA_NAME Anderson-PT-12-LTLFireability-06
FORMULA_NAME Anderson-PT-12-LTLFireability-07
FORMULA_NAME Anderson-PT-12-LTLFireability-08
FORMULA_NAME Anderson-PT-12-LTLFireability-09
FORMULA_NAME Anderson-PT-12-LTLFireability-10
FORMULA_NAME Anderson-PT-12-LTLFireability-11
FORMULA_NAME Anderson-PT-12-LTLFireability-12
FORMULA_NAME Anderson-PT-12-LTLFireability-13
FORMULA_NAME Anderson-PT-12-LTLFireability-14
FORMULA_NAME Anderson-PT-12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716475311240
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:41:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 14:41:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:41:54] [INFO ] Load time of PNML (sax parser for PT used): 686 ms
[2024-05-23 14:41:54] [INFO ] Transformed 889 places.
[2024-05-23 14:41:54] [INFO ] Transformed 4152 transitions.
[2024-05-23 14:41:54] [INFO ] Found NUPN structural information;
[2024-05-23 14:41:54] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 978 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 238 place count 651 transition count 1516
Iterating global reduction 0 with 238 rules applied. Total rules applied 476 place count 651 transition count 1516
Applied a total of 476 rules in 291 ms. Remains 651 /889 variables (removed 238) and now considering 1516/4152 (removed 2636) transitions.
// Phase 1: matrix 1516 rows 651 cols
[2024-05-23 14:41:55] [INFO ] Computed 27 invariants in 163 ms
[2024-05-23 14:41:57] [INFO ] Implicit Places using invariants in 1662 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1725 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/889 places, 1516/4152 transitions.
Applied a total of 0 rules in 30 ms. Remains 650 /650 variables (removed 0) and now considering 1516/1516 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2082 ms. Remains : 650/889 places, 1516/4152 transitions.
Support contains 47 out of 650 places after structural reductions.
[2024-05-23 14:41:57] [INFO ] Flatten gal took : 243 ms
[2024-05-23 14:41:57] [INFO ] Flatten gal took : 143 ms
[2024-05-23 14:41:58] [INFO ] Input system was already deterministic with 1516 transitions.
Support contains 46 out of 650 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2758 ms. (14 steps per ms) remains 20/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
// Phase 1: matrix 1516 rows 650 cols
[2024-05-23 14:41:59] [INFO ] Computed 26 invariants in 31 ms
[2024-05-23 14:41:59] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 598/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 13/642 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 8/650 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 14:42:02] [INFO ] Deduced a trap composed of 170 places in 1140 ms of which 107 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 14:42:04] [INFO ] Deduced a trap composed of 267 places in 699 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 14:42:05] [INFO ] Deduced a trap composed of 230 places in 624 ms of which 6 ms to minimize.
SMT process timed out in 5536ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 650 transition count 1390
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 252 place count 524 transition count 1390
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 252 place count 524 transition count 1258
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 516 place count 392 transition count 1258
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 524 place count 384 transition count 1140
Iterating global reduction 2 with 8 rules applied. Total rules applied 532 place count 384 transition count 1140
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 550 place count 384 transition count 1122
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 568 place count 366 transition count 1122
Applied a total of 568 rules in 298 ms. Remains 366 /650 variables (removed 284) and now considering 1122/1516 (removed 394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 366/650 places, 1122/1516 transitions.
RANDOM walk for 40000 steps (8 resets) in 787 ms. (50 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 14/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 11/11 properties
// Phase 1: matrix 1122 rows 366 cols
[2024-05-23 14:42:05] [INFO ] Computed 26 invariants in 22 ms
[2024-05-23 14:42:05] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 319/340 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/344 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/365 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 14:42:06] [INFO ] Deduced a trap composed of 109 places in 370 ms of which 4 ms to minimize.
[2024-05-23 14:42:07] [INFO ] Deduced a trap composed of 111 places in 438 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 14:42:08] [INFO ] Deduced a trap composed of 151 places in 598 ms of which 6 ms to minimize.
[2024-05-23 14:42:08] [INFO ] Deduced a trap composed of 161 places in 547 ms of which 6 ms to minimize.
[2024-05-23 14:42:09] [INFO ] Deduced a trap composed of 151 places in 471 ms of which 6 ms to minimize.
[2024-05-23 14:42:09] [INFO ] Deduced a trap composed of 89 places in 480 ms of which 6 ms to minimize.
[2024-05-23 14:42:10] [INFO ] Deduced a trap composed of 110 places in 484 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 14:42:10] [INFO ] Deduced a trap composed of 115 places in 535 ms of which 6 ms to minimize.
[2024-05-23 14:42:11] [INFO ] Deduced a trap composed of 122 places in 591 ms of which 6 ms to minimize.
[2024-05-23 14:42:12] [INFO ] Deduced a trap composed of 89 places in 594 ms of which 7 ms to minimize.
[2024-05-23 14:42:12] [INFO ] Deduced a trap composed of 150 places in 575 ms of which 6 ms to minimize.
[2024-05-23 14:42:13] [INFO ] Deduced a trap composed of 110 places in 579 ms of which 5 ms to minimize.
[2024-05-23 14:42:13] [INFO ] Deduced a trap composed of 173 places in 596 ms of which 6 ms to minimize.
[2024-05-23 14:42:14] [INFO ] Deduced a trap composed of 103 places in 587 ms of which 6 ms to minimize.
[2024-05-23 14:42:15] [INFO ] Deduced a trap composed of 121 places in 580 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/366 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 14:42:16] [INFO ] Deduced a trap composed of 89 places in 577 ms of which 6 ms to minimize.
[2024-05-23 14:42:16] [INFO ] Deduced a trap composed of 94 places in 576 ms of which 6 ms to minimize.
[2024-05-23 14:42:17] [INFO ] Deduced a trap composed of 96 places in 565 ms of which 6 ms to minimize.
[2024-05-23 14:42:17] [INFO ] Deduced a trap composed of 125 places in 591 ms of which 6 ms to minimize.
[2024-05-23 14:42:18] [INFO ] Deduced a trap composed of 90 places in 578 ms of which 6 ms to minimize.
[2024-05-23 14:42:19] [INFO ] Deduced a trap composed of 165 places in 492 ms of which 6 ms to minimize.
[2024-05-23 14:42:19] [INFO ] Deduced a trap composed of 97 places in 528 ms of which 6 ms to minimize.
[2024-05-23 14:42:20] [INFO ] Deduced a trap composed of 106 places in 572 ms of which 6 ms to minimize.
[2024-05-23 14:42:20] [INFO ] Deduced a trap composed of 119 places in 581 ms of which 6 ms to minimize.
[2024-05-23 14:42:21] [INFO ] Deduced a trap composed of 104 places in 534 ms of which 5 ms to minimize.
[2024-05-23 14:42:22] [INFO ] Deduced a trap composed of 87 places in 626 ms of which 6 ms to minimize.
[2024-05-23 14:42:22] [INFO ] Deduced a trap composed of 101 places in 563 ms of which 5 ms to minimize.
[2024-05-23 14:42:23] [INFO ] Deduced a trap composed of 84 places in 598 ms of which 6 ms to minimize.
[2024-05-23 14:42:23] [INFO ] Deduced a trap composed of 96 places in 563 ms of which 6 ms to minimize.
[2024-05-23 14:42:24] [INFO ] Deduced a trap composed of 56 places in 534 ms of which 6 ms to minimize.
[2024-05-23 14:42:24] [INFO ] Deduced a trap composed of 90 places in 589 ms of which 6 ms to minimize.
[2024-05-23 14:42:25] [INFO ] Deduced a trap composed of 89 places in 579 ms of which 5 ms to minimize.
[2024-05-23 14:42:26] [INFO ] Deduced a trap composed of 98 places in 576 ms of which 6 ms to minimize.
[2024-05-23 14:42:26] [INFO ] Deduced a trap composed of 60 places in 523 ms of which 6 ms to minimize.
[2024-05-23 14:42:27] [INFO ] Deduced a trap composed of 49 places in 583 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 14:42:28] [INFO ] Deduced a trap composed of 87 places in 556 ms of which 6 ms to minimize.
[2024-05-23 14:42:28] [INFO ] Deduced a trap composed of 85 places in 566 ms of which 6 ms to minimize.
[2024-05-23 14:42:29] [INFO ] Deduced a trap composed of 85 places in 575 ms of which 6 ms to minimize.
[2024-05-23 14:42:29] [INFO ] Deduced a trap composed of 85 places in 557 ms of which 6 ms to minimize.
[2024-05-23 14:42:30] [INFO ] Deduced a trap composed of 78 places in 568 ms of which 6 ms to minimize.
[2024-05-23 14:42:31] [INFO ] Deduced a trap composed of 105 places in 581 ms of which 6 ms to minimize.
[2024-05-23 14:42:31] [INFO ] Deduced a trap composed of 95 places in 527 ms of which 5 ms to minimize.
[2024-05-23 14:42:32] [INFO ] Deduced a trap composed of 62 places in 575 ms of which 6 ms to minimize.
[2024-05-23 14:42:32] [INFO ] Deduced a trap composed of 127 places in 586 ms of which 6 ms to minimize.
[2024-05-23 14:42:33] [INFO ] Deduced a trap composed of 129 places in 571 ms of which 6 ms to minimize.
[2024-05-23 14:42:33] [INFO ] Deduced a trap composed of 156 places in 569 ms of which 6 ms to minimize.
[2024-05-23 14:42:34] [INFO ] Deduced a trap composed of 159 places in 570 ms of which 6 ms to minimize.
[2024-05-23 14:42:35] [INFO ] Deduced a trap composed of 112 places in 580 ms of which 7 ms to minimize.
[2024-05-23 14:42:35] [INFO ] Deduced a trap composed of 133 places in 502 ms of which 5 ms to minimize.
[2024-05-23 14:42:36] [INFO ] Deduced a trap composed of 133 places in 578 ms of which 6 ms to minimize.
[2024-05-23 14:42:36] [INFO ] Deduced a trap composed of 129 places in 568 ms of which 5 ms to minimize.
[2024-05-23 14:42:37] [INFO ] Deduced a trap composed of 107 places in 573 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 14:42:38] [INFO ] Deduced a trap composed of 123 places in 595 ms of which 6 ms to minimize.
[2024-05-23 14:42:39] [INFO ] Deduced a trap composed of 133 places in 584 ms of which 7 ms to minimize.
[2024-05-23 14:42:39] [INFO ] Deduced a trap composed of 81 places in 575 ms of which 6 ms to minimize.
[2024-05-23 14:42:40] [INFO ] Deduced a trap composed of 115 places in 584 ms of which 6 ms to minimize.
[2024-05-23 14:42:40] [INFO ] Deduced a trap composed of 78 places in 575 ms of which 6 ms to minimize.
[2024-05-23 14:42:41] [INFO ] Deduced a trap composed of 94 places in 595 ms of which 6 ms to minimize.
[2024-05-23 14:42:42] [INFO ] Deduced a trap composed of 71 places in 585 ms of which 6 ms to minimize.
[2024-05-23 14:42:42] [INFO ] Deduced a trap composed of 111 places in 600 ms of which 6 ms to minimize.
[2024-05-23 14:42:43] [INFO ] Deduced a trap composed of 97 places in 589 ms of which 7 ms to minimize.
[2024-05-23 14:42:43] [INFO ] Deduced a trap composed of 81 places in 569 ms of which 6 ms to minimize.
[2024-05-23 14:42:44] [INFO ] Deduced a trap composed of 127 places in 594 ms of which 6 ms to minimize.
[2024-05-23 14:42:45] [INFO ] Deduced a trap composed of 100 places in 599 ms of which 6 ms to minimize.
[2024-05-23 14:42:45] [INFO ] Deduced a trap composed of 89 places in 578 ms of which 6 ms to minimize.
[2024-05-23 14:42:46] [INFO ] Deduced a trap composed of 75 places in 585 ms of which 6 ms to minimize.
[2024-05-23 14:42:47] [INFO ] Deduced a trap composed of 104 places in 591 ms of which 6 ms to minimize.
[2024-05-23 14:42:47] [INFO ] Deduced a trap composed of 115 places in 591 ms of which 6 ms to minimize.
[2024-05-23 14:42:48] [INFO ] Deduced a trap composed of 138 places in 573 ms of which 5 ms to minimize.
[2024-05-23 14:42:48] [INFO ] Deduced a trap composed of 93 places in 577 ms of which 6 ms to minimize.
[2024-05-23 14:42:49] [INFO ] Deduced a trap composed of 102 places in 555 ms of which 6 ms to minimize.
[2024-05-23 14:42:49] [INFO ] Deduced a trap composed of 98 places in 569 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 14:42:50] [INFO ] Deduced a trap composed of 117 places in 578 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1488 variables, and 99 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/366 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 319/340 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/344 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/365 variables, 12/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 59/84 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-23 14:42:52] [INFO ] Deduced a trap composed of 89 places in 522 ms of which 5 ms to minimize.
[2024-05-23 14:42:52] [INFO ] Deduced a trap composed of 82 places in 338 ms of which 3 ms to minimize.
[2024-05-23 14:42:53] [INFO ] Deduced a trap composed of 84 places in 336 ms of which 3 ms to minimize.
[2024-05-23 14:42:53] [INFO ] Deduced a trap composed of 103 places in 369 ms of which 5 ms to minimize.
[2024-05-23 14:42:54] [INFO ] Deduced a trap composed of 84 places in 460 ms of which 5 ms to minimize.
[2024-05-23 14:42:54] [INFO ] Deduced a trap composed of 88 places in 556 ms of which 6 ms to minimize.
[2024-05-23 14:42:55] [INFO ] Deduced a trap composed of 90 places in 529 ms of which 6 ms to minimize.
[2024-05-23 14:42:55] [INFO ] Deduced a trap composed of 103 places in 531 ms of which 5 ms to minimize.
[2024-05-23 14:42:56] [INFO ] Deduced a trap composed of 72 places in 547 ms of which 6 ms to minimize.
[2024-05-23 14:42:57] [INFO ] Deduced a trap composed of 101 places in 569 ms of which 6 ms to minimize.
[2024-05-23 14:42:57] [INFO ] Deduced a trap composed of 81 places in 517 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 11/95 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-23 14:42:59] [INFO ] Deduced a trap composed of 145 places in 598 ms of which 6 ms to minimize.
[2024-05-23 14:42:59] [INFO ] Deduced a trap composed of 171 places in 532 ms of which 4 ms to minimize.
[2024-05-23 14:43:00] [INFO ] Deduced a trap composed of 123 places in 563 ms of which 5 ms to minimize.
[2024-05-23 14:43:00] [INFO ] Deduced a trap composed of 157 places in 587 ms of which 6 ms to minimize.
[2024-05-23 14:43:01] [INFO ] Deduced a trap composed of 141 places in 528 ms of which 6 ms to minimize.
[2024-05-23 14:43:01] [INFO ] Deduced a trap composed of 94 places in 541 ms of which 5 ms to minimize.
[2024-05-23 14:43:02] [INFO ] Deduced a trap composed of 144 places in 560 ms of which 6 ms to minimize.
[2024-05-23 14:43:03] [INFO ] Deduced a trap composed of 119 places in 550 ms of which 6 ms to minimize.
[2024-05-23 14:43:03] [INFO ] Deduced a trap composed of 63 places in 539 ms of which 5 ms to minimize.
[2024-05-23 14:43:04] [INFO ] Deduced a trap composed of 166 places in 540 ms of which 6 ms to minimize.
[2024-05-23 14:43:04] [INFO ] Deduced a trap composed of 91 places in 552 ms of which 6 ms to minimize.
[2024-05-23 14:43:05] [INFO ] Deduced a trap composed of 74 places in 571 ms of which 6 ms to minimize.
[2024-05-23 14:43:06] [INFO ] Deduced a trap composed of 111 places in 586 ms of which 6 ms to minimize.
[2024-05-23 14:43:06] [INFO ] Deduced a trap composed of 93 places in 563 ms of which 6 ms to minimize.
[2024-05-23 14:43:07] [INFO ] Deduced a trap composed of 149 places in 589 ms of which 6 ms to minimize.
[2024-05-23 14:43:08] [INFO ] Deduced a trap composed of 158 places in 588 ms of which 6 ms to minimize.
[2024-05-23 14:43:09] [INFO ] Deduced a trap composed of 117 places in 593 ms of which 6 ms to minimize.
[2024-05-23 14:43:09] [INFO ] Deduced a trap composed of 122 places in 563 ms of which 6 ms to minimize.
[2024-05-23 14:43:10] [INFO ] Deduced a trap composed of 155 places in 563 ms of which 6 ms to minimize.
[2024-05-23 14:43:10] [INFO ] Deduced a trap composed of 139 places in 556 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 20/115 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-23 14:43:12] [INFO ] Deduced a trap composed of 142 places in 584 ms of which 6 ms to minimize.
[2024-05-23 14:43:12] [INFO ] Deduced a trap composed of 121 places in 597 ms of which 6 ms to minimize.
[2024-05-23 14:43:13] [INFO ] Deduced a trap composed of 104 places in 584 ms of which 5 ms to minimize.
[2024-05-23 14:43:14] [INFO ] Deduced a trap composed of 92 places in 587 ms of which 6 ms to minimize.
[2024-05-23 14:43:14] [INFO ] Deduced a trap composed of 101 places in 602 ms of which 6 ms to minimize.
[2024-05-23 14:43:15] [INFO ] Deduced a trap composed of 75 places in 602 ms of which 6 ms to minimize.
[2024-05-23 14:43:15] [INFO ] Deduced a trap composed of 114 places in 590 ms of which 6 ms to minimize.
[2024-05-23 14:43:16] [INFO ] Deduced a trap composed of 74 places in 596 ms of which 6 ms to minimize.
[2024-05-23 14:43:17] [INFO ] Deduced a trap composed of 88 places in 591 ms of which 6 ms to minimize.
[2024-05-23 14:43:17] [INFO ] Deduced a trap composed of 120 places in 597 ms of which 6 ms to minimize.
[2024-05-23 14:43:18] [INFO ] Deduced a trap composed of 106 places in 602 ms of which 6 ms to minimize.
[2024-05-23 14:43:19] [INFO ] Deduced a trap composed of 87 places in 585 ms of which 6 ms to minimize.
[2024-05-23 14:43:19] [INFO ] Deduced a trap composed of 62 places in 581 ms of which 6 ms to minimize.
[2024-05-23 14:43:20] [INFO ] Deduced a trap composed of 61 places in 599 ms of which 6 ms to minimize.
[2024-05-23 14:43:20] [INFO ] Deduced a trap composed of 57 places in 626 ms of which 6 ms to minimize.
[2024-05-23 14:43:21] [INFO ] Deduced a trap composed of 83 places in 581 ms of which 6 ms to minimize.
[2024-05-23 14:43:22] [INFO ] Deduced a trap composed of 152 places in 559 ms of which 6 ms to minimize.
[2024-05-23 14:43:22] [INFO ] Deduced a trap composed of 80 places in 542 ms of which 6 ms to minimize.
[2024-05-23 14:43:23] [INFO ] Deduced a trap composed of 79 places in 548 ms of which 6 ms to minimize.
[2024-05-23 14:43:23] [INFO ] Deduced a trap composed of 141 places in 588 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 20/135 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-23 14:43:25] [INFO ] Deduced a trap composed of 130 places in 591 ms of which 6 ms to minimize.
[2024-05-23 14:43:25] [INFO ] Deduced a trap composed of 78 places in 557 ms of which 6 ms to minimize.
[2024-05-23 14:43:26] [INFO ] Deduced a trap composed of 70 places in 560 ms of which 6 ms to minimize.
[2024-05-23 14:43:27] [INFO ] Deduced a trap composed of 101 places in 564 ms of which 6 ms to minimize.
[2024-05-23 14:43:27] [INFO ] Deduced a trap composed of 70 places in 502 ms of which 6 ms to minimize.
[2024-05-23 14:43:28] [INFO ] Deduced a trap composed of 111 places in 551 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 6/141 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-23 14:43:29] [INFO ] Deduced a trap composed of 83 places in 272 ms of which 3 ms to minimize.
[2024-05-23 14:43:29] [INFO ] Deduced a trap composed of 85 places in 432 ms of which 4 ms to minimize.
[2024-05-23 14:43:30] [INFO ] Deduced a trap composed of 119 places in 571 ms of which 6 ms to minimize.
[2024-05-23 14:43:31] [INFO ] Deduced a trap composed of 105 places in 559 ms of which 6 ms to minimize.
[2024-05-23 14:43:32] [INFO ] Deduced a trap composed of 91 places in 576 ms of which 6 ms to minimize.
[2024-05-23 14:43:33] [INFO ] Deduced a trap composed of 140 places in 602 ms of which 6 ms to minimize.
[2024-05-23 14:43:33] [INFO ] Deduced a trap composed of 152 places in 599 ms of which 5 ms to minimize.
[2024-05-23 14:43:34] [INFO ] Deduced a trap composed of 139 places in 576 ms of which 6 ms to minimize.
[2024-05-23 14:43:34] [INFO ] Deduced a trap composed of 79 places in 570 ms of which 5 ms to minimize.
[2024-05-23 14:43:35] [INFO ] Deduced a trap composed of 120 places in 587 ms of which 6 ms to minimize.
[2024-05-23 14:43:36] [INFO ] Deduced a trap composed of 74 places in 580 ms of which 6 ms to minimize.
SMT process timed out in 90175ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 1122/1122 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 358 transition count 938
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 358 transition count 938
Applied a total of 16 rules in 66 ms. Remains 358 /366 variables (removed 8) and now considering 938/1122 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 358/366 places, 938/1122 transitions.
RANDOM walk for 40000 steps (8 resets) in 798 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 258 ms. (154 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 315 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 0/8 properties
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 284 place count 508 transition count 1242
Deduced a syphon composed of 132 places in 2 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 548 place count 376 transition count 1242
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 572 place count 352 transition count 756
Iterating global reduction 2 with 24 rules applied. Total rules applied 596 place count 352 transition count 756
Applied a total of 596 rules in 113 ms. Remains 352 /650 variables (removed 298) and now considering 756/1516 (removed 760) transitions.
// Phase 1: matrix 756 rows 352 cols
[2024-05-23 14:43:37] [INFO ] Computed 26 invariants in 13 ms
[2024-05-23 14:43:38] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-05-23 14:43:38] [INFO ] Invariant cache hit.
[2024-05-23 14:43:39] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:43:40] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 2654 ms to find 0 implicit places.
[2024-05-23 14:43:40] [INFO ] Redundant transitions in 85 ms returned []
Running 744 sub problems to find dead transitions.
[2024-05-23 14:43:40] [INFO ] Invariant cache hit.
[2024-05-23 14:43:40] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-23 14:43:52] [INFO ] Deduced a trap composed of 114 places in 378 ms of which 5 ms to minimize.
[2024-05-23 14:43:53] [INFO ] Deduced a trap composed of 75 places in 383 ms of which 4 ms to minimize.
[2024-05-23 14:43:54] [INFO ] Deduced a trap composed of 82 places in 380 ms of which 4 ms to minimize.
[2024-05-23 14:43:54] [INFO ] Deduced a trap composed of 110 places in 369 ms of which 4 ms to minimize.
[2024-05-23 14:43:55] [INFO ] Deduced a trap composed of 75 places in 510 ms of which 6 ms to minimize.
[2024-05-23 14:43:55] [INFO ] Deduced a trap composed of 85 places in 291 ms of which 4 ms to minimize.
[2024-05-23 14:43:56] [INFO ] Deduced a trap composed of 47 places in 494 ms of which 5 ms to minimize.
[2024-05-23 14:43:59] [INFO ] Deduced a trap composed of 105 places in 474 ms of which 6 ms to minimize.
[2024-05-23 14:43:59] [INFO ] Deduced a trap composed of 69 places in 476 ms of which 6 ms to minimize.
[2024-05-23 14:44:00] [INFO ] Deduced a trap composed of 60 places in 501 ms of which 6 ms to minimize.
[2024-05-23 14:44:01] [INFO ] Deduced a trap composed of 87 places in 485 ms of which 6 ms to minimize.
[2024-05-23 14:44:01] [INFO ] Deduced a trap composed of 113 places in 494 ms of which 6 ms to minimize.
[2024-05-23 14:44:02] [INFO ] Deduced a trap composed of 113 places in 419 ms of which 5 ms to minimize.
[2024-05-23 14:44:02] [INFO ] Deduced a trap composed of 113 places in 497 ms of which 6 ms to minimize.
[2024-05-23 14:44:03] [INFO ] Deduced a trap composed of 110 places in 491 ms of which 5 ms to minimize.
[2024-05-23 14:44:03] [INFO ] Deduced a trap composed of 106 places in 495 ms of which 5 ms to minimize.
[2024-05-23 14:44:04] [INFO ] Deduced a trap composed of 93 places in 485 ms of which 6 ms to minimize.
[2024-05-23 14:44:04] [INFO ] Deduced a trap composed of 75 places in 493 ms of which 5 ms to minimize.
[2024-05-23 14:44:05] [INFO ] Deduced a trap composed of 116 places in 501 ms of which 6 ms to minimize.
[2024-05-23 14:44:05] [INFO ] Deduced a trap composed of 128 places in 490 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-23 14:44:10] [INFO ] Deduced a trap composed of 114 places in 309 ms of which 4 ms to minimize.
[2024-05-23 14:44:11] [INFO ] Deduced a trap composed of 102 places in 305 ms of which 4 ms to minimize.
[2024-05-23 14:44:11] [INFO ] Deduced a trap composed of 91 places in 293 ms of which 5 ms to minimize.
[2024-05-23 14:44:11] [INFO ] Deduced a trap composed of 92 places in 383 ms of which 5 ms to minimize.
SMT process timed out in 31339ms, After SMT, problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 31372ms
Starting structural reductions in SI_LTL mode, iteration 1 : 352/650 places, 756/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34241 ms. Remains : 352/650 places, 756/1516 transitions.
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 627 ms.
Product exploration explored 100000 steps with 0 reset in 533 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 391 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 442 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 1/4 properties
[2024-05-23 14:44:14] [INFO ] Invariant cache hit.
[2024-05-23 14:44:14] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 317/1108 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/14 constraints, Generalized P Invariants (flows): 0/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 24 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-00 finished in 36820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||X(X(G(p2)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 62 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 14:44:14] [INFO ] Computed 26 invariants in 15 ms
[2024-05-23 14:44:15] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-23 14:44:15] [INFO ] Invariant cache hit.
[2024-05-23 14:44:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:44:21] [INFO ] Implicit Places using invariants and state equation in 6349 ms returned []
Implicit Place search using SMT with State Equation took 7053 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-05-23 14:44:21] [INFO ] Invariant cache hit.
[2024-05-23 14:44:21] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 14:44:52] [INFO ] Deduced a trap composed of 287 places in 721 ms of which 10 ms to minimize.
SMT process timed out in 31331ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 31347ms
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38465 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 108 steps with 0 reset with depth 109 and stack size 109 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-02 finished in 39121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 625 transition count 1007
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 625 transition count 1007
Applied a total of 50 rules in 60 ms. Remains 625 /650 variables (removed 25) and now considering 1007/1516 (removed 509) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2024-05-23 14:44:53] [INFO ] Computed 26 invariants in 17 ms
[2024-05-23 14:44:54] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-23 14:44:54] [INFO ] Invariant cache hit.
[2024-05-23 14:44:55] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:45:03] [INFO ] Implicit Places using invariants and state equation in 8694 ms returned []
Implicit Place search using SMT with State Equation took 9557 ms to find 0 implicit places.
Running 995 sub problems to find dead transitions.
[2024-05-23 14:45:03] [INFO ] Invariant cache hit.
[2024-05-23 14:45:03] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
[2024-05-23 14:45:28] [INFO ] Deduced a trap composed of 82 places in 600 ms of which 6 ms to minimize.
[2024-05-23 14:45:29] [INFO ] Deduced a trap composed of 226 places in 536 ms of which 5 ms to minimize.
[2024-05-23 14:45:29] [INFO ] Deduced a trap composed of 219 places in 664 ms of which 9 ms to minimize.
[2024-05-23 14:45:30] [INFO ] Deduced a trap composed of 142 places in 666 ms of which 8 ms to minimize.
[2024-05-23 14:45:31] [INFO ] Deduced a trap composed of 140 places in 770 ms of which 10 ms to minimize.
[2024-05-23 14:45:32] [INFO ] Deduced a trap composed of 182 places in 811 ms of which 9 ms to minimize.
[2024-05-23 14:45:33] [INFO ] Deduced a trap composed of 289 places in 841 ms of which 10 ms to minimize.
[2024-05-23 14:45:33] [INFO ] Deduced a trap composed of 204 places in 677 ms of which 7 ms to minimize.
[2024-05-23 14:45:34] [INFO ] Deduced a trap composed of 171 places in 541 ms of which 6 ms to minimize.
SMT process timed out in 31223ms, After SMT, problems are : Problem set: 0 solved, 995 unsolved
Search for dead transitions found 0 dead transitions in 31240ms
Starting structural reductions in LTL mode, iteration 1 : 625/650 places, 1007/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40863 ms. Remains : 625/650 places, 1007/1516 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-03
Entered a terminal (fully accepting) state of product in 392 steps with 0 reset in 2 ms.
FORMULA Anderson-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-03 finished in 41010 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(p1)&&p0))||X(F(p2))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 34 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 14:45:34] [INFO ] Computed 26 invariants in 8 ms
[2024-05-23 14:45:35] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-23 14:45:35] [INFO ] Invariant cache hit.
[2024-05-23 14:45:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:45:40] [INFO ] Implicit Places using invariants and state equation in 5050 ms returned []
Implicit Place search using SMT with State Equation took 5793 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-05-23 14:45:40] [INFO ] Invariant cache hit.
[2024-05-23 14:45:40] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 14:46:08] [INFO ] Deduced a trap composed of 151 places in 815 ms of which 10 ms to minimize.
[2024-05-23 14:46:09] [INFO ] Deduced a trap composed of 312 places in 882 ms of which 9 ms to minimize.
[2024-05-23 14:46:10] [INFO ] Deduced a trap composed of 232 places in 781 ms of which 9 ms to minimize.
[2024-05-23 14:46:11] [INFO ] Deduced a trap composed of 132 places in 855 ms of which 10 ms to minimize.
SMT process timed out in 31253ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 31265ms
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37096 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 720 ms.
Product exploration explored 100000 steps with 50000 reset in 647 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) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 18 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-07 finished in 38763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(!p2)))&&F(G(p2))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 650 transition count 1375
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 509 transition count 1375
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 282 place count 509 transition count 1243
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 780
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 780
Applied a total of 592 rules in 52 ms. Remains 354 /650 variables (removed 296) and now considering 780/1516 (removed 736) transitions.
// Phase 1: matrix 780 rows 354 cols
[2024-05-23 14:46:13] [INFO ] Computed 26 invariants in 5 ms
[2024-05-23 14:46:13] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-23 14:46:13] [INFO ] Invariant cache hit.
[2024-05-23 14:46:14] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:46:16] [INFO ] Implicit Places using invariants and state equation in 2584 ms returned []
Implicit Place search using SMT with State Equation took 3171 ms to find 0 implicit places.
[2024-05-23 14:46:16] [INFO ] Redundant transitions in 55 ms returned []
Running 768 sub problems to find dead transitions.
[2024-05-23 14:46:16] [INFO ] Invariant cache hit.
[2024-05-23 14:46:16] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 97 places in 317 ms of which 4 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 77 places in 304 ms of which 3 ms to minimize.
[2024-05-23 14:46:30] [INFO ] Deduced a trap composed of 91 places in 785 ms of which 15 ms to minimize.
[2024-05-23 14:46:30] [INFO ] Deduced a trap composed of 150 places in 399 ms of which 6 ms to minimize.
[2024-05-23 14:46:30] [INFO ] Deduced a trap composed of 80 places in 390 ms of which 4 ms to minimize.
[2024-05-23 14:46:31] [INFO ] Deduced a trap composed of 49 places in 385 ms of which 4 ms to minimize.
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 60 places in 382 ms of which 6 ms to minimize.
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 72 places in 377 ms of which 5 ms to minimize.
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 3 ms to minimize.
[2024-05-23 14:46:35] [INFO ] Deduced a trap composed of 49 places in 382 ms of which 6 ms to minimize.
[2024-05-23 14:46:35] [INFO ] Deduced a trap composed of 93 places in 271 ms of which 4 ms to minimize.
[2024-05-23 14:46:35] [INFO ] Deduced a trap composed of 103 places in 385 ms of which 5 ms to minimize.
[2024-05-23 14:46:36] [INFO ] Deduced a trap composed of 111 places in 412 ms of which 7 ms to minimize.
[2024-05-23 14:46:36] [INFO ] Deduced a trap composed of 106 places in 384 ms of which 3 ms to minimize.
[2024-05-23 14:46:37] [INFO ] Deduced a trap composed of 72 places in 387 ms of which 3 ms to minimize.
[2024-05-23 14:46:38] [INFO ] Deduced a trap composed of 54 places in 309 ms of which 4 ms to minimize.
[2024-05-23 14:46:38] [INFO ] Deduced a trap composed of 73 places in 425 ms of which 6 ms to minimize.
[2024-05-23 14:46:39] [INFO ] Deduced a trap composed of 63 places in 428 ms of which 4 ms to minimize.
[2024-05-23 14:46:39] [INFO ] Deduced a trap composed of 78 places in 290 ms of which 4 ms to minimize.
[2024-05-23 14:46:39] [INFO ] Deduced a trap composed of 77 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-23 14:46:44] [INFO ] Deduced a trap composed of 124 places in 338 ms of which 4 ms to minimize.
[2024-05-23 14:46:45] [INFO ] Deduced a trap composed of 121 places in 321 ms of which 4 ms to minimize.
[2024-05-23 14:46:46] [INFO ] Deduced a trap composed of 98 places in 421 ms of which 4 ms to minimize.
[2024-05-23 14:46:46] [INFO ] Deduced a trap composed of 108 places in 318 ms of which 3 ms to minimize.
[2024-05-23 14:46:46] [INFO ] Deduced a trap composed of 96 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:46:47] [INFO ] Deduced a trap composed of 80 places in 361 ms of which 4 ms to minimize.
[2024-05-23 14:46:47] [INFO ] Deduced a trap composed of 66 places in 295 ms of which 4 ms to minimize.
[2024-05-23 14:46:47] [INFO ] Deduced a trap composed of 113 places in 353 ms of which 4 ms to minimize.
SMT process timed out in 31231ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 31246ms
Starting structural reductions in SI_LTL mode, iteration 1 : 354/650 places, 780/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34534 ms. Remains : 354/650 places, 780/1516 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p1)), true, p2, (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 246 ms.
Product exploration explored 100000 steps with 0 reset in 296 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 p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 132 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[true, true, p2, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 14596 steps (2 resets) in 46 ms. (310 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Property proved to be false thanks to negative knowledge :(F p2)
Knowledge based reduction with 15 factoid took 169 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-08 finished in 35810 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(F(p0))||G(p1))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 53 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-23 14:46:49] [INFO ] Computed 26 invariants in 5 ms
[2024-05-23 14:46:49] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-23 14:46:49] [INFO ] Invariant cache hit.
[2024-05-23 14:46:50] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:46:51] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
[2024-05-23 14:46:51] [INFO ] Redundant transitions in 6 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 14:46:51] [INFO ] Invariant cache hit.
[2024-05-23 14:46:51] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:47:00] [INFO ] Deduced a trap composed of 67 places in 351 ms of which 5 ms to minimize.
[2024-05-23 14:47:02] [INFO ] Deduced a trap composed of 112 places in 298 ms of which 4 ms to minimize.
[2024-05-23 14:47:03] [INFO ] Deduced a trap composed of 126 places in 341 ms of which 4 ms to minimize.
[2024-05-23 14:47:03] [INFO ] Deduced a trap composed of 121 places in 357 ms of which 4 ms to minimize.
[2024-05-23 14:47:03] [INFO ] Deduced a trap composed of 170 places in 355 ms of which 3 ms to minimize.
[2024-05-23 14:47:04] [INFO ] Deduced a trap composed of 117 places in 348 ms of which 4 ms to minimize.
[2024-05-23 14:47:04] [INFO ] Deduced a trap composed of 83 places in 325 ms of which 4 ms to minimize.
[2024-05-23 14:47:04] [INFO ] Deduced a trap composed of 89 places in 318 ms of which 4 ms to minimize.
[2024-05-23 14:47:05] [INFO ] Deduced a trap composed of 86 places in 327 ms of which 4 ms to minimize.
[2024-05-23 14:47:05] [INFO ] Deduced a trap composed of 94 places in 381 ms of which 4 ms to minimize.
[2024-05-23 14:47:06] [INFO ] Deduced a trap composed of 136 places in 328 ms of which 3 ms to minimize.
[2024-05-23 14:47:06] [INFO ] Deduced a trap composed of 127 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:47:06] [INFO ] Deduced a trap composed of 79 places in 314 ms of which 4 ms to minimize.
[2024-05-23 14:47:07] [INFO ] Deduced a trap composed of 90 places in 384 ms of which 5 ms to minimize.
[2024-05-23 14:47:07] [INFO ] Deduced a trap composed of 109 places in 356 ms of which 4 ms to minimize.
[2024-05-23 14:47:07] [INFO ] Deduced a trap composed of 119 places in 341 ms of which 4 ms to minimize.
[2024-05-23 14:47:08] [INFO ] Deduced a trap composed of 119 places in 344 ms of which 4 ms to minimize.
[2024-05-23 14:47:08] [INFO ] Deduced a trap composed of 111 places in 341 ms of which 4 ms to minimize.
[2024-05-23 14:47:08] [INFO ] Deduced a trap composed of 117 places in 344 ms of which 3 ms to minimize.
[2024-05-23 14:47:09] [INFO ] Deduced a trap composed of 115 places in 372 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:47:11] [INFO ] Deduced a trap composed of 59 places in 337 ms of which 4 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 136 places in 354 ms of which 5 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 124 places in 343 ms of which 4 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 113 places in 373 ms of which 3 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 102 places in 358 ms of which 5 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 151 places in 358 ms of which 4 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 131 places in 346 ms of which 4 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 102 places in 365 ms of which 4 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 126 places in 349 ms of which 4 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 128 places in 359 ms of which 4 ms to minimize.
[2024-05-23 14:47:17] [INFO ] Deduced a trap composed of 106 places in 336 ms of which 4 ms to minimize.
[2024-05-23 14:47:17] [INFO ] Deduced a trap composed of 125 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:47:18] [INFO ] Deduced a trap composed of 65 places in 365 ms of which 3 ms to minimize.
[2024-05-23 14:47:18] [INFO ] Deduced a trap composed of 121 places in 348 ms of which 4 ms to minimize.
[2024-05-23 14:47:18] [INFO ] Deduced a trap composed of 116 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:47:19] [INFO ] Deduced a trap composed of 139 places in 361 ms of which 4 ms to minimize.
[2024-05-23 14:47:19] [INFO ] Deduced a trap composed of 136 places in 328 ms of which 4 ms to minimize.
[2024-05-23 14:47:19] [INFO ] Deduced a trap composed of 115 places in 352 ms of which 4 ms to minimize.
[2024-05-23 14:47:20] [INFO ] Deduced a trap composed of 106 places in 347 ms of which 5 ms to minimize.
[2024-05-23 14:47:20] [INFO ] Deduced a trap composed of 57 places in 348 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1082 variables, and 66 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:47:29] [INFO ] Deduced a trap composed of 114 places in 352 ms of which 4 ms to minimize.
[2024-05-23 14:47:30] [INFO ] Deduced a trap composed of 107 places in 346 ms of which 4 ms to minimize.
[2024-05-23 14:47:30] [INFO ] Deduced a trap composed of 105 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:47:30] [INFO ] Deduced a trap composed of 61 places in 344 ms of which 4 ms to minimize.
[2024-05-23 14:47:31] [INFO ] Deduced a trap composed of 100 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:47:31] [INFO ] Deduced a trap composed of 114 places in 347 ms of which 4 ms to minimize.
[2024-05-23 14:47:31] [INFO ] Deduced a trap composed of 106 places in 321 ms of which 3 ms to minimize.
[2024-05-23 14:47:32] [INFO ] Deduced a trap composed of 94 places in 354 ms of which 4 ms to minimize.
[2024-05-23 14:47:32] [INFO ] Deduced a trap composed of 91 places in 326 ms of which 4 ms to minimize.
[2024-05-23 14:47:32] [INFO ] Deduced a trap composed of 95 places in 340 ms of which 4 ms to minimize.
[2024-05-23 14:47:33] [INFO ] Deduced a trap composed of 96 places in 341 ms of which 4 ms to minimize.
[2024-05-23 14:47:33] [INFO ] Deduced a trap composed of 87 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:47:33] [INFO ] Deduced a trap composed of 101 places in 352 ms of which 4 ms to minimize.
[2024-05-23 14:47:34] [INFO ] Deduced a trap composed of 92 places in 324 ms of which 3 ms to minimize.
[2024-05-23 14:47:34] [INFO ] Deduced a trap composed of 115 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:47:34] [INFO ] Deduced a trap composed of 86 places in 358 ms of which 3 ms to minimize.
[2024-05-23 14:47:35] [INFO ] Deduced a trap composed of 80 places in 367 ms of which 4 ms to minimize.
[2024-05-23 14:47:35] [INFO ] Deduced a trap composed of 93 places in 328 ms of which 4 ms to minimize.
[2024-05-23 14:47:35] [INFO ] Deduced a trap composed of 113 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:47:36] [INFO ] Deduced a trap composed of 88 places in 323 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:47:42] [INFO ] Deduced a trap composed of 81 places in 342 ms of which 4 ms to minimize.
[2024-05-23 14:47:42] [INFO ] Deduced a trap composed of 72 places in 358 ms of which 4 ms to minimize.
[2024-05-23 14:47:42] [INFO ] Deduced a trap composed of 120 places in 342 ms of which 4 ms to minimize.
[2024-05-23 14:47:43] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 4 ms to minimize.
[2024-05-23 14:47:43] [INFO ] Deduced a trap composed of 91 places in 349 ms of which 4 ms to minimize.
[2024-05-23 14:47:44] [INFO ] Deduced a trap composed of 76 places in 339 ms of which 3 ms to minimize.
[2024-05-23 14:47:44] [INFO ] Deduced a trap composed of 72 places in 347 ms of which 4 ms to minimize.
[2024-05-23 14:47:44] [INFO ] Deduced a trap composed of 125 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:47:45] [INFO ] Deduced a trap composed of 144 places in 343 ms of which 5 ms to minimize.
[2024-05-23 14:47:45] [INFO ] Deduced a trap composed of 109 places in 446 ms of which 4 ms to minimize.
[2024-05-23 14:47:45] [INFO ] Deduced a trap composed of 118 places in 332 ms of which 4 ms to minimize.
[2024-05-23 14:47:46] [INFO ] Deduced a trap composed of 122 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:47:46] [INFO ] Deduced a trap composed of 125 places in 343 ms of which 6 ms to minimize.
[2024-05-23 14:47:47] [INFO ] Deduced a trap composed of 118 places in 433 ms of which 5 ms to minimize.
[2024-05-23 14:47:47] [INFO ] Deduced a trap composed of 114 places in 322 ms of which 3 ms to minimize.
[2024-05-23 14:47:47] [INFO ] Deduced a trap composed of 132 places in 328 ms of which 4 ms to minimize.
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 89 places in 332 ms of which 4 ms to minimize.
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 107 places in 332 ms of which 4 ms to minimize.
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 87 places in 325 ms of which 4 ms to minimize.
[2024-05-23 14:47:49] [INFO ] Deduced a trap composed of 98 places in 321 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 106 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 80/80 constraints]
After SMT, in 60731ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60741ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63207 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-09
Product exploration explored 100000 steps with 35 reset in 233 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-09 finished in 63543 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((X(p0)||(p1 U (G(!p2) U (p3 U p0))))))'
Support contains 2 out of 650 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 650 transition count 1422
Reduce places removed 94 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 118 rules applied. Total rules applied 212 place count 556 transition count 1398
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 236 place count 532 transition count 1398
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 236 place count 532 transition count 1267
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 498 place count 401 transition count 1267
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 522 place count 377 transition count 781
Iterating global reduction 3 with 24 rules applied. Total rules applied 546 place count 377 transition count 781
Applied a total of 546 rules in 69 ms. Remains 377 /650 variables (removed 273) and now considering 781/1516 (removed 735) transitions.
// Phase 1: matrix 781 rows 377 cols
[2024-05-23 14:47:52] [INFO ] Computed 26 invariants in 6 ms
[2024-05-23 14:47:53] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-23 14:47:53] [INFO ] Invariant cache hit.
[2024-05-23 14:47:54] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:47:55] [INFO ] Implicit Places using invariants and state equation in 2372 ms returned []
Implicit Place search using SMT with State Equation took 3048 ms to find 0 implicit places.
[2024-05-23 14:47:55] [INFO ] Redundant transitions in 7 ms returned []
Running 769 sub problems to find dead transitions.
[2024-05-23 14:47:55] [INFO ] Invariant cache hit.
[2024-05-23 14:47:55] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-05-23 14:48:04] [INFO ] Deduced a trap composed of 117 places in 387 ms of which 5 ms to minimize.
[2024-05-23 14:48:04] [INFO ] Deduced a trap composed of 101 places in 376 ms of which 4 ms to minimize.
[2024-05-23 14:48:08] [INFO ] Deduced a trap composed of 113 places in 359 ms of which 4 ms to minimize.
[2024-05-23 14:48:08] [INFO ] Deduced a trap composed of 85 places in 352 ms of which 4 ms to minimize.
[2024-05-23 14:48:09] [INFO ] Deduced a trap composed of 103 places in 361 ms of which 4 ms to minimize.
[2024-05-23 14:48:09] [INFO ] Deduced a trap composed of 92 places in 369 ms of which 4 ms to minimize.
[2024-05-23 14:48:10] [INFO ] Deduced a trap composed of 96 places in 364 ms of which 4 ms to minimize.
[2024-05-23 14:48:10] [INFO ] Deduced a trap composed of 99 places in 367 ms of which 4 ms to minimize.
[2024-05-23 14:48:10] [INFO ] Deduced a trap composed of 102 places in 361 ms of which 4 ms to minimize.
[2024-05-23 14:48:11] [INFO ] Deduced a trap composed of 123 places in 339 ms of which 3 ms to minimize.
[2024-05-23 14:48:11] [INFO ] Deduced a trap composed of 96 places in 359 ms of which 4 ms to minimize.
[2024-05-23 14:48:12] [INFO ] Deduced a trap composed of 68 places in 362 ms of which 4 ms to minimize.
[2024-05-23 14:48:12] [INFO ] Deduced a trap composed of 123 places in 408 ms of which 3 ms to minimize.
[2024-05-23 14:48:12] [INFO ] Deduced a trap composed of 158 places in 373 ms of which 4 ms to minimize.
[2024-05-23 14:48:13] [INFO ] Deduced a trap composed of 146 places in 351 ms of which 4 ms to minimize.
[2024-05-23 14:48:13] [INFO ] Deduced a trap composed of 100 places in 355 ms of which 4 ms to minimize.
[2024-05-23 14:48:14] [INFO ] Deduced a trap composed of 110 places in 370 ms of which 4 ms to minimize.
[2024-05-23 14:48:14] [INFO ] Deduced a trap composed of 142 places in 286 ms of which 3 ms to minimize.
[2024-05-23 14:48:14] [INFO ] Deduced a trap composed of 135 places in 346 ms of which 4 ms to minimize.
[2024-05-23 14:48:15] [INFO ] Deduced a trap composed of 135 places in 376 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-05-23 14:48:19] [INFO ] Deduced a trap composed of 89 places in 360 ms of which 4 ms to minimize.
[2024-05-23 14:48:19] [INFO ] Deduced a trap composed of 54 places in 341 ms of which 4 ms to minimize.
[2024-05-23 14:48:20] [INFO ] Deduced a trap composed of 160 places in 362 ms of which 4 ms to minimize.
[2024-05-23 14:48:21] [INFO ] Deduced a trap composed of 139 places in 375 ms of which 4 ms to minimize.
[2024-05-23 14:48:21] [INFO ] Deduced a trap composed of 143 places in 366 ms of which 4 ms to minimize.
[2024-05-23 14:48:21] [INFO ] Deduced a trap composed of 124 places in 368 ms of which 4 ms to minimize.
[2024-05-23 14:48:22] [INFO ] Deduced a trap composed of 106 places in 308 ms of which 4 ms to minimize.
[2024-05-23 14:48:22] [INFO ] Deduced a trap composed of 149 places in 367 ms of which 4 ms to minimize.
[2024-05-23 14:48:23] [INFO ] Deduced a trap composed of 149 places in 369 ms of which 4 ms to minimize.
[2024-05-23 14:48:23] [INFO ] Deduced a trap composed of 74 places in 378 ms of which 4 ms to minimize.
[2024-05-23 14:48:23] [INFO ] Deduced a trap composed of 113 places in 366 ms of which 4 ms to minimize.
[2024-05-23 14:48:24] [INFO ] Deduced a trap composed of 132 places in 356 ms of which 4 ms to minimize.
[2024-05-23 14:48:24] [INFO ] Deduced a trap composed of 172 places in 372 ms of which 4 ms to minimize.
[2024-05-23 14:48:24] [INFO ] Deduced a trap composed of 121 places in 354 ms of which 4 ms to minimize.
[2024-05-23 14:48:25] [INFO ] Deduced a trap composed of 112 places in 357 ms of which 4 ms to minimize.
[2024-05-23 14:48:25] [INFO ] Deduced a trap composed of 118 places in 360 ms of which 4 ms to minimize.
[2024-05-23 14:48:26] [INFO ] Deduced a trap composed of 101 places in 363 ms of which 4 ms to minimize.
[2024-05-23 14:48:26] [INFO ] Deduced a trap composed of 131 places in 390 ms of which 4 ms to minimize.
[2024-05-23 14:48:26] [INFO ] Deduced a trap composed of 128 places in 382 ms of which 4 ms to minimize.
SMT process timed out in 31004ms, After SMT, problems are : Problem set: 0 solved, 769 unsolved
Search for dead transitions found 0 dead transitions in 31014ms
Starting structural reductions in SI_LTL mode, iteration 1 : 377/650 places, 781/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34147 ms. Remains : 377/650 places, 781/1516 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-10
Product exploration explored 100000 steps with 24 reset in 228 ms.
Stack based approach found an accepted trace after 168 steps with 0 reset with depth 169 and stack size 169 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 34462 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 3 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 650 transition count 1396
Reduce places removed 120 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 132 rules applied. Total rules applied 252 place count 530 transition count 1384
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 518 transition count 1384
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 264 place count 518 transition count 1253
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 526 place count 387 transition count 1253
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 551 place count 362 transition count 722
Iterating global reduction 3 with 25 rules applied. Total rules applied 576 place count 362 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 578 place count 361 transition count 721
Applied a total of 578 rules in 73 ms. Remains 361 /650 variables (removed 289) and now considering 721/1516 (removed 795) transitions.
// Phase 1: matrix 721 rows 361 cols
[2024-05-23 14:48:27] [INFO ] Computed 26 invariants in 6 ms
[2024-05-23 14:48:27] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-23 14:48:27] [INFO ] Invariant cache hit.
[2024-05-23 14:48:28] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:48:29] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
[2024-05-23 14:48:29] [INFO ] Redundant transitions in 6 ms returned []
Running 709 sub problems to find dead transitions.
[2024-05-23 14:48:29] [INFO ] Invariant cache hit.
[2024-05-23 14:48:29] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-05-23 14:48:39] [INFO ] Deduced a trap composed of 114 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:48:40] [INFO ] Deduced a trap composed of 117 places in 354 ms of which 4 ms to minimize.
[2024-05-23 14:48:41] [INFO ] Deduced a trap composed of 94 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:48:41] [INFO ] Deduced a trap composed of 91 places in 327 ms of which 4 ms to minimize.
[2024-05-23 14:48:42] [INFO ] Deduced a trap composed of 66 places in 354 ms of which 4 ms to minimize.
[2024-05-23 14:48:43] [INFO ] Deduced a trap composed of 141 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:48:44] [INFO ] Deduced a trap composed of 94 places in 348 ms of which 4 ms to minimize.
[2024-05-23 14:48:44] [INFO ] Deduced a trap composed of 114 places in 348 ms of which 4 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 144 places in 344 ms of which 4 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 86 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 117 places in 352 ms of which 4 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 95 places in 339 ms of which 4 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 74 places in 353 ms of which 4 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 118 places in 344 ms of which 4 ms to minimize.
[2024-05-23 14:48:47] [INFO ] Deduced a trap composed of 61 places in 340 ms of which 4 ms to minimize.
[2024-05-23 14:48:47] [INFO ] Deduced a trap composed of 63 places in 336 ms of which 4 ms to minimize.
[2024-05-23 14:48:47] [INFO ] Deduced a trap composed of 81 places in 338 ms of which 4 ms to minimize.
[2024-05-23 14:48:48] [INFO ] Deduced a trap composed of 62 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:48:48] [INFO ] Deduced a trap composed of 67 places in 354 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-05-23 14:48:53] [INFO ] Deduced a trap composed of 104 places in 345 ms of which 4 ms to minimize.
[2024-05-23 14:48:54] [INFO ] Deduced a trap composed of 90 places in 338 ms of which 4 ms to minimize.
[2024-05-23 14:48:54] [INFO ] Deduced a trap composed of 82 places in 346 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1082 variables, and 47 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/361 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1082 variables, and 47 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/361 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/709 constraints, Known Traps: 22/22 constraints]
After SMT, in 60705ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 60714ms
Starting structural reductions in SI_LTL mode, iteration 1 : 361/650 places, 721/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63343 ms. Remains : 361/650 places, 721/1516 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-11
Product exploration explored 100000 steps with 92 reset in 230 ms.
Stack based approach found an accepted trace after 134 steps with 1 reset with depth 61 and stack size 61 in 2 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 63637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Support contains 7 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 628 transition count 1076
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 628 transition count 1076
Applied a total of 44 rules in 35 ms. Remains 628 /650 variables (removed 22) and now considering 1076/1516 (removed 440) transitions.
// Phase 1: matrix 1076 rows 628 cols
[2024-05-23 14:49:30] [INFO ] Computed 26 invariants in 9 ms
[2024-05-23 14:49:31] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-23 14:49:31] [INFO ] Invariant cache hit.
[2024-05-23 14:49:32] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:49:39] [INFO ] Implicit Places using invariants and state equation in 7714 ms returned []
Implicit Place search using SMT with State Equation took 8499 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2024-05-23 14:49:39] [INFO ] Invariant cache hit.
[2024-05-23 14:49:39] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 14:49:55] [INFO ] Deduced a trap composed of 122 places in 600 ms of which 7 ms to minimize.
[2024-05-23 14:49:56] [INFO ] Deduced a trap composed of 163 places in 653 ms of which 6 ms to minimize.
[2024-05-23 14:49:57] [INFO ] Deduced a trap composed of 223 places in 463 ms of which 6 ms to minimize.
[2024-05-23 14:49:58] [INFO ] Deduced a trap composed of 331 places in 613 ms of which 7 ms to minimize.
[2024-05-23 14:49:58] [INFO ] Deduced a trap composed of 172 places in 625 ms of which 6 ms to minimize.
[2024-05-23 14:50:01] [INFO ] Deduced a trap composed of 145 places in 605 ms of which 6 ms to minimize.
[2024-05-23 14:50:01] [INFO ] Deduced a trap composed of 139 places in 621 ms of which 7 ms to minimize.
[2024-05-23 14:50:02] [INFO ] Deduced a trap composed of 278 places in 610 ms of which 7 ms to minimize.
[2024-05-23 14:50:02] [INFO ] Deduced a trap composed of 245 places in 614 ms of which 6 ms to minimize.
[2024-05-23 14:50:03] [INFO ] Deduced a trap composed of 244 places in 620 ms of which 7 ms to minimize.
[2024-05-23 14:50:04] [INFO ] Deduced a trap composed of 217 places in 615 ms of which 6 ms to minimize.
[2024-05-23 14:50:04] [INFO ] Deduced a trap composed of 236 places in 623 ms of which 6 ms to minimize.
[2024-05-23 14:50:05] [INFO ] Deduced a trap composed of 257 places in 611 ms of which 7 ms to minimize.
[2024-05-23 14:50:06] [INFO ] Deduced a trap composed of 174 places in 612 ms of which 6 ms to minimize.
[2024-05-23 14:50:06] [INFO ] Deduced a trap composed of 241 places in 618 ms of which 6 ms to minimize.
[2024-05-23 14:50:07] [INFO ] Deduced a trap composed of 198 places in 602 ms of which 6 ms to minimize.
[2024-05-23 14:50:07] [INFO ] Deduced a trap composed of 137 places in 607 ms of which 6 ms to minimize.
[2024-05-23 14:50:08] [INFO ] Deduced a trap composed of 174 places in 598 ms of which 9 ms to minimize.
[2024-05-23 14:50:09] [INFO ] Deduced a trap composed of 178 places in 696 ms of which 7 ms to minimize.
[2024-05-23 14:50:09] [INFO ] Deduced a trap composed of 183 places in 583 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1704 variables, and 46 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 264 places in 607 ms of which 7 ms to minimize.
[2024-05-23 14:50:16] [INFO ] Deduced a trap composed of 241 places in 587 ms of which 6 ms to minimize.
[2024-05-23 14:50:17] [INFO ] Deduced a trap composed of 127 places in 723 ms of which 6 ms to minimize.
[2024-05-23 14:50:17] [INFO ] Deduced a trap composed of 231 places in 588 ms of which 6 ms to minimize.
[2024-05-23 14:50:18] [INFO ] Deduced a trap composed of 174 places in 545 ms of which 6 ms to minimize.
[2024-05-23 14:50:19] [INFO ] Deduced a trap composed of 229 places in 583 ms of which 11 ms to minimize.
[2024-05-23 14:50:19] [INFO ] Deduced a trap composed of 192 places in 643 ms of which 7 ms to minimize.
[2024-05-23 14:50:20] [INFO ] Deduced a trap composed of 126 places in 601 ms of which 6 ms to minimize.
[2024-05-23 14:50:20] [INFO ] Deduced a trap composed of 267 places in 594 ms of which 7 ms to minimize.
[2024-05-23 14:50:21] [INFO ] Deduced a trap composed of 125 places in 625 ms of which 7 ms to minimize.
[2024-05-23 14:50:22] [INFO ] Deduced a trap composed of 310 places in 611 ms of which 6 ms to minimize.
[2024-05-23 14:50:22] [INFO ] Deduced a trap composed of 305 places in 587 ms of which 7 ms to minimize.
[2024-05-23 14:50:23] [INFO ] Deduced a trap composed of 307 places in 575 ms of which 6 ms to minimize.
[2024-05-23 14:50:23] [INFO ] Deduced a trap composed of 234 places in 596 ms of which 7 ms to minimize.
[2024-05-23 14:50:24] [INFO ] Deduced a trap composed of 349 places in 716 ms of which 6 ms to minimize.
[2024-05-23 14:50:25] [INFO ] Deduced a trap composed of 314 places in 592 ms of which 6 ms to minimize.
[2024-05-23 14:50:25] [INFO ] Deduced a trap composed of 276 places in 614 ms of which 6 ms to minimize.
[2024-05-23 14:50:26] [INFO ] Deduced a trap composed of 150 places in 609 ms of which 6 ms to minimize.
[2024-05-23 14:50:27] [INFO ] Deduced a trap composed of 284 places in 583 ms of which 6 ms to minimize.
[2024-05-23 14:50:27] [INFO ] Deduced a trap composed of 295 places in 600 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 14:50:33] [INFO ] Deduced a trap composed of 207 places in 589 ms of which 6 ms to minimize.
[2024-05-23 14:50:34] [INFO ] Deduced a trap composed of 177 places in 602 ms of which 7 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 288 places in 580 ms of which 6 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 212 places in 595 ms of which 6 ms to minimize.
[2024-05-23 14:50:36] [INFO ] Deduced a trap composed of 206 places in 586 ms of which 6 ms to minimize.
[2024-05-23 14:50:36] [INFO ] Deduced a trap composed of 219 places in 582 ms of which 6 ms to minimize.
[2024-05-23 14:50:37] [INFO ] Deduced a trap composed of 237 places in 685 ms of which 7 ms to minimize.
[2024-05-23 14:50:38] [INFO ] Deduced a trap composed of 135 places in 587 ms of which 6 ms to minimize.
[2024-05-23 14:50:39] [INFO ] Deduced a trap composed of 138 places in 593 ms of which 6 ms to minimize.
[2024-05-23 14:50:39] [INFO ] Deduced a trap composed of 232 places in 596 ms of which 6 ms to minimize.
[2024-05-23 14:50:40] [INFO ] Deduced a trap composed of 176 places in 588 ms of which 6 ms to minimize.
SMT process timed out in 61158ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61170ms
Starting structural reductions in LTL mode, iteration 1 : 628/650 places, 1076/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69707 ms. Remains : 628/650 places, 1076/1516 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Anderson-PT-12-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 488 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
RANDOM walk for 40000 steps (8 resets) in 808 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 72 ms. (547 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2024-05-23 14:50:42] [INFO ] Invariant cache hit.
[2024-05-23 14:50:42] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 589/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/617 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/628 variables, 11/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 2 solved, 1 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-23 14:50:44] [INFO ] Deduced a trap composed of 560 places in 545 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/628 variables, 12/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1635 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2427ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 12 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Applied a total of 0 rules in 17 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2024-05-23 14:50:46] [INFO ] Invariant cache hit.
[2024-05-23 14:50:46] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-23 14:50:46] [INFO ] Invariant cache hit.
[2024-05-23 14:50:47] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:50:54] [INFO ] Implicit Places using invariants and state equation in 7994 ms returned []
Implicit Place search using SMT with State Equation took 8739 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2024-05-23 14:50:54] [INFO ] Invariant cache hit.
[2024-05-23 14:50:54] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 14:51:11] [INFO ] Deduced a trap composed of 122 places in 582 ms of which 6 ms to minimize.
[2024-05-23 14:51:12] [INFO ] Deduced a trap composed of 163 places in 565 ms of which 7 ms to minimize.
[2024-05-23 14:51:13] [INFO ] Deduced a trap composed of 223 places in 614 ms of which 7 ms to minimize.
[2024-05-23 14:51:13] [INFO ] Deduced a trap composed of 331 places in 592 ms of which 6 ms to minimize.
[2024-05-23 14:51:14] [INFO ] Deduced a trap composed of 172 places in 569 ms of which 6 ms to minimize.
[2024-05-23 14:51:16] [INFO ] Deduced a trap composed of 145 places in 536 ms of which 6 ms to minimize.
[2024-05-23 14:51:17] [INFO ] Deduced a trap composed of 139 places in 570 ms of which 6 ms to minimize.
[2024-05-23 14:51:17] [INFO ] Deduced a trap composed of 278 places in 562 ms of which 6 ms to minimize.
[2024-05-23 14:51:18] [INFO ] Deduced a trap composed of 245 places in 561 ms of which 6 ms to minimize.
[2024-05-23 14:51:18] [INFO ] Deduced a trap composed of 244 places in 570 ms of which 6 ms to minimize.
[2024-05-23 14:51:19] [INFO ] Deduced a trap composed of 217 places in 563 ms of which 6 ms to minimize.
[2024-05-23 14:51:19] [INFO ] Deduced a trap composed of 236 places in 560 ms of which 6 ms to minimize.
[2024-05-23 14:51:20] [INFO ] Deduced a trap composed of 257 places in 563 ms of which 6 ms to minimize.
[2024-05-23 14:51:21] [INFO ] Deduced a trap composed of 174 places in 563 ms of which 6 ms to minimize.
[2024-05-23 14:51:21] [INFO ] Deduced a trap composed of 241 places in 574 ms of which 6 ms to minimize.
[2024-05-23 14:51:22] [INFO ] Deduced a trap composed of 198 places in 605 ms of which 7 ms to minimize.
[2024-05-23 14:51:22] [INFO ] Deduced a trap composed of 137 places in 577 ms of which 6 ms to minimize.
[2024-05-23 14:51:23] [INFO ] Deduced a trap composed of 174 places in 598 ms of which 9 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 178 places in 690 ms of which 6 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 183 places in 598 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1704 variables, and 46 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 14:51:30] [INFO ] Deduced a trap composed of 264 places in 558 ms of which 7 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 241 places in 573 ms of which 6 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 127 places in 562 ms of which 6 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 231 places in 567 ms of which 6 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 174 places in 585 ms of which 7 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 229 places in 589 ms of which 7 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 192 places in 570 ms of which 6 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 126 places in 714 ms of which 7 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 267 places in 609 ms of which 6 ms to minimize.
[2024-05-23 14:51:36] [INFO ] Deduced a trap composed of 125 places in 603 ms of which 7 ms to minimize.
[2024-05-23 14:51:37] [INFO ] Deduced a trap composed of 310 places in 593 ms of which 9 ms to minimize.
[2024-05-23 14:51:37] [INFO ] Deduced a trap composed of 305 places in 705 ms of which 6 ms to minimize.
[2024-05-23 14:51:38] [INFO ] Deduced a trap composed of 307 places in 587 ms of which 7 ms to minimize.
[2024-05-23 14:51:39] [INFO ] Deduced a trap composed of 234 places in 600 ms of which 6 ms to minimize.
[2024-05-23 14:51:39] [INFO ] Deduced a trap composed of 349 places in 601 ms of which 7 ms to minimize.
[2024-05-23 14:51:40] [INFO ] Deduced a trap composed of 314 places in 586 ms of which 6 ms to minimize.
[2024-05-23 14:51:40] [INFO ] Deduced a trap composed of 276 places in 512 ms of which 6 ms to minimize.
[2024-05-23 14:51:41] [INFO ] Deduced a trap composed of 150 places in 601 ms of which 6 ms to minimize.
[2024-05-23 14:51:41] [INFO ] Deduced a trap composed of 284 places in 560 ms of which 6 ms to minimize.
[2024-05-23 14:51:42] [INFO ] Deduced a trap composed of 295 places in 494 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 207 places in 594 ms of which 6 ms to minimize.
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 177 places in 604 ms of which 6 ms to minimize.
[2024-05-23 14:51:50] [INFO ] Deduced a trap composed of 288 places in 631 ms of which 7 ms to minimize.
[2024-05-23 14:51:50] [INFO ] Deduced a trap composed of 212 places in 503 ms of which 6 ms to minimize.
[2024-05-23 14:51:51] [INFO ] Deduced a trap composed of 206 places in 585 ms of which 6 ms to minimize.
[2024-05-23 14:51:51] [INFO ] Deduced a trap composed of 219 places in 576 ms of which 6 ms to minimize.
[2024-05-23 14:51:52] [INFO ] Deduced a trap composed of 237 places in 618 ms of which 6 ms to minimize.
[2024-05-23 14:51:53] [INFO ] Deduced a trap composed of 135 places in 594 ms of which 6 ms to minimize.
[2024-05-23 14:51:54] [INFO ] Deduced a trap composed of 138 places in 596 ms of which 6 ms to minimize.
[2024-05-23 14:51:54] [INFO ] Deduced a trap composed of 232 places in 610 ms of which 7 ms to minimize.
[2024-05-23 14:51:55] [INFO ] Deduced a trap composed of 176 places in 634 ms of which 6 ms to minimize.
[2024-05-23 14:51:56] [INFO ] Deduced a trap composed of 126 places in 624 ms of which 7 ms to minimize.
SMT process timed out in 61328ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61340ms
Finished structural reductions in LTL mode , in 1 iterations and 70099 ms. Remains : 628/628 places, 1076/1076 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2024-05-23 14:51:56] [INFO ] Invariant cache hit.
[2024-05-23 14:51:56] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 14:51:57] [INFO ] Deduced a trap composed of 560 places in 551 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/628 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2486ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 628 transition count 1076
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 132 Pre rules applied. Total rules applied 142 place count 628 transition count 1076
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 274 place count 628 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 276 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 1 ms
Applied a total of 278 rules in 109 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
[2024-05-23 14:52:01] [INFO ] Redundant transitions in 13 ms returned []
Running 1018 sub problems to find dead transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 14:52:01] [INFO ] Computed 26 invariants in 8 ms
[2024-05-23 14:52:01] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 14:52:16] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-23 14:52:17] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-23 14:52:17] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-23 14:52:17] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-23 14:52:17] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:52:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:52:18] [INFO ] Deduced a trap composed of 97 places in 545 ms of which 6 ms to minimize.
[2024-05-23 14:52:18] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:52:18] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:52:19] [INFO ] Deduced a trap composed of 93 places in 518 ms of which 7 ms to minimize.
[2024-05-23 14:52:19] [INFO ] Deduced a trap composed of 82 places in 523 ms of which 7 ms to minimize.
[2024-05-23 14:52:20] [INFO ] Deduced a trap composed of 26 places in 512 ms of which 7 ms to minimize.
[2024-05-23 14:52:20] [INFO ] Deduced a trap composed of 30 places in 510 ms of which 7 ms to minimize.
[2024-05-23 14:52:21] [INFO ] Deduced a trap composed of 40 places in 548 ms of which 6 ms to minimize.
[2024-05-23 14:52:22] [INFO ] Deduced a trap composed of 69 places in 635 ms of which 6 ms to minimize.
[2024-05-23 14:52:22] [INFO ] Deduced a trap composed of 24 places in 559 ms of which 6 ms to minimize.
[2024-05-23 14:52:23] [INFO ] Deduced a trap composed of 26 places in 569 ms of which 7 ms to minimize.
[2024-05-23 14:52:23] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:52:25] [INFO ] Deduced a trap composed of 49 places in 508 ms of which 6 ms to minimize.
[2024-05-23 14:52:27] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 20/46 constraints. Problems are: Problem set: 274 solved, 744 unsolved
[2024-05-23 14:52:29] [INFO ] Deduced a trap composed of 97 places in 568 ms of which 6 ms to minimize.
[2024-05-23 14:52:30] [INFO ] Deduced a trap composed of 128 places in 531 ms of which 6 ms to minimize.
[2024-05-23 14:52:31] [INFO ] Deduced a trap composed of 116 places in 528 ms of which 7 ms to minimize.
[2024-05-23 14:52:31] [INFO ] Deduced a trap composed of 99 places in 485 ms of which 7 ms to minimize.
[2024-05-23 14:52:32] [INFO ] Deduced a trap composed of 87 places in 525 ms of which 6 ms to minimize.
[2024-05-23 14:52:32] [INFO ] Deduced a trap composed of 91 places in 521 ms of which 7 ms to minimize.
SMT process timed out in 31373ms, After SMT, problems are : Problem set: 274 solved, 744 unsolved
Search for dead transitions found 274 dead transitions in 31385ms
Found 274 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 274 transitions
Dead transitions reduction (with SMT) removed 274 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 626/628 places, 756/1076 transitions.
Graph (complete) has 1991 edges and 626 vertex of which 352 are kept as prefixes of interest. Removing 274 places using SCC suffix rule.4 ms
Discarding 274 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 352 /626 variables (removed 274) and now considering 756/756 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/628 places, 756/1076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31540 ms. Remains : 352/628 places, 756/1076 transitions.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 626 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 626 transition count 1030
Applied a total of 4 rules in 36 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 14:52:32] [INFO ] Computed 26 invariants in 8 ms
[2024-05-23 14:52:33] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-23 14:52:33] [INFO ] Invariant cache hit.
[2024-05-23 14:52:34] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:52:39] [INFO ] Implicit Places using invariants and state equation in 6231 ms returned []
Implicit Place search using SMT with State Equation took 6944 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-05-23 14:52:39] [INFO ] Invariant cache hit.
[2024-05-23 14:52:39] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 14:52:57] [INFO ] Deduced a trap composed of 227 places in 556 ms of which 6 ms to minimize.
[2024-05-23 14:53:01] [INFO ] Deduced a trap composed of 217 places in 553 ms of which 7 ms to minimize.
[2024-05-23 14:53:02] [INFO ] Deduced a trap composed of 291 places in 560 ms of which 6 ms to minimize.
[2024-05-23 14:53:03] [INFO ] Deduced a trap composed of 250 places in 558 ms of which 7 ms to minimize.
[2024-05-23 14:53:04] [INFO ] Deduced a trap composed of 364 places in 562 ms of which 6 ms to minimize.
[2024-05-23 14:53:04] [INFO ] Deduced a trap composed of 151 places in 613 ms of which 7 ms to minimize.
[2024-05-23 14:53:06] [INFO ] Deduced a trap composed of 233 places in 571 ms of which 6 ms to minimize.
[2024-05-23 14:53:06] [INFO ] Deduced a trap composed of 316 places in 562 ms of which 6 ms to minimize.
[2024-05-23 14:53:07] [INFO ] Deduced a trap composed of 319 places in 598 ms of which 7 ms to minimize.
[2024-05-23 14:53:07] [INFO ] Deduced a trap composed of 275 places in 560 ms of which 6 ms to minimize.
[2024-05-23 14:53:08] [INFO ] Deduced a trap composed of 218 places in 561 ms of which 6 ms to minimize.
[2024-05-23 14:53:09] [INFO ] Deduced a trap composed of 228 places in 566 ms of which 6 ms to minimize.
[2024-05-23 14:53:09] [INFO ] Deduced a trap composed of 95 places in 492 ms of which 6 ms to minimize.
[2024-05-23 14:53:10] [INFO ] Deduced a trap composed of 314 places in 631 ms of which 6 ms to minimize.
[2024-05-23 14:53:10] [INFO ] Deduced a trap composed of 233 places in 507 ms of which 6 ms to minimize.
SMT process timed out in 31051ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 31063ms
Starting structural reductions in LTL mode, iteration 1 : 626/628 places, 1030/1076 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38045 ms. Remains : 626/628 places, 1030/1076 transitions.
Treatment of property Anderson-PT-12-LTLFireability-12 finished in 220093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(((p2 U p3)&&p1))))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 131 Pre rules applied. Total rules applied 284 place count 508 transition count 1243
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 758
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 758
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 353 transition count 757
Applied a total of 594 rules in 55 ms. Remains 353 /650 variables (removed 297) and now considering 757/1516 (removed 759) transitions.
// Phase 1: matrix 757 rows 353 cols
[2024-05-23 14:53:10] [INFO ] Computed 26 invariants in 13 ms
[2024-05-23 14:53:11] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-23 14:53:11] [INFO ] Invariant cache hit.
[2024-05-23 14:53:11] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:53:13] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2521 ms to find 0 implicit places.
[2024-05-23 14:53:13] [INFO ] Redundant transitions in 7 ms returned []
Running 745 sub problems to find dead transitions.
[2024-05-23 14:53:13] [INFO ] Invariant cache hit.
[2024-05-23 14:53:13] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-23 14:53:21] [INFO ] Deduced a trap composed of 136 places in 363 ms of which 4 ms to minimize.
[2024-05-23 14:53:21] [INFO ] Deduced a trap composed of 127 places in 337 ms of which 4 ms to minimize.
[2024-05-23 14:53:22] [INFO ] Deduced a trap composed of 104 places in 343 ms of which 4 ms to minimize.
[2024-05-23 14:53:22] [INFO ] Deduced a trap composed of 92 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:53:23] [INFO ] Deduced a trap composed of 108 places in 337 ms of which 4 ms to minimize.
[2024-05-23 14:53:23] [INFO ] Deduced a trap composed of 96 places in 339 ms of which 3 ms to minimize.
[2024-05-23 14:53:23] [INFO ] Deduced a trap composed of 104 places in 339 ms of which 4 ms to minimize.
[2024-05-23 14:53:24] [INFO ] Deduced a trap composed of 70 places in 347 ms of which 3 ms to minimize.
[2024-05-23 14:53:26] [INFO ] Deduced a trap composed of 111 places in 349 ms of which 4 ms to minimize.
[2024-05-23 14:53:27] [INFO ] Deduced a trap composed of 116 places in 285 ms of which 3 ms to minimize.
[2024-05-23 14:53:27] [INFO ] Deduced a trap composed of 111 places in 308 ms of which 3 ms to minimize.
[2024-05-23 14:53:28] [INFO ] Deduced a trap composed of 159 places in 310 ms of which 4 ms to minimize.
[2024-05-23 14:53:28] [INFO ] Deduced a trap composed of 133 places in 316 ms of which 4 ms to minimize.
[2024-05-23 14:53:28] [INFO ] Deduced a trap composed of 165 places in 314 ms of which 3 ms to minimize.
[2024-05-23 14:53:29] [INFO ] Deduced a trap composed of 147 places in 332 ms of which 7 ms to minimize.
[2024-05-23 14:53:29] [INFO ] Deduced a trap composed of 155 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:53:29] [INFO ] Deduced a trap composed of 159 places in 314 ms of which 4 ms to minimize.
[2024-05-23 14:53:30] [INFO ] Deduced a trap composed of 158 places in 324 ms of which 3 ms to minimize.
[2024-05-23 14:53:30] [INFO ] Deduced a trap composed of 158 places in 311 ms of which 3 ms to minimize.
[2024-05-23 14:53:30] [INFO ] Deduced a trap composed of 199 places in 317 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-23 14:53:35] [INFO ] Deduced a trap composed of 171 places in 369 ms of which 3 ms to minimize.
[2024-05-23 14:53:35] [INFO ] Deduced a trap composed of 94 places in 328 ms of which 3 ms to minimize.
[2024-05-23 14:53:35] [INFO ] Deduced a trap composed of 119 places in 345 ms of which 4 ms to minimize.
[2024-05-23 14:53:36] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 4 ms to minimize.
[2024-05-23 14:53:36] [INFO ] Deduced a trap composed of 76 places in 332 ms of which 4 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 101 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 94 places in 339 ms of which 4 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 88 places in 323 ms of which 3 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 90 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 79 places in 337 ms of which 4 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 84 places in 340 ms of which 4 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 91 places in 329 ms of which 4 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 112 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 95 places in 327 ms of which 3 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 114 places in 353 ms of which 4 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 111 places in 327 ms of which 4 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 100 places in 328 ms of which 4 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 90 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 120 places in 241 ms of which 3 ms to minimize.
[2024-05-23 14:53:42] [INFO ] Deduced a trap composed of 111 places in 332 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1110 variables, and 66 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/353 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-23 14:53:52] [INFO ] Deduced a trap composed of 117 places in 346 ms of which 3 ms to minimize.
[2024-05-23 14:53:52] [INFO ] Deduced a trap composed of 121 places in 339 ms of which 4 ms to minimize.
[2024-05-23 14:53:53] [INFO ] Deduced a trap composed of 106 places in 332 ms of which 4 ms to minimize.
[2024-05-23 14:53:53] [INFO ] Deduced a trap composed of 120 places in 329 ms of which 3 ms to minimize.
[2024-05-23 14:53:53] [INFO ] Deduced a trap composed of 103 places in 326 ms of which 4 ms to minimize.
[2024-05-23 14:53:54] [INFO ] Deduced a trap composed of 105 places in 327 ms of which 3 ms to minimize.
[2024-05-23 14:53:54] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:53:54] [INFO ] Deduced a trap composed of 115 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:53:55] [INFO ] Deduced a trap composed of 91 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:53:55] [INFO ] Deduced a trap composed of 108 places in 321 ms of which 4 ms to minimize.
[2024-05-23 14:53:55] [INFO ] Deduced a trap composed of 124 places in 323 ms of which 3 ms to minimize.
[2024-05-23 14:53:56] [INFO ] Deduced a trap composed of 153 places in 325 ms of which 4 ms to minimize.
[2024-05-23 14:53:56] [INFO ] Deduced a trap composed of 85 places in 307 ms of which 4 ms to minimize.
[2024-05-23 14:53:56] [INFO ] Deduced a trap composed of 98 places in 314 ms of which 4 ms to minimize.
[2024-05-23 14:53:57] [INFO ] Deduced a trap composed of 68 places in 318 ms of which 4 ms to minimize.
[2024-05-23 14:53:57] [INFO ] Deduced a trap composed of 112 places in 365 ms of which 4 ms to minimize.
[2024-05-23 14:53:58] [INFO ] Deduced a trap composed of 117 places in 651 ms of which 4 ms to minimize.
[2024-05-23 14:53:58] [INFO ] Deduced a trap composed of 126 places in 354 ms of which 3 ms to minimize.
[2024-05-23 14:53:59] [INFO ] Deduced a trap composed of 82 places in 348 ms of which 4 ms to minimize.
[2024-05-23 14:53:59] [INFO ] Deduced a trap composed of 114 places in 301 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-23 14:54:06] [INFO ] Deduced a trap composed of 78 places in 339 ms of which 4 ms to minimize.
[2024-05-23 14:54:07] [INFO ] Deduced a trap composed of 101 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:54:08] [INFO ] Deduced a trap composed of 100 places in 341 ms of which 4 ms to minimize.
[2024-05-23 14:54:08] [INFO ] Deduced a trap composed of 111 places in 289 ms of which 4 ms to minimize.
[2024-05-23 14:54:08] [INFO ] Deduced a trap composed of 109 places in 343 ms of which 3 ms to minimize.
[2024-05-23 14:54:09] [INFO ] Deduced a trap composed of 109 places in 329 ms of which 4 ms to minimize.
[2024-05-23 14:54:09] [INFO ] Deduced a trap composed of 115 places in 344 ms of which 4 ms to minimize.
[2024-05-23 14:54:09] [INFO ] Deduced a trap composed of 104 places in 337 ms of which 3 ms to minimize.
[2024-05-23 14:54:10] [INFO ] Deduced a trap composed of 120 places in 338 ms of which 3 ms to minimize.
[2024-05-23 14:54:10] [INFO ] Deduced a trap composed of 106 places in 362 ms of which 4 ms to minimize.
[2024-05-23 14:54:10] [INFO ] Deduced a trap composed of 117 places in 338 ms of which 4 ms to minimize.
[2024-05-23 14:54:11] [INFO ] Deduced a trap composed of 99 places in 331 ms of which 3 ms to minimize.
[2024-05-23 14:54:11] [INFO ] Deduced a trap composed of 122 places in 355 ms of which 4 ms to minimize.
[2024-05-23 14:54:11] [INFO ] Deduced a trap composed of 111 places in 244 ms of which 4 ms to minimize.
[2024-05-23 14:54:12] [INFO ] Deduced a trap composed of 116 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:54:12] [INFO ] Deduced a trap composed of 129 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:54:12] [INFO ] Deduced a trap composed of 115 places in 327 ms of which 4 ms to minimize.
[2024-05-23 14:54:13] [INFO ] Deduced a trap composed of 107 places in 322 ms of which 3 ms to minimize.
[2024-05-23 14:54:13] [INFO ] Deduced a trap composed of 120 places in 365 ms of which 4 ms to minimize.
[2024-05-23 14:54:13] [INFO ] Deduced a trap composed of 125 places in 348 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1110 variables, and 106 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/353 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/745 constraints, Known Traps: 80/80 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 60715ms
Starting structural reductions in SI_LTL mode, iteration 1 : 353/650 places, 757/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63306 ms. Remains : 353/650 places, 757/1516 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0), (NOT p3)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 301 ms.
Stack based approach found an accepted trace after 319 steps with 0 reset with depth 320 and stack size 320 in 3 ms.
FORMULA Anderson-PT-12-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-13 finished in 63915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 41 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-23 14:54:14] [INFO ] Computed 26 invariants in 8 ms
[2024-05-23 14:54:15] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-23 14:54:15] [INFO ] Invariant cache hit.
[2024-05-23 14:54:15] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:54:17] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
[2024-05-23 14:54:17] [INFO ] Redundant transitions in 6 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 14:54:17] [INFO ] Invariant cache hit.
[2024-05-23 14:54:17] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:54:26] [INFO ] Deduced a trap composed of 93 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:54:27] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:54:27] [INFO ] Deduced a trap composed of 103 places in 319 ms of which 4 ms to minimize.
[2024-05-23 14:54:28] [INFO ] Deduced a trap composed of 143 places in 313 ms of which 4 ms to minimize.
[2024-05-23 14:54:28] [INFO ] Deduced a trap composed of 125 places in 330 ms of which 4 ms to minimize.
[2024-05-23 14:54:29] [INFO ] Deduced a trap composed of 101 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:54:29] [INFO ] Deduced a trap composed of 116 places in 333 ms of which 3 ms to minimize.
[2024-05-23 14:54:29] [INFO ] Deduced a trap composed of 100 places in 328 ms of which 3 ms to minimize.
[2024-05-23 14:54:30] [INFO ] Deduced a trap composed of 89 places in 372 ms of which 4 ms to minimize.
[2024-05-23 14:54:30] [INFO ] Deduced a trap composed of 114 places in 328 ms of which 4 ms to minimize.
[2024-05-23 14:54:30] [INFO ] Deduced a trap composed of 118 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:54:31] [INFO ] Deduced a trap composed of 119 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:54:31] [INFO ] Deduced a trap composed of 91 places in 330 ms of which 3 ms to minimize.
[2024-05-23 14:54:31] [INFO ] Deduced a trap composed of 105 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:54:32] [INFO ] Deduced a trap composed of 125 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:54:32] [INFO ] Deduced a trap composed of 101 places in 323 ms of which 3 ms to minimize.
[2024-05-23 14:54:32] [INFO ] Deduced a trap composed of 113 places in 318 ms of which 3 ms to minimize.
[2024-05-23 14:54:33] [INFO ] Deduced a trap composed of 103 places in 326 ms of which 3 ms to minimize.
[2024-05-23 14:54:33] [INFO ] Deduced a trap composed of 126 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:54:33] [INFO ] Deduced a trap composed of 139 places in 324 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 115 places in 326 ms of which 3 ms to minimize.
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 113 places in 326 ms of which 4 ms to minimize.
[2024-05-23 14:54:40] [INFO ] Deduced a trap composed of 106 places in 319 ms of which 4 ms to minimize.
[2024-05-23 14:54:40] [INFO ] Deduced a trap composed of 139 places in 318 ms of which 3 ms to minimize.
[2024-05-23 14:54:40] [INFO ] Deduced a trap composed of 85 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:54:41] [INFO ] Deduced a trap composed of 91 places in 326 ms of which 3 ms to minimize.
[2024-05-23 14:54:41] [INFO ] Deduced a trap composed of 119 places in 321 ms of which 4 ms to minimize.
[2024-05-23 14:54:41] [INFO ] Deduced a trap composed of 117 places in 329 ms of which 4 ms to minimize.
[2024-05-23 14:54:42] [INFO ] Deduced a trap composed of 97 places in 320 ms of which 4 ms to minimize.
[2024-05-23 14:54:42] [INFO ] Deduced a trap composed of 83 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:54:42] [INFO ] Deduced a trap composed of 131 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:54:43] [INFO ] Deduced a trap composed of 85 places in 311 ms of which 4 ms to minimize.
[2024-05-23 14:54:43] [INFO ] Deduced a trap composed of 105 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:54:44] [INFO ] Deduced a trap composed of 96 places in 326 ms of which 4 ms to minimize.
[2024-05-23 14:54:44] [INFO ] Deduced a trap composed of 139 places in 288 ms of which 3 ms to minimize.
[2024-05-23 14:54:44] [INFO ] Deduced a trap composed of 81 places in 318 ms of which 4 ms to minimize.
[2024-05-23 14:54:45] [INFO ] Deduced a trap composed of 98 places in 315 ms of which 4 ms to minimize.
[2024-05-23 14:54:45] [INFO ] Deduced a trap composed of 107 places in 320 ms of which 4 ms to minimize.
[2024-05-23 14:54:45] [INFO ] Deduced a trap composed of 144 places in 352 ms of which 4 ms to minimize.
[2024-05-23 14:54:46] [INFO ] Deduced a trap composed of 97 places in 339 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1082 variables, and 66 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 66 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 40/40 constraints]
After SMT, in 60686ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60694ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63194 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 251 ms.
Product exploration explored 100000 steps with 0 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39196 steps (8 resets) in 49 ms. (783 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 11 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-23 14:55:18] [INFO ] Invariant cache hit.
[2024-05-23 14:55:19] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-23 14:55:19] [INFO ] Invariant cache hit.
[2024-05-23 14:55:20] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:55:21] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 2656 ms to find 0 implicit places.
[2024-05-23 14:55:21] [INFO ] Redundant transitions in 6 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 14:55:21] [INFO ] Invariant cache hit.
[2024-05-23 14:55:21] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:55:31] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:55:31] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 4 ms to minimize.
[2024-05-23 14:55:32] [INFO ] Deduced a trap composed of 103 places in 358 ms of which 4 ms to minimize.
[2024-05-23 14:55:33] [INFO ] Deduced a trap composed of 143 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:55:33] [INFO ] Deduced a trap composed of 125 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:55:33] [INFO ] Deduced a trap composed of 101 places in 311 ms of which 4 ms to minimize.
[2024-05-23 14:55:34] [INFO ] Deduced a trap composed of 116 places in 327 ms of which 4 ms to minimize.
[2024-05-23 14:55:34] [INFO ] Deduced a trap composed of 100 places in 335 ms of which 4 ms to minimize.
[2024-05-23 14:55:34] [INFO ] Deduced a trap composed of 89 places in 332 ms of which 4 ms to minimize.
[2024-05-23 14:55:35] [INFO ] Deduced a trap composed of 114 places in 340 ms of which 4 ms to minimize.
[2024-05-23 14:55:35] [INFO ] Deduced a trap composed of 118 places in 329 ms of which 4 ms to minimize.
[2024-05-23 14:55:35] [INFO ] Deduced a trap composed of 119 places in 337 ms of which 4 ms to minimize.
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 91 places in 349 ms of which 3 ms to minimize.
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 105 places in 327 ms of which 4 ms to minimize.
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 125 places in 326 ms of which 4 ms to minimize.
[2024-05-23 14:55:37] [INFO ] Deduced a trap composed of 101 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:55:37] [INFO ] Deduced a trap composed of 113 places in 336 ms of which 4 ms to minimize.
[2024-05-23 14:55:38] [INFO ] Deduced a trap composed of 103 places in 352 ms of which 3 ms to minimize.
[2024-05-23 14:55:38] [INFO ] Deduced a trap composed of 126 places in 328 ms of which 4 ms to minimize.
[2024-05-23 14:55:38] [INFO ] Deduced a trap composed of 139 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:55:44] [INFO ] Deduced a trap composed of 115 places in 258 ms of which 4 ms to minimize.
[2024-05-23 14:55:44] [INFO ] Deduced a trap composed of 113 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:55:45] [INFO ] Deduced a trap composed of 106 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:55:45] [INFO ] Deduced a trap composed of 139 places in 278 ms of which 4 ms to minimize.
[2024-05-23 14:55:45] [INFO ] Deduced a trap composed of 85 places in 312 ms of which 4 ms to minimize.
[2024-05-23 14:55:46] [INFO ] Deduced a trap composed of 91 places in 318 ms of which 4 ms to minimize.
[2024-05-23 14:55:46] [INFO ] Deduced a trap composed of 119 places in 321 ms of which 4 ms to minimize.
[2024-05-23 14:55:46] [INFO ] Deduced a trap composed of 117 places in 320 ms of which 3 ms to minimize.
[2024-05-23 14:55:47] [INFO ] Deduced a trap composed of 97 places in 312 ms of which 4 ms to minimize.
[2024-05-23 14:55:47] [INFO ] Deduced a trap composed of 83 places in 320 ms of which 4 ms to minimize.
[2024-05-23 14:55:47] [INFO ] Deduced a trap composed of 131 places in 315 ms of which 4 ms to minimize.
[2024-05-23 14:55:48] [INFO ] Deduced a trap composed of 85 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:55:48] [INFO ] Deduced a trap composed of 105 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:55:48] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 3 ms to minimize.
[2024-05-23 14:55:49] [INFO ] Deduced a trap composed of 139 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:55:49] [INFO ] Deduced a trap composed of 81 places in 260 ms of which 4 ms to minimize.
[2024-05-23 14:55:49] [INFO ] Deduced a trap composed of 98 places in 323 ms of which 3 ms to minimize.
[2024-05-23 14:55:50] [INFO ] Deduced a trap composed of 107 places in 330 ms of which 3 ms to minimize.
[2024-05-23 14:55:50] [INFO ] Deduced a trap composed of 144 places in 300 ms of which 4 ms to minimize.
[2024-05-23 14:55:50] [INFO ] Deduced a trap composed of 97 places in 335 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.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 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1082 variables, and 66 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 66 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 40/40 constraints]
After SMT, in 60691ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60699ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63379 ms. Remains : 350/350 places, 732/732 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 773391 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 773391 steps, saw 598041 distinct states, run finished after 3008 ms. (steps per millisecond=257 ) properties seen :0
[2024-05-23 14:56:25] [INFO ] Invariant cache hit.
[2024-05-23 14:56:25] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1032ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 27 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 349/350 places, 731/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 833308 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 1
Probabilistic random walk after 833308 steps, saw 641719 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
// Phase 1: matrix 731 rows 349 cols
[2024-05-23 14:56:29] [INFO ] Computed 26 invariants in 6 ms
[2024-05-23 14:56:29] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 951ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 12 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 11 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-05-23 14:56:30] [INFO ] Invariant cache hit.
[2024-05-23 14:56:31] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-23 14:56:31] [INFO ] Invariant cache hit.
[2024-05-23 14:56:31] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:56:33] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2024-05-23 14:56:33] [INFO ] Redundant transitions in 6 ms returned []
Running 719 sub problems to find dead transitions.
[2024-05-23 14:56:33] [INFO ] Invariant cache hit.
[2024-05-23 14:56:33] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-23 14:56:42] [INFO ] Deduced a trap composed of 114 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:56:43] [INFO ] Deduced a trap composed of 95 places in 330 ms of which 4 ms to minimize.
[2024-05-23 14:56:43] [INFO ] Deduced a trap composed of 105 places in 289 ms of which 4 ms to minimize.
[2024-05-23 14:56:43] [INFO ] Deduced a trap composed of 84 places in 315 ms of which 4 ms to minimize.
[2024-05-23 14:56:44] [INFO ] Deduced a trap composed of 143 places in 313 ms of which 3 ms to minimize.
[2024-05-23 14:56:44] [INFO ] Deduced a trap composed of 92 places in 309 ms of which 4 ms to minimize.
[2024-05-23 14:56:45] [INFO ] Deduced a trap composed of 113 places in 322 ms of which 4 ms to minimize.
[2024-05-23 14:56:45] [INFO ] Deduced a trap composed of 104 places in 317 ms of which 3 ms to minimize.
[2024-05-23 14:56:46] [INFO ] Deduced a trap composed of 101 places in 325 ms of which 3 ms to minimize.
[2024-05-23 14:56:46] [INFO ] Deduced a trap composed of 132 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:56:47] [INFO ] Deduced a trap composed of 107 places in 358 ms of which 4 ms to minimize.
[2024-05-23 14:56:47] [INFO ] Deduced a trap composed of 125 places in 340 ms of which 4 ms to minimize.
[2024-05-23 14:56:47] [INFO ] Deduced a trap composed of 138 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:56:48] [INFO ] Deduced a trap composed of 83 places in 359 ms of which 4 ms to minimize.
[2024-05-23 14:56:48] [INFO ] Deduced a trap composed of 57 places in 352 ms of which 4 ms to minimize.
[2024-05-23 14:56:48] [INFO ] Deduced a trap composed of 97 places in 354 ms of which 4 ms to minimize.
[2024-05-23 14:56:49] [INFO ] Deduced a trap composed of 147 places in 338 ms of which 4 ms to minimize.
[2024-05-23 14:56:49] [INFO ] Deduced a trap composed of 88 places in 310 ms of which 3 ms to minimize.
[2024-05-23 14:56:49] [INFO ] Deduced a trap composed of 111 places in 314 ms of which 4 ms to minimize.
[2024-05-23 14:56:50] [INFO ] Deduced a trap composed of 109 places in 298 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-23 14:56:53] [INFO ] Deduced a trap composed of 127 places in 300 ms of which 3 ms to minimize.
[2024-05-23 14:56:54] [INFO ] Deduced a trap composed of 98 places in 326 ms of which 4 ms to minimize.
[2024-05-23 14:56:55] [INFO ] Deduced a trap composed of 101 places in 329 ms of which 4 ms to minimize.
[2024-05-23 14:56:56] [INFO ] Deduced a trap composed of 102 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:56:56] [INFO ] Deduced a trap composed of 72 places in 311 ms of which 4 ms to minimize.
[2024-05-23 14:56:56] [INFO ] Deduced a trap composed of 97 places in 320 ms of which 4 ms to minimize.
[2024-05-23 14:56:56] [INFO ] Deduced a trap composed of 101 places in 309 ms of which 3 ms to minimize.
[2024-05-23 14:56:57] [INFO ] Deduced a trap composed of 90 places in 243 ms of which 4 ms to minimize.
[2024-05-23 14:56:57] [INFO ] Deduced a trap composed of 117 places in 307 ms of which 3 ms to minimize.
[2024-05-23 14:56:57] [INFO ] Deduced a trap composed of 79 places in 311 ms of which 4 ms to minimize.
[2024-05-23 14:56:58] [INFO ] Deduced a trap composed of 117 places in 307 ms of which 4 ms to minimize.
[2024-05-23 14:56:58] [INFO ] Deduced a trap composed of 84 places in 307 ms of which 4 ms to minimize.
[2024-05-23 14:56:58] [INFO ] Deduced a trap composed of 85 places in 301 ms of which 4 ms to minimize.
[2024-05-23 14:56:59] [INFO ] Deduced a trap composed of 96 places in 319 ms of which 4 ms to minimize.
[2024-05-23 14:56:59] [INFO ] Deduced a trap composed of 80 places in 274 ms of which 4 ms to minimize.
[2024-05-23 14:56:59] [INFO ] Deduced a trap composed of 84 places in 311 ms of which 4 ms to minimize.
[2024-05-23 14:57:00] [INFO ] Deduced a trap composed of 76 places in 345 ms of which 4 ms to minimize.
[2024-05-23 14:57:00] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 4 ms to minimize.
[2024-05-23 14:57:00] [INFO ] Deduced a trap composed of 80 places in 343 ms of which 4 ms to minimize.
[2024-05-23 14:57:01] [INFO ] Deduced a trap composed of 86 places in 299 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1080 variables, and 66 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/349 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-23 14:57:09] [INFO ] Deduced a trap composed of 97 places in 312 ms of which 4 ms to minimize.
[2024-05-23 14:57:10] [INFO ] Deduced a trap composed of 61 places in 357 ms of which 3 ms to minimize.
[2024-05-23 14:57:10] [INFO ] Deduced a trap composed of 80 places in 368 ms of which 4 ms to minimize.
[2024-05-23 14:57:11] [INFO ] Deduced a trap composed of 81 places in 342 ms of which 3 ms to minimize.
[2024-05-23 14:57:11] [INFO ] Deduced a trap composed of 92 places in 416 ms of which 4 ms to minimize.
[2024-05-23 14:57:12] [INFO ] Deduced a trap composed of 96 places in 325 ms of which 4 ms to minimize.
[2024-05-23 14:57:12] [INFO ] Deduced a trap composed of 109 places in 351 ms of which 4 ms to minimize.
[2024-05-23 14:57:13] [INFO ] Deduced a trap composed of 107 places in 346 ms of which 4 ms to minimize.
[2024-05-23 14:57:13] [INFO ] Deduced a trap composed of 76 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:57:13] [INFO ] Deduced a trap composed of 120 places in 354 ms of which 4 ms to minimize.
[2024-05-23 14:57:14] [INFO ] Deduced a trap composed of 96 places in 362 ms of which 4 ms to minimize.
[2024-05-23 14:57:14] [INFO ] Deduced a trap composed of 93 places in 347 ms of which 4 ms to minimize.
[2024-05-23 14:57:14] [INFO ] Deduced a trap composed of 96 places in 353 ms of which 4 ms to minimize.
[2024-05-23 14:57:15] [INFO ] Deduced a trap composed of 92 places in 297 ms of which 4 ms to minimize.
[2024-05-23 14:57:15] [INFO ] Deduced a trap composed of 130 places in 397 ms of which 3 ms to minimize.
[2024-05-23 14:57:16] [INFO ] Deduced a trap composed of 90 places in 404 ms of which 5 ms to minimize.
[2024-05-23 14:57:16] [INFO ] Deduced a trap composed of 71 places in 451 ms of which 4 ms to minimize.
[2024-05-23 14:57:16] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 4 ms to minimize.
[2024-05-23 14:57:17] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 3 ms to minimize.
[2024-05-23 14:57:17] [INFO ] Deduced a trap composed of 84 places in 310 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1080 variables, and 86 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/349 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 60/60 constraints]
After SMT, in 60738ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63227 ms. Remains : 349/349 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 19 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2024-05-23 14:57:33] [INFO ] Computed 26 invariants in 4 ms
[2024-05-23 14:57:33] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 14:57:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 14:57:34] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 15 ms returned sat
[2024-05-23 14:57:34] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 14:57:34] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 14:57:34] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 540 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 237 ms.
Product exploration explored 100000 steps with 0 reset in 284 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 11 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-23 14:57:35] [INFO ] Computed 26 invariants in 5 ms
[2024-05-23 14:57:35] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-23 14:57:35] [INFO ] Invariant cache hit.
[2024-05-23 14:57:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 14:57:37] [INFO ] Implicit Places using invariants and state equation in 1912 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
[2024-05-23 14:57:37] [INFO ] Redundant transitions in 6 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 14:57:37] [INFO ] Invariant cache hit.
[2024-05-23 14:57:37] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:57:47] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 4 ms to minimize.
[2024-05-23 14:57:47] [INFO ] Deduced a trap composed of 47 places in 318 ms of which 4 ms to minimize.
[2024-05-23 14:57:48] [INFO ] Deduced a trap composed of 103 places in 313 ms of which 4 ms to minimize.
[2024-05-23 14:57:49] [INFO ] Deduced a trap composed of 143 places in 333 ms of which 4 ms to minimize.
[2024-05-23 14:57:49] [INFO ] Deduced a trap composed of 125 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:57:49] [INFO ] Deduced a trap composed of 101 places in 302 ms of which 3 ms to minimize.
[2024-05-23 14:57:50] [INFO ] Deduced a trap composed of 116 places in 344 ms of which 4 ms to minimize.
[2024-05-23 14:57:50] [INFO ] Deduced a trap composed of 100 places in 330 ms of which 3 ms to minimize.
[2024-05-23 14:57:50] [INFO ] Deduced a trap composed of 89 places in 331 ms of which 3 ms to minimize.
[2024-05-23 14:57:51] [INFO ] Deduced a trap composed of 114 places in 331 ms of which 7 ms to minimize.
[2024-05-23 14:57:51] [INFO ] Deduced a trap composed of 118 places in 327 ms of which 4 ms to minimize.
[2024-05-23 14:57:51] [INFO ] Deduced a trap composed of 119 places in 331 ms of which 4 ms to minimize.
[2024-05-23 14:57:52] [INFO ] Deduced a trap composed of 91 places in 358 ms of which 4 ms to minimize.
[2024-05-23 14:57:52] [INFO ] Deduced a trap composed of 105 places in 320 ms of which 3 ms to minimize.
[2024-05-23 14:57:53] [INFO ] Deduced a trap composed of 125 places in 323 ms of which 4 ms to minimize.
[2024-05-23 14:57:53] [INFO ] Deduced a trap composed of 101 places in 319 ms of which 4 ms to minimize.
[2024-05-23 14:57:53] [INFO ] Deduced a trap composed of 113 places in 345 ms of which 4 ms to minimize.
[2024-05-23 14:57:54] [INFO ] Deduced a trap composed of 103 places in 335 ms of which 4 ms to minimize.
[2024-05-23 14:57:54] [INFO ] Deduced a trap composed of 126 places in 287 ms of which 4 ms to minimize.
[2024-05-23 14:57:54] [INFO ] Deduced a trap composed of 139 places in 331 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 14:58:00] [INFO ] Deduced a trap composed of 115 places in 264 ms of which 4 ms to minimize.
[2024-05-23 14:58:00] [INFO ] Deduced a trap composed of 113 places in 321 ms of which 3 ms to minimize.
[2024-05-23 14:58:01] [INFO ] Deduced a trap composed of 106 places in 330 ms of which 4 ms to minimize.
[2024-05-23 14:58:01] [INFO ] Deduced a trap composed of 139 places in 324 ms of which 4 ms to minimize.
[2024-05-23 14:58:01] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 4 ms to minimize.
[2024-05-23 14:58:02] [INFO ] Deduced a trap composed of 91 places in 334 ms of which 4 ms to minimize.
[2024-05-23 14:58:02] [INFO ] Deduced a trap composed of 119 places in 292 ms of which 3 ms to minimize.
[2024-05-23 14:58:02] [INFO ] Deduced a trap composed of 117 places in 302 ms of which 4 ms to minimize.
[2024-05-23 14:58:03] [INFO ] Deduced a trap composed of 97 places in 308 ms of which 4 ms to minimize.
[2024-05-23 14:58:03] [INFO ] Deduced a trap composed of 83 places in 305 ms of which 4 ms to minimize.
[2024-05-23 14:58:03] [INFO ] Deduced a trap composed of 131 places in 302 ms of which 4 ms to minimize.
[2024-05-23 14:58:03] [INFO ] Deduced a trap composed of 85 places in 310 ms of which 3 ms to minimize.
[2024-05-23 14:58:04] [INFO ] Deduced a trap composed of 105 places in 325 ms of which 4 ms to minimize.
[2024-05-23 14:58:04] [INFO ] Deduced a trap composed of 96 places in 326 ms of which 4 ms to minimize.
[2024-05-23 14:58:05] [INFO ] Deduced a trap composed of 139 places in 306 ms of which 4 ms to minimize.
[2024-05-23 14:58:05] [INFO ] Deduced a trap composed of 81 places in 302 ms of which 4 ms to minimize.
[2024-05-23 14:58:05] [INFO ] Deduced a trap composed of 98 places in 302 ms of which 3 ms to minimize.
[2024-05-23 14:58:06] [INFO ] Deduced a trap composed of 107 places in 306 ms of which 4 ms to minimize.
[2024-05-23 14:58:06] [INFO ] Deduced a trap composed of 144 places in 312 ms of which 4 ms to minimize.
[2024-05-23 14:58:06] [INFO ] Deduced a trap composed of 97 places in 315 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1082 variables, and 66 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 66 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 40/40 constraints]
After SMT, in 60738ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63342 ms. Remains : 350/350 places, 732/732 transitions.
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 263776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-23 14:58:39] [INFO ] Flatten gal took : 99 ms
[2024-05-23 14:58:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-23 14:58:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 650 places, 1516 transitions and 5506 arcs took 16 ms.
Total runtime 1005271 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-12
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 650
TRANSITIONS: 1516
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.012s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.003s]
----------------------------------------------------------------------
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: 3713
MODEL NAME: /home/mcc/execution/413/model
650 places, 1516 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.
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="Anderson-PT-12"
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 Anderson-PT-12, 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 r003-smll-171620117600380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 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 '
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 ;