Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505200124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M 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 CANInsertWithFailure-PT-040-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717188622289

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:50:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:50:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:50:23] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2024-05-31 20:50:23] [INFO ] Transformed 3684 places.
[2024-05-31 20:50:23] [INFO ] Transformed 9840 transitions.
[2024-05-31 20:50:24] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 565 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 20:50:25] [INFO ] Computed 42 invariants in 479 ms
[2024-05-31 20:50:27] [INFO ] Implicit Places using invariants in 2592 ms returned []
[2024-05-31 20:50:27] [INFO ] Invariant cache hit.
[2024-05-31 20:50:30] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 20:51:00] [INFO ] Performed 447/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:51:07] [INFO ] Implicit Places using invariants and state equation in 39992 ms returned []
Implicit Place search using SMT with State Equation took 42610 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 20:51:07] [INFO ] Invariant cache hit.
[2024-05-31 20:51:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 40148ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 40255ms
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83503 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 43 out of 3683 places after structural reductions.
[2024-05-31 20:51:48] [INFO ] Flatten gal took : 412 ms
[2024-05-31 20:51:48] [INFO ] Flatten gal took : 295 ms
[2024-05-31 20:51:49] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 37 out of 3683 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (40 resets) in 2406 ms. (16 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
[2024-05-31 20:51:50] [INFO ] Invariant cache hit.
[2024-05-31 20:51:50] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 3595/3603 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:51:51] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 17 ms to minimize.
[2024-05-31 20:51:51] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 2 ms to minimize.
[2024-05-31 20:51:51] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2024-05-31 20:51:51] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-31 20:51:51] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:51:51] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:51:52] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-31 20:51:52] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-31 20:51:52] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:51:52] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:51:52] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:51:52] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:51:53] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:51:53] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:51:53] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:51:53] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:51:53] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:51:53] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:51:53] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:51:54] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 76/3679 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:51:58] [INFO ] Deduced a trap composed of 82 places in 3481 ms of which 26 ms to minimize.
SMT process timed out in 8519ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1555 Post agglomeration using F-continuation condition.Transition count delta: 1555
Deduced a syphon composed of 1555 places in 6 ms
Reduce places removed 1555 places and 0 transitions.
Iterating global reduction 2 with 3110 rules applied. Total rules applied 3668 place count 1849 transition count 8006
Drop transitions (Redundant composition of simpler transitions.) removed 1478 transitions
Redundant transition composition rules discarded 1478 transitions
Iterating global reduction 2 with 1478 rules applied. Total rules applied 5146 place count 1849 transition count 6528
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5148 place count 1849 transition count 6526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5150 place count 1847 transition count 6526
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6790 place count 1847 transition count 6526
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 6830 place count 1847 transition count 6526
Applied a total of 6830 rules in 1786 ms. Remains 1847 /3683 variables (removed 1836) and now considering 6526/9840 (removed 3314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1787 ms. Remains : 1847/3683 places, 6526/9840 transitions.
RANDOM walk for 40000 steps (213 resets) in 1236 ms. (32 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
// Phase 1: matrix 6526 rows 1847 cols
[2024-05-31 20:52:01] [INFO ] Computed 42 invariants in 166 ms
[2024-05-31 20:52:01] [INFO ] State equation strengthened by 6392 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:52:01] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1843 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1843 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1845 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:52:03] [INFO ] Deduced a trap composed of 51 places in 1448 ms of which 12 ms to minimize.
[2024-05-31 20:52:05] [INFO ] Deduced a trap composed of 49 places in 1437 ms of which 12 ms to minimize.
[2024-05-31 20:52:06] [INFO ] Deduced a trap composed of 49 places in 1397 ms of which 11 ms to minimize.
[2024-05-31 20:52:07] [INFO ] Deduced a trap composed of 65 places in 1361 ms of which 11 ms to minimize.
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 50 places in 1417 ms of which 10 ms to minimize.
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 53 places in 1392 ms of which 11 ms to minimize.
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 50 places in 1292 ms of which 10 ms to minimize.
[2024-05-31 20:52:13] [INFO ] Deduced a trap composed of 58 places in 1412 ms of which 12 ms to minimize.
[2024-05-31 20:52:14] [INFO ] Deduced a trap composed of 64 places in 1460 ms of which 11 ms to minimize.
[2024-05-31 20:52:16] [INFO ] Deduced a trap composed of 75 places in 1365 ms of which 10 ms to minimize.
[2024-05-31 20:52:17] [INFO ] Deduced a trap composed of 76 places in 1301 ms of which 10 ms to minimize.
[2024-05-31 20:52:19] [INFO ] Deduced a trap composed of 62 places in 1293 ms of which 11 ms to minimize.
[2024-05-31 20:52:20] [INFO ] Deduced a trap composed of 60 places in 1225 ms of which 10 ms to minimize.
[2024-05-31 20:52:21] [INFO ] Deduced a trap composed of 59 places in 1331 ms of which 11 ms to minimize.
[2024-05-31 20:52:22] [INFO ] Deduced a trap composed of 86 places in 1278 ms of which 10 ms to minimize.
[2024-05-31 20:52:24] [INFO ] Deduced a trap composed of 58 places in 1158 ms of which 9 ms to minimize.
[2024-05-31 20:52:25] [INFO ] Deduced a trap composed of 58 places in 1132 ms of which 9 ms to minimize.
[2024-05-31 20:52:26] [INFO ] Deduced a trap composed of 54 places in 1204 ms of which 10 ms to minimize.
[2024-05-31 20:52:27] [INFO ] Deduced a trap composed of 52 places in 1172 ms of which 10 ms to minimize.
[2024-05-31 20:52:28] [INFO ] Deduced a trap composed of 50 places in 1152 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1845 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:52:29] [INFO ] Deduced a trap composed of 51 places in 1045 ms of which 9 ms to minimize.
[2024-05-31 20:52:31] [INFO ] Deduced a trap composed of 54 places in 1061 ms of which 9 ms to minimize.
[2024-05-31 20:52:32] [INFO ] Deduced a trap composed of 48 places in 1073 ms of which 9 ms to minimize.
[2024-05-31 20:52:33] [INFO ] Deduced a trap composed of 76 places in 1064 ms of which 9 ms to minimize.
[2024-05-31 20:52:34] [INFO ] Deduced a trap composed of 62 places in 1069 ms of which 9 ms to minimize.
[2024-05-31 20:52:35] [INFO ] Deduced a trap composed of 60 places in 1036 ms of which 9 ms to minimize.
[2024-05-31 20:52:36] [INFO ] Deduced a trap composed of 63 places in 1037 ms of which 10 ms to minimize.
[2024-05-31 20:52:37] [INFO ] Deduced a trap composed of 64 places in 1007 ms of which 8 ms to minimize.
[2024-05-31 20:52:38] [INFO ] Deduced a trap composed of 53 places in 1016 ms of which 10 ms to minimize.
[2024-05-31 20:52:39] [INFO ] Deduced a trap composed of 55 places in 940 ms of which 8 ms to minimize.
[2024-05-31 20:52:40] [INFO ] Deduced a trap composed of 70 places in 1081 ms of which 8 ms to minimize.
[2024-05-31 20:52:41] [INFO ] Deduced a trap composed of 53 places in 974 ms of which 8 ms to minimize.
[2024-05-31 20:52:42] [INFO ] Deduced a trap composed of 53 places in 975 ms of which 9 ms to minimize.
[2024-05-31 20:52:43] [INFO ] Deduced a trap composed of 50 places in 995 ms of which 9 ms to minimize.
[2024-05-31 20:52:44] [INFO ] Deduced a trap composed of 53 places in 994 ms of which 9 ms to minimize.
[2024-05-31 20:52:45] [INFO ] Deduced a trap composed of 54 places in 975 ms of which 9 ms to minimize.
[2024-05-31 20:52:46] [INFO ] Deduced a trap composed of 50 places in 968 ms of which 9 ms to minimize.
SMT process timed out in 45642ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1847 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1847/1847 places, 6526/6526 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1845 transition count 6524
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1845 transition count 6523
Applied a total of 6 rules in 550 ms. Remains 1845 /1847 variables (removed 2) and now considering 6523/6526 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 1845/1847 places, 6523/6526 transitions.
RANDOM walk for 40000 steps (216 resets) in 750 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 99158 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 99158 steps, saw 25533 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-31 20:52:50] [INFO ] Computed 42 invariants in 142 ms
[2024-05-31 20:52:50] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:52:51] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:52:52] [INFO ] Deduced a trap composed of 52 places in 1291 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6523/8366 variables, 1843/1887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8366 variables, 6396/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8368 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8368 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/8368 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5573 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6396/6396 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:52:56] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:52:58] [INFO ] Deduced a trap composed of 53 places in 1346 ms of which 10 ms to minimize.
[2024-05-31 20:52:59] [INFO ] Deduced a trap composed of 48 places in 1416 ms of which 12 ms to minimize.
[2024-05-31 20:53:01] [INFO ] Deduced a trap composed of 50 places in 1415 ms of which 12 ms to minimize.
[2024-05-31 20:53:02] [INFO ] Deduced a trap composed of 60 places in 1364 ms of which 10 ms to minimize.
[2024-05-31 20:53:03] [INFO ] Deduced a trap composed of 51 places in 1251 ms of which 11 ms to minimize.
[2024-05-31 20:53:05] [INFO ] Deduced a trap composed of 60 places in 1291 ms of which 10 ms to minimize.
[2024-05-31 20:53:06] [INFO ] Deduced a trap composed of 52 places in 1249 ms of which 10 ms to minimize.
[2024-05-31 20:53:07] [INFO ] Deduced a trap composed of 54 places in 1286 ms of which 12 ms to minimize.
[2024-05-31 20:53:09] [INFO ] Deduced a trap composed of 68 places in 1304 ms of which 10 ms to minimize.
[2024-05-31 20:53:10] [INFO ] Deduced a trap composed of 52 places in 1270 ms of which 10 ms to minimize.
[2024-05-31 20:53:11] [INFO ] Deduced a trap composed of 52 places in 1350 ms of which 10 ms to minimize.
[2024-05-31 20:53:13] [INFO ] Deduced a trap composed of 49 places in 1270 ms of which 10 ms to minimize.
[2024-05-31 20:53:14] [INFO ] Deduced a trap composed of 52 places in 1325 ms of which 10 ms to minimize.
[2024-05-31 20:53:15] [INFO ] Deduced a trap composed of 58 places in 1196 ms of which 10 ms to minimize.
[2024-05-31 20:53:17] [INFO ] Deduced a trap composed of 53 places in 1216 ms of which 10 ms to minimize.
[2024-05-31 20:53:18] [INFO ] Deduced a trap composed of 58 places in 1223 ms of which 9 ms to minimize.
[2024-05-31 20:53:19] [INFO ] Deduced a trap composed of 62 places in 1198 ms of which 10 ms to minimize.
[2024-05-31 20:53:20] [INFO ] Deduced a trap composed of 56 places in 1158 ms of which 10 ms to minimize.
[2024-05-31 20:53:21] [INFO ] Deduced a trap composed of 52 places in 1108 ms of which 9 ms to minimize.
[2024-05-31 20:53:22] [INFO ] Deduced a trap composed of 53 places in 1087 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:53:24] [INFO ] Deduced a trap composed of 56 places in 1114 ms of which 9 ms to minimize.
[2024-05-31 20:53:25] [INFO ] Deduced a trap composed of 52 places in 1093 ms of which 11 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 53 places in 1076 ms of which 9 ms to minimize.
[2024-05-31 20:53:27] [INFO ] Deduced a trap composed of 52 places in 1111 ms of which 10 ms to minimize.
[2024-05-31 20:53:28] [INFO ] Deduced a trap composed of 48 places in 1103 ms of which 9 ms to minimize.
[2024-05-31 20:53:29] [INFO ] Deduced a trap composed of 50 places in 1090 ms of which 9 ms to minimize.
[2024-05-31 20:53:30] [INFO ] Deduced a trap composed of 51 places in 1089 ms of which 9 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 57 places in 1088 ms of which 10 ms to minimize.
[2024-05-31 20:53:33] [INFO ] Deduced a trap composed of 57 places in 1092 ms of which 9 ms to minimize.
[2024-05-31 20:53:34] [INFO ] Deduced a trap composed of 107 places in 1103 ms of which 9 ms to minimize.
[2024-05-31 20:53:35] [INFO ] Deduced a trap composed of 63 places in 1005 ms of which 8 ms to minimize.
[2024-05-31 20:53:36] [INFO ] Deduced a trap composed of 54 places in 1033 ms of which 9 ms to minimize.
[2024-05-31 20:53:37] [INFO ] Deduced a trap composed of 53 places in 1030 ms of which 9 ms to minimize.
[2024-05-31 20:53:38] [INFO ] Deduced a trap composed of 53 places in 997 ms of which 9 ms to minimize.
[2024-05-31 20:53:39] [INFO ] Deduced a trap composed of 54 places in 990 ms of which 9 ms to minimize.
[2024-05-31 20:53:40] [INFO ] Deduced a trap composed of 56 places in 1013 ms of which 9 ms to minimize.
[2024-05-31 20:53:41] [INFO ] Deduced a trap composed of 59 places in 1040 ms of which 9 ms to minimize.
[2024-05-31 20:53:42] [INFO ] Deduced a trap composed of 58 places in 1029 ms of which 9 ms to minimize.
[2024-05-31 20:53:43] [INFO ] Deduced a trap composed of 55 places in 960 ms of which 9 ms to minimize.
[2024-05-31 20:53:44] [INFO ] Deduced a trap composed of 56 places in 1029 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:53:45] [INFO ] Deduced a trap composed of 62 places in 1079 ms of which 9 ms to minimize.
[2024-05-31 20:53:46] [INFO ] Deduced a trap composed of 54 places in 1019 ms of which 8 ms to minimize.
[2024-05-31 20:53:47] [INFO ] Deduced a trap composed of 52 places in 1037 ms of which 8 ms to minimize.
[2024-05-31 20:53:48] [INFO ] Deduced a trap composed of 66 places in 1049 ms of which 10 ms to minimize.
[2024-05-31 20:53:49] [INFO ] Deduced a trap composed of 60 places in 1001 ms of which 9 ms to minimize.
[2024-05-31 20:53:50] [INFO ] Deduced a trap composed of 60 places in 987 ms of which 9 ms to minimize.
[2024-05-31 20:53:51] [INFO ] Deduced a trap composed of 56 places in 936 ms of which 8 ms to minimize.
[2024-05-31 20:53:52] [INFO ] Deduced a trap composed of 45 places in 905 ms of which 8 ms to minimize.
[2024-05-31 20:53:53] [INFO ] Deduced a trap composed of 83 places in 1003 ms of which 8 ms to minimize.
[2024-05-31 20:53:54] [INFO ] Deduced a trap composed of 58 places in 925 ms of which 9 ms to minimize.
[2024-05-31 20:53:55] [INFO ] Deduced a trap composed of 57 places in 893 ms of which 8 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 54 places in 844 ms of which 8 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 60 places in 834 ms of which 7 ms to minimize.
[2024-05-31 20:53:58] [INFO ] Deduced a trap composed of 56 places in 828 ms of which 7 ms to minimize.
[2024-05-31 20:53:59] [INFO ] Deduced a trap composed of 56 places in 830 ms of which 8 ms to minimize.
[2024-05-31 20:54:00] [INFO ] Deduced a trap composed of 57 places in 835 ms of which 8 ms to minimize.
[2024-05-31 20:54:01] [INFO ] Deduced a trap composed of 58 places in 878 ms of which 8 ms to minimize.
[2024-05-31 20:54:01] [INFO ] Deduced a trap composed of 60 places in 853 ms of which 8 ms to minimize.
[2024-05-31 20:54:02] [INFO ] Deduced a trap composed of 58 places in 802 ms of which 7 ms to minimize.
[2024-05-31 20:54:03] [INFO ] Deduced a trap composed of 72 places in 903 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1843 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 74 places in 951 ms of which 9 ms to minimize.
[2024-05-31 20:54:05] [INFO ] Deduced a trap composed of 58 places in 909 ms of which 8 ms to minimize.
[2024-05-31 20:54:06] [INFO ] Deduced a trap composed of 56 places in 964 ms of which 8 ms to minimize.
[2024-05-31 20:54:07] [INFO ] Deduced a trap composed of 56 places in 954 ms of which 8 ms to minimize.
[2024-05-31 20:54:08] [INFO ] Deduced a trap composed of 57 places in 974 ms of which 8 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 54 places in 946 ms of which 9 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Deduced a trap composed of 54 places in 915 ms of which 8 ms to minimize.
[2024-05-31 20:54:11] [INFO ] Deduced a trap composed of 55 places in 878 ms of which 9 ms to minimize.
[2024-05-31 20:54:12] [INFO ] Deduced a trap composed of 57 places in 910 ms of which 8 ms to minimize.
SMT process timed out in 81719ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 160 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 157 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-31 20:54:12] [INFO ] Invariant cache hit.
[2024-05-31 20:54:14] [INFO ] Implicit Places using invariants in 1874 ms returned []
[2024-05-31 20:54:14] [INFO ] Invariant cache hit.
[2024-05-31 20:54:16] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-31 20:54:46] [INFO ] Performed 741/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:55:16] [INFO ] Performed 1780/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 20:55:18] [INFO ] Implicit Places using invariants and state equation in 64172 ms returned []
Implicit Place search using SMT with State Equation took 66047 ms to find 0 implicit places.
[2024-05-31 20:55:19] [INFO ] Redundant transitions in 636 ms returned []
Running 6483 sub problems to find dead transitions.
[2024-05-31 20:55:19] [INFO ] Invariant cache hit.
[2024-05-31 20:55:19] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6483 unsolved
SMT process timed out in 36166ms, After SMT, problems are : Problem set: 0 solved, 6483 unsolved
Search for dead transitions found 0 dead transitions in 36227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103098 ms. Remains : 1845/1845 places, 6523/6523 transitions.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 162 stabilizing places and 280 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' '!(X(F(((X(p0) U p1)&&!p0))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 183 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 20:55:56] [INFO ] Computed 42 invariants in 409 ms
[2024-05-31 20:55:58] [INFO ] Implicit Places using invariants in 2523 ms returned []
[2024-05-31 20:55:58] [INFO ] Invariant cache hit.
[2024-05-31 20:56:01] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 20:56:32] [INFO ] Performed 357/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:56:43] [INFO ] Implicit Places using invariants and state equation in 44914 ms returned []
Implicit Place search using SMT with State Equation took 47440 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 20:56:43] [INFO ] Invariant cache hit.
[2024-05-31 20:56:44] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 40634ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 40729ms
Finished structural reductions in LTL mode , in 1 iterations and 88496 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-00
Stuttering criterion allowed to conclude after 837 steps with 0 reset in 16 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-00 finished in 88817 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 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1001 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-31 20:57:26] [INFO ] Computed 42 invariants in 143 ms
[2024-05-31 20:57:27] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2024-05-31 20:57:27] [INFO ] Invariant cache hit.
[2024-05-31 20:57:28] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 20:57:46] [INFO ] Implicit Places using invariants and state equation in 19149 ms returned []
Implicit Place search using SMT with State Equation took 20499 ms to find 0 implicit places.
[2024-05-31 20:57:47] [INFO ] Redundant transitions in 858 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 20:57:47] [INFO ] Invariant cache hit.
[2024-05-31 20:57:47] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35129ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57567 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-01
Stuttering criterion allowed to conclude after 210 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-01 finished in 57637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 184 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 20:58:23] [INFO ] Computed 42 invariants in 400 ms
[2024-05-31 20:58:25] [INFO ] Implicit Places using invariants in 2413 ms returned []
[2024-05-31 20:58:25] [INFO ] Invariant cache hit.
[2024-05-31 20:58:27] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 20:58:57] [INFO ] Performed 376/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:59:08] [INFO ] Implicit Places using invariants and state equation in 42881 ms returned []
Implicit Place search using SMT with State Equation took 45295 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 20:59:08] [INFO ] Invariant cache hit.
[2024-05-31 20:59:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39649ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39723ms
Finished structural reductions in LTL mode , in 1 iterations and 85221 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-03
Product exploration explored 100000 steps with 102 reset in 768 ms.
Product exploration explored 100000 steps with 103 reset in 752 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND p3 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 552 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 15 states, 47 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 681 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (41 resets) in 1372 ms. (29 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
[2024-05-31 20:59:51] [INFO ] Invariant cache hit.
[2024-05-31 20:59:51] [INFO ] State equation strengthened by 3160 read => feed constraints.
Problem apf11 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3599/3603 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-31 20:59:52] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:59:52] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/3679 variables, 38/42 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/42 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/44 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3681 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 9840/13521 variables, 3681/3725 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13521 variables, 3160/6885 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 6885 constraints, problems are : Problem set: 5 solved, 8 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3599/3603 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 20/24 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 21:00:01] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
SMT process timed out in 10207ms, After SMT, problems are : Problem set: 5 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1179 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1179 ms. Remains : 1846/3683 places, 6524/9840 transitions.
RANDOM walk for 40000 steps (214 resets) in 1367 ms. (29 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 86242 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 8
Probabilistic random walk after 86242 steps, saw 24573 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-31 21:00:06] [INFO ] Computed 42 invariants in 152 ms
[2024-05-31 21:00:07] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:00:07] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1766 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1842 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:00:09] [INFO ] Deduced a trap composed of 69 places in 1497 ms of which 11 ms to minimize.
[2024-05-31 21:00:11] [INFO ] Deduced a trap composed of 57 places in 1491 ms of which 12 ms to minimize.
[2024-05-31 21:00:12] [INFO ] Deduced a trap composed of 75 places in 1514 ms of which 12 ms to minimize.
[2024-05-31 21:00:14] [INFO ] Deduced a trap composed of 47 places in 1457 ms of which 14 ms to minimize.
[2024-05-31 21:00:15] [INFO ] Deduced a trap composed of 53 places in 1384 ms of which 10 ms to minimize.
[2024-05-31 21:00:17] [INFO ] Deduced a trap composed of 46 places in 1333 ms of which 11 ms to minimize.
[2024-05-31 21:00:18] [INFO ] Deduced a trap composed of 57 places in 1337 ms of which 10 ms to minimize.
[2024-05-31 21:00:19] [INFO ] Deduced a trap composed of 49 places in 1270 ms of which 10 ms to minimize.
[2024-05-31 21:00:21] [INFO ] Deduced a trap composed of 47 places in 1258 ms of which 10 ms to minimize.
[2024-05-31 21:00:22] [INFO ] Deduced a trap composed of 47 places in 1091 ms of which 10 ms to minimize.
[2024-05-31 21:00:23] [INFO ] Deduced a trap composed of 63 places in 1198 ms of which 9 ms to minimize.
[2024-05-31 21:00:24] [INFO ] Deduced a trap composed of 57 places in 1132 ms of which 9 ms to minimize.
[2024-05-31 21:00:25] [INFO ] Deduced a trap composed of 52 places in 1119 ms of which 9 ms to minimize.
[2024-05-31 21:00:27] [INFO ] Deduced a trap composed of 52 places in 1116 ms of which 10 ms to minimize.
[2024-05-31 21:00:28] [INFO ] Deduced a trap composed of 74 places in 1121 ms of which 8 ms to minimize.
[2024-05-31 21:00:29] [INFO ] Deduced a trap composed of 47 places in 1118 ms of which 9 ms to minimize.
[2024-05-31 21:00:30] [INFO ] Deduced a trap composed of 51 places in 1188 ms of which 9 ms to minimize.
[2024-05-31 21:00:31] [INFO ] Deduced a trap composed of 46 places in 1147 ms of which 9 ms to minimize.
[2024-05-31 21:00:32] [INFO ] Deduced a trap composed of 62 places in 1017 ms of which 10 ms to minimize.
[2024-05-31 21:00:33] [INFO ] Deduced a trap composed of 68 places in 1044 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:00:34] [INFO ] Deduced a trap composed of 55 places in 988 ms of which 8 ms to minimize.
[2024-05-31 21:00:35] [INFO ] Deduced a trap composed of 57 places in 987 ms of which 9 ms to minimize.
[2024-05-31 21:00:36] [INFO ] Deduced a trap composed of 53 places in 939 ms of which 9 ms to minimize.
[2024-05-31 21:00:37] [INFO ] Deduced a trap composed of 52 places in 987 ms of which 9 ms to minimize.
[2024-05-31 21:00:38] [INFO ] Deduced a trap composed of 55 places in 976 ms of which 8 ms to minimize.
[2024-05-31 21:00:39] [INFO ] Deduced a trap composed of 52 places in 983 ms of which 8 ms to minimize.
[2024-05-31 21:00:40] [INFO ] Deduced a trap composed of 61 places in 997 ms of which 9 ms to minimize.
[2024-05-31 21:00:41] [INFO ] Deduced a trap composed of 56 places in 994 ms of which 8 ms to minimize.
[2024-05-31 21:00:43] [INFO ] Deduced a trap composed of 66 places in 972 ms of which 8 ms to minimize.
[2024-05-31 21:00:43] [INFO ] Deduced a trap composed of 46 places in 893 ms of which 8 ms to minimize.
[2024-05-31 21:00:44] [INFO ] Deduced a trap composed of 45 places in 893 ms of which 8 ms to minimize.
[2024-05-31 21:00:45] [INFO ] Deduced a trap composed of 59 places in 889 ms of which 8 ms to minimize.
[2024-05-31 21:00:46] [INFO ] Deduced a trap composed of 52 places in 857 ms of which 8 ms to minimize.
[2024-05-31 21:00:47] [INFO ] Deduced a trap composed of 47 places in 861 ms of which 8 ms to minimize.
[2024-05-31 21:00:48] [INFO ] Deduced a trap composed of 47 places in 849 ms of which 7 ms to minimize.
[2024-05-31 21:00:49] [INFO ] Deduced a trap composed of 51 places in 831 ms of which 8 ms to minimize.
[2024-05-31 21:00:50] [INFO ] Deduced a trap composed of 56 places in 810 ms of which 7 ms to minimize.
[2024-05-31 21:00:51] [INFO ] Deduced a trap composed of 58 places in 812 ms of which 7 ms to minimize.
[2024-05-31 21:00:51] [INFO ] Deduced a trap composed of 49 places in 739 ms of which 7 ms to minimize.
[2024-05-31 21:00:52] [INFO ] Deduced a trap composed of 53 places in 736 ms of which 7 ms to minimize.
SMT process timed out in 45741ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 162 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 151 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-31 21:00:52] [INFO ] Invariant cache hit.
[2024-05-31 21:00:54] [INFO ] Implicit Places using invariants in 1908 ms returned []
[2024-05-31 21:00:54] [INFO ] Invariant cache hit.
[2024-05-31 21:00:56] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-31 21:01:26] [INFO ] Performed 785/1846 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:01:56] [INFO ] Performed 1805/1846 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:01:57] [INFO ] Implicit Places using invariants and state equation in 62959 ms returned []
Implicit Place search using SMT with State Equation took 64869 ms to find 0 implicit places.
[2024-05-31 21:01:58] [INFO ] Redundant transitions in 541 ms returned []
Running 6484 sub problems to find dead transitions.
[2024-05-31 21:01:58] [INFO ] Invariant cache hit.
[2024-05-31 21:01:58] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6484 unsolved
SMT process timed out in 36551ms, After SMT, problems are : Problem set: 0 solved, 6484 unsolved
Search for dead transitions found 0 dead transitions in 36607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102195 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND p3 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p2 p3 p0 (NOT p1))), (G (OR p2 (NOT p3) p0 (NOT p1))), (G (OR p2 p0 (NOT p1))), (G (OR (NOT p2) (NOT p3) p0 (NOT p1))), (G (OR (NOT p2) p3 p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (F (NOT (OR p2 (NOT p3) p0 p1))), (F (NOT (AND (NOT p2) p3 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0) p1))), (F (NOT (OR p2 p3 p1))), (F p1), (F (NOT (AND (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR p2 p3))), (F (NOT (OR p2 p0 p1))), (F p2), (F (NOT (OR p2 (NOT p3) (NOT p1)))), (F (NOT p3))]
Knowledge based reduction with 33 factoid took 1141 ms. Reduced automaton from 15 states, 47 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 628 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 567 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 3 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Applied a total of 5149 rules in 805 ms. Remains 1848 /3683 variables (removed 1835) and now considering 6526/9840 (removed 3314) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-31 21:02:38] [INFO ] Computed 42 invariants in 186 ms
[2024-05-31 21:02:39] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2024-05-31 21:02:39] [INFO ] Invariant cache hit.
[2024-05-31 21:02:40] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-31 21:02:58] [INFO ] Implicit Places using invariants and state equation in 19296 ms returned []
Implicit Place search using SMT with State Equation took 20644 ms to find 0 implicit places.
[2024-05-31 21:02:59] [INFO ] Redundant transitions in 680 ms returned []
Running 6486 sub problems to find dead transitions.
[2024-05-31 21:02:59] [INFO ] Invariant cache hit.
[2024-05-31 21:02:59] [INFO ] State equation strengthened by 4755 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1847 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6486 unsolved
SMT process timed out in 35411ms, After SMT, problems are : Problem set: 0 solved, 6486 unsolved
Search for dead transitions found 0 dead transitions in 35461ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1848/3683 places, 6526/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57615 ms. Remains : 1848/3683 places, 6526/9840 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Detected a total of 125/1848 stabilizing places and 202/6526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 37 factoid took 436 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 578 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (192 resets) in 792 ms. (50 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
[2024-05-31 21:03:36] [INFO ] Invariant cache hit.
[2024-05-31 21:03:36] [INFO ] State equation strengthened by 4755 read => feed constraints.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1764/1768 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1768 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 76/1844 variables, 38/40 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1844 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/1846 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1846 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6526/8372 variables, 1846/1888 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8372 variables, 4755/6643 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8372 variables, 0/6643 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/8374 variables, 2/6645 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8374 variables, 0/6645 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8374/8374 variables, and 6645 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1848/1848 constraints, ReadFeed: 4755/4755 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1764/1768 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 21:03:41] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1768 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1768 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1844 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1844 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1846 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 21:03:44] [INFO ] Deduced a trap composed of 47 places in 1487 ms of which 11 ms to minimize.
[2024-05-31 21:03:45] [INFO ] Deduced a trap composed of 59 places in 1429 ms of which 10 ms to minimize.
[2024-05-31 21:03:46] [INFO ] Deduced a trap composed of 47 places in 1297 ms of which 10 ms to minimize.
SMT process timed out in 10558ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1645 place count 1846 transition count 6524
Applied a total of 1645 rules in 526 ms. Remains 1846 /1848 variables (removed 2) and now considering 6524/6526 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 1846/1848 places, 6524/6526 transitions.
RANDOM walk for 40000 steps (214 resets) in 1400 ms. (28 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 84681 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 8
Probabilistic random walk after 84681 steps, saw 24362 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-31 21:03:51] [INFO ] Computed 42 invariants in 158 ms
[2024-05-31 21:03:51] [INFO ] State equation strengthened by 6395 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 76/1842 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1842 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/1844 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1844 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6524/8368 variables, 1844/1886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8368 variables, 6395/8281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8368 variables, 0/8281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/8370 variables, 2/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8370 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/8370 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8370/8370 variables, and 8283 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7632 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1846/1846 constraints, ReadFeed: 6395/6395 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:03:59] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1766 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1842 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:04:01] [INFO ] Deduced a trap composed of 48 places in 1478 ms of which 11 ms to minimize.
[2024-05-31 21:04:03] [INFO ] Deduced a trap composed of 51 places in 1466 ms of which 11 ms to minimize.
[2024-05-31 21:04:03] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-31 21:04:03] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-05-31 21:04:05] [INFO ] Deduced a trap composed of 51 places in 1490 ms of which 11 ms to minimize.
[2024-05-31 21:04:06] [INFO ] Deduced a trap composed of 71 places in 1508 ms of which 12 ms to minimize.
[2024-05-31 21:04:08] [INFO ] Deduced a trap composed of 91 places in 1554 ms of which 12 ms to minimize.
[2024-05-31 21:04:09] [INFO ] Deduced a trap composed of 52 places in 1470 ms of which 11 ms to minimize.
[2024-05-31 21:04:11] [INFO ] Deduced a trap composed of 53 places in 1384 ms of which 10 ms to minimize.
[2024-05-31 21:04:12] [INFO ] Deduced a trap composed of 55 places in 1263 ms of which 11 ms to minimize.
[2024-05-31 21:04:13] [INFO ] Deduced a trap composed of 49 places in 1255 ms of which 11 ms to minimize.
[2024-05-31 21:04:14] [INFO ] Deduced a trap composed of 54 places in 1208 ms of which 10 ms to minimize.
[2024-05-31 21:04:16] [INFO ] Deduced a trap composed of 68 places in 1178 ms of which 9 ms to minimize.
[2024-05-31 21:04:17] [INFO ] Deduced a trap composed of 54 places in 1084 ms of which 9 ms to minimize.
[2024-05-31 21:04:18] [INFO ] Deduced a trap composed of 82 places in 1107 ms of which 9 ms to minimize.
[2024-05-31 21:04:19] [INFO ] Deduced a trap composed of 72 places in 1196 ms of which 9 ms to minimize.
[2024-05-31 21:04:20] [INFO ] Deduced a trap composed of 52 places in 1085 ms of which 9 ms to minimize.
[2024-05-31 21:04:21] [INFO ] Deduced a trap composed of 51 places in 1047 ms of which 8 ms to minimize.
[2024-05-31 21:04:22] [INFO ] Deduced a trap composed of 53 places in 998 ms of which 8 ms to minimize.
[2024-05-31 21:04:23] [INFO ] Deduced a trap composed of 49 places in 1004 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:04:24] [INFO ] Deduced a trap composed of 56 places in 1106 ms of which 9 ms to minimize.
[2024-05-31 21:04:26] [INFO ] Deduced a trap composed of 52 places in 1096 ms of which 9 ms to minimize.
[2024-05-31 21:04:27] [INFO ] Deduced a trap composed of 52 places in 1082 ms of which 9 ms to minimize.
[2024-05-31 21:04:28] [INFO ] Deduced a trap composed of 52 places in 1053 ms of which 10 ms to minimize.
[2024-05-31 21:04:29] [INFO ] Deduced a trap composed of 51 places in 1086 ms of which 9 ms to minimize.
[2024-05-31 21:04:30] [INFO ] Deduced a trap composed of 51 places in 1114 ms of which 9 ms to minimize.
[2024-05-31 21:04:31] [INFO ] Deduced a trap composed of 53 places in 1102 ms of which 9 ms to minimize.
[2024-05-31 21:04:32] [INFO ] Deduced a trap composed of 53 places in 1112 ms of which 10 ms to minimize.
[2024-05-31 21:04:33] [INFO ] Deduced a trap composed of 51 places in 1096 ms of which 9 ms to minimize.
[2024-05-31 21:04:35] [INFO ] Deduced a trap composed of 53 places in 1098 ms of which 10 ms to minimize.
[2024-05-31 21:04:36] [INFO ] Deduced a trap composed of 83 places in 1068 ms of which 9 ms to minimize.
[2024-05-31 21:04:37] [INFO ] Deduced a trap composed of 52 places in 1080 ms of which 9 ms to minimize.
[2024-05-31 21:04:38] [INFO ] Deduced a trap composed of 54 places in 1041 ms of which 10 ms to minimize.
[2024-05-31 21:04:39] [INFO ] Deduced a trap composed of 67 places in 1006 ms of which 9 ms to minimize.
[2024-05-31 21:04:40] [INFO ] Deduced a trap composed of 71 places in 1013 ms of which 9 ms to minimize.
[2024-05-31 21:04:41] [INFO ] Deduced a trap composed of 50 places in 946 ms of which 9 ms to minimize.
[2024-05-31 21:04:42] [INFO ] Deduced a trap composed of 55 places in 923 ms of which 8 ms to minimize.
[2024-05-31 21:04:43] [INFO ] Deduced a trap composed of 50 places in 923 ms of which 8 ms to minimize.
[2024-05-31 21:04:44] [INFO ] Deduced a trap composed of 56 places in 903 ms of which 8 ms to minimize.
SMT process timed out in 53036ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 180 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 155 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-31 21:04:44] [INFO ] Invariant cache hit.
[2024-05-31 21:04:46] [INFO ] Implicit Places using invariants in 1856 ms returned []
[2024-05-31 21:04:46] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-31 21:05:18] [INFO ] Performed 788/1846 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:05:48] [INFO ] Performed 1762/1846 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:05:50] [INFO ] Implicit Places using invariants and state equation in 64332 ms returned []
Implicit Place search using SMT with State Equation took 66189 ms to find 0 implicit places.
[2024-05-31 21:05:51] [INFO ] Redundant transitions in 532 ms returned []
Running 6484 sub problems to find dead transitions.
[2024-05-31 21:05:51] [INFO ] Invariant cache hit.
[2024-05-31 21:05:51] [INFO ] State equation strengthened by 6395 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6484 unsolved
SMT process timed out in 37206ms, After SMT, problems are : Problem set: 0 solved, 6484 unsolved
Search for dead transitions found 0 dead transitions in 37271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104182 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (NOT p2) p3))), (F p1), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p3))))]
Knowledge based reduction with 39 factoid took 948 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 566 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 559 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 588 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 490 reset in 1089 ms.
Product exploration explored 100000 steps with 490 reset in 1008 ms.
Support contains 4 out of 1848 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Applied a total of 0 rules in 144 ms. Remains 1848 /1848 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-31 21:06:33] [INFO ] Computed 42 invariants in 126 ms
[2024-05-31 21:06:34] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2024-05-31 21:06:34] [INFO ] Invariant cache hit.
[2024-05-31 21:06:36] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-31 21:06:54] [INFO ] Implicit Places using invariants and state equation in 19249 ms returned []
Implicit Place search using SMT with State Equation took 20550 ms to find 0 implicit places.
[2024-05-31 21:06:54] [INFO ] Redundant transitions in 484 ms returned []
Running 6486 sub problems to find dead transitions.
[2024-05-31 21:06:54] [INFO ] Invariant cache hit.
[2024-05-31 21:06:54] [INFO ] State equation strengthened by 4755 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1847 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6486 unsolved
SMT process timed out in 35325ms, After SMT, problems are : Problem set: 0 solved, 6486 unsolved
Search for dead transitions found 0 dead transitions in 35376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56578 ms. Remains : 1848/1848 places, 6526/6526 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-03 finished in 547908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1 U !p2))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 196 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:07:31] [INFO ] Computed 42 invariants in 358 ms
[2024-05-31 21:07:33] [INFO ] Implicit Places using invariants in 2337 ms returned []
[2024-05-31 21:07:33] [INFO ] Invariant cache hit.
[2024-05-31 21:07:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:08:06] [INFO ] Performed 357/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:08:16] [INFO ] Implicit Places using invariants and state equation in 43599 ms returned []
Implicit Place search using SMT with State Equation took 45937 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:08:16] [INFO ] Invariant cache hit.
[2024-05-31 21:08:16] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38927ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38997ms
Finished structural reductions in LTL mode , in 1 iterations and 85142 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 1407 ms.
Product exploration explored 100000 steps with 50000 reset in 1385 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 19 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-05 finished in 88196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p1 U p2)||p0)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 179 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-31 21:08:58] [INFO ] Invariant cache hit.
[2024-05-31 21:09:00] [INFO ] Implicit Places using invariants in 2002 ms returned []
[2024-05-31 21:09:00] [INFO ] Invariant cache hit.
[2024-05-31 21:09:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:09:34] [INFO ] Performed 385/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:09:43] [INFO ] Implicit Places using invariants and state equation in 43106 ms returned []
Implicit Place search using SMT with State Equation took 45109 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:09:44] [INFO ] Invariant cache hit.
[2024-05-31 21:09:44] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38993ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39065ms
Finished structural reductions in LTL mode , in 1 iterations and 84365 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06
Product exploration explored 100000 steps with 33351 reset in 1157 ms.
Product exploration explored 100000 steps with 33378 reset in 1169 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 158 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (39 resets) in 522 ms. (76 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
[2024-05-31 21:10:26] [INFO ] Invariant cache hit.
[2024-05-31 21:10:26] [INFO ] State equation strengthened by 3160 read => feed constraints.
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3598/3603 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-05-31 21:10:27] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-31 21:10:27] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-31 21:10:27] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-31 21:10:27] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2024-05-31 21:10:27] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-31 21:10:27] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-31 21:10:28] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-31 21:10:28] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-31 21:10:28] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-31 21:10:28] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-31 21:10:28] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-31 21:10:28] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-31 21:10:28] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-31 21:10:29] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 21:10:29] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-31 21:10:29] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-31 21:10:29] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 21:10:29] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-31 21:10:29] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-31 21:10:29] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 20/22 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 76/3679 variables, 38/60 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/60 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/62 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-05-31 21:10:34] [INFO ] Deduced a trap composed of 72 places in 3374 ms of which 23 ms to minimize.
SMT process timed out in 8022ms, After SMT, problems are : Problem set: 6 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5159 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 3 with 1638 rules applied. Total rules applied 6799 place count 1843 transition count 6519
Applied a total of 6799 rules in 1185 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1185 ms. Remains : 1843/3683 places, 6519/9840 transitions.
RANDOM walk for 40000 steps (213 resets) in 1694 ms. (23 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:10:36] [INFO ] Computed 42 invariants in 143 ms
[2024-05-31 21:10:36] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:10:36] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:10:36] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:10:39] [INFO ] Deduced a trap composed of 67 places in 1473 ms of which 12 ms to minimize.
[2024-05-31 21:10:39] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-31 21:10:39] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:10:39] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8285 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8036 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:10:46] [INFO ] Deduced a trap composed of 71 places in 1275 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6519/8360 variables, 1841/1890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 6394/8284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8360 variables, 4/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8360 variables, 0/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8362 variables, 2/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8362/8362 variables, and 8290 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9917 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 18167ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 154 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 1843/1843 places, 6519/6519 transitions.
RANDOM walk for 40000 steps (216 resets) in 1328 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 79015 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 79015 steps, saw 24285 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-31 21:10:58] [INFO ] Invariant cache hit.
[2024-05-31 21:10:58] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:10:58] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:10:59] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:11:01] [INFO ] Deduced a trap composed of 67 places in 1476 ms of which 11 ms to minimize.
[2024-05-31 21:11:02] [INFO ] Deduced a trap composed of 48 places in 1363 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8283 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8667 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 4/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8360 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/8362 variables, 2/8287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8362 variables, 0/8287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/8362 variables, 0/8287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8362/8362 variables, and 8287 constraints, problems are : Problem set: 0 solved, 4 unsolved in 11775 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 20513ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 506 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 156 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 1843/1843 places, 6519/6519 transitions.
RANDOM walk for 40000 steps (215 resets) in 1466 ms. (27 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/3 properties
[2024-05-31 21:11:20] [INFO ] Invariant cache hit.
[2024-05-31 21:11:20] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:11:20] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:11:20] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:11:22] [INFO ] Deduced a trap composed of 48 places in 1367 ms of which 11 ms to minimize.
[2024-05-31 21:11:23] [INFO ] Deduced a trap composed of 50 places in 1390 ms of which 11 ms to minimize.
[2024-05-31 21:11:25] [INFO ] Deduced a trap composed of 49 places in 1379 ms of which 11 ms to minimize.
[2024-05-31 21:11:26] [INFO ] Deduced a trap composed of 47 places in 1357 ms of which 10 ms to minimize.
[2024-05-31 21:11:27] [INFO ] Deduced a trap composed of 48 places in 1294 ms of which 10 ms to minimize.
[2024-05-31 21:11:29] [INFO ] Deduced a trap composed of 47 places in 1329 ms of which 10 ms to minimize.
[2024-05-31 21:11:30] [INFO ] Deduced a trap composed of 66 places in 1329 ms of which 10 ms to minimize.
[2024-05-31 21:11:31] [INFO ] Deduced a trap composed of 46 places in 1219 ms of which 10 ms to minimize.
[2024-05-31 21:11:32] [INFO ] Deduced a trap composed of 52 places in 1206 ms of which 9 ms to minimize.
[2024-05-31 21:11:34] [INFO ] Deduced a trap composed of 63 places in 1236 ms of which 10 ms to minimize.
[2024-05-31 21:11:35] [INFO ] Deduced a trap composed of 65 places in 1136 ms of which 9 ms to minimize.
[2024-05-31 21:11:36] [INFO ] Deduced a trap composed of 63 places in 1103 ms of which 9 ms to minimize.
[2024-05-31 21:11:37] [INFO ] Deduced a trap composed of 53 places in 1103 ms of which 8 ms to minimize.
[2024-05-31 21:11:38] [INFO ] Deduced a trap composed of 48 places in 1101 ms of which 9 ms to minimize.
[2024-05-31 21:11:39] [INFO ] Deduced a trap composed of 54 places in 1047 ms of which 9 ms to minimize.
[2024-05-31 21:11:40] [INFO ] Deduced a trap composed of 50 places in 994 ms of which 9 ms to minimize.
[2024-05-31 21:11:41] [INFO ] Deduced a trap composed of 48 places in 981 ms of which 9 ms to minimize.
[2024-05-31 21:11:42] [INFO ] Deduced a trap composed of 47 places in 988 ms of which 8 ms to minimize.
[2024-05-31 21:11:43] [INFO ] Deduced a trap composed of 48 places in 981 ms of which 9 ms to minimize.
[2024-05-31 21:11:44] [INFO ] Deduced a trap composed of 57 places in 1011 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:11:46] [INFO ] Deduced a trap composed of 47 places in 1009 ms of which 8 ms to minimize.
[2024-05-31 21:11:47] [INFO ] Deduced a trap composed of 53 places in 985 ms of which 8 ms to minimize.
[2024-05-31 21:11:48] [INFO ] Deduced a trap composed of 55 places in 989 ms of which 9 ms to minimize.
[2024-05-31 21:11:49] [INFO ] Deduced a trap composed of 77 places in 961 ms of which 8 ms to minimize.
[2024-05-31 21:11:50] [INFO ] Deduced a trap composed of 59 places in 947 ms of which 8 ms to minimize.
[2024-05-31 21:11:51] [INFO ] Deduced a trap composed of 57 places in 991 ms of which 8 ms to minimize.
[2024-05-31 21:11:52] [INFO ] Deduced a trap composed of 68 places in 1000 ms of which 9 ms to minimize.
[2024-05-31 21:11:53] [INFO ] Deduced a trap composed of 76 places in 1040 ms of which 9 ms to minimize.
[2024-05-31 21:11:54] [INFO ] Deduced a trap composed of 54 places in 962 ms of which 8 ms to minimize.
[2024-05-31 21:11:55] [INFO ] Deduced a trap composed of 52 places in 962 ms of which 8 ms to minimize.
[2024-05-31 21:11:56] [INFO ] Deduced a trap composed of 57 places in 963 ms of which 9 ms to minimize.
[2024-05-31 21:11:57] [INFO ] Deduced a trap composed of 64 places in 982 ms of which 9 ms to minimize.
[2024-05-31 21:11:58] [INFO ] Deduced a trap composed of 49 places in 984 ms of which 8 ms to minimize.
[2024-05-31 21:11:59] [INFO ] Deduced a trap composed of 50 places in 971 ms of which 9 ms to minimize.
[2024-05-31 21:12:00] [INFO ] Deduced a trap composed of 50 places in 1011 ms of which 9 ms to minimize.
[2024-05-31 21:12:01] [INFO ] Deduced a trap composed of 50 places in 1015 ms of which 8 ms to minimize.
[2024-05-31 21:12:02] [INFO ] Deduced a trap composed of 48 places in 963 ms of which 8 ms to minimize.
[2024-05-31 21:12:03] [INFO ] Deduced a trap composed of 53 places in 925 ms of which 8 ms to minimize.
[2024-05-31 21:12:04] [INFO ] Deduced a trap composed of 64 places in 924 ms of which 8 ms to minimize.
[2024-05-31 21:12:05] [INFO ] Deduced a trap composed of 60 places in 927 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:06] [INFO ] Deduced a trap composed of 49 places in 888 ms of which 8 ms to minimize.
[2024-05-31 21:12:07] [INFO ] Deduced a trap composed of 58 places in 920 ms of which 8 ms to minimize.
[2024-05-31 21:12:07] [INFO ] Deduced a trap composed of 67 places in 930 ms of which 8 ms to minimize.
[2024-05-31 21:12:08] [INFO ] Deduced a trap composed of 72 places in 934 ms of which 8 ms to minimize.
[2024-05-31 21:12:09] [INFO ] Deduced a trap composed of 58 places in 911 ms of which 8 ms to minimize.
[2024-05-31 21:12:10] [INFO ] Deduced a trap composed of 69 places in 931 ms of which 9 ms to minimize.
[2024-05-31 21:12:11] [INFO ] Deduced a trap composed of 68 places in 927 ms of which 8 ms to minimize.
[2024-05-31 21:12:12] [INFO ] Deduced a trap composed of 65 places in 938 ms of which 8 ms to minimize.
[2024-05-31 21:12:13] [INFO ] Deduced a trap composed of 63 places in 930 ms of which 8 ms to minimize.
[2024-05-31 21:12:14] [INFO ] Deduced a trap composed of 51 places in 906 ms of which 7 ms to minimize.
[2024-05-31 21:12:15] [INFO ] Deduced a trap composed of 49 places in 894 ms of which 8 ms to minimize.
[2024-05-31 21:12:16] [INFO ] Deduced a trap composed of 52 places in 862 ms of which 7 ms to minimize.
[2024-05-31 21:12:17] [INFO ] Deduced a trap composed of 62 places in 877 ms of which 8 ms to minimize.
[2024-05-31 21:12:18] [INFO ] Deduced a trap composed of 54 places in 854 ms of which 8 ms to minimize.
[2024-05-31 21:12:19] [INFO ] Deduced a trap composed of 52 places in 804 ms of which 7 ms to minimize.
[2024-05-31 21:12:19] [INFO ] Deduced a trap composed of 48 places in 815 ms of which 8 ms to minimize.
[2024-05-31 21:12:20] [INFO ] Deduced a trap composed of 58 places in 811 ms of which 8 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1841 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6519/8360 variables, 1841/1942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8360 variables, 6394/8336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8360 variables, 0/8336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/8362 variables, 2/8338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8362 variables, 0/8338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/8362 variables, 0/8338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63936 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 57/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:25] [INFO ] Deduced a trap composed of 56 places in 883 ms of which 8 ms to minimize.
[2024-05-31 21:12:26] [INFO ] Deduced a trap composed of 52 places in 877 ms of which 10 ms to minimize.
[2024-05-31 21:12:27] [INFO ] Deduced a trap composed of 65 places in 838 ms of which 7 ms to minimize.
[2024-05-31 21:12:28] [INFO ] Deduced a trap composed of 54 places in 844 ms of which 8 ms to minimize.
[2024-05-31 21:12:29] [INFO ] Deduced a trap composed of 55 places in 842 ms of which 8 ms to minimize.
[2024-05-31 21:12:29] [INFO ] Deduced a trap composed of 53 places in 861 ms of which 8 ms to minimize.
[2024-05-31 21:12:30] [INFO ] Deduced a trap composed of 57 places in 892 ms of which 8 ms to minimize.
[2024-05-31 21:12:31] [INFO ] Deduced a trap composed of 57 places in 834 ms of which 8 ms to minimize.
[2024-05-31 21:12:32] [INFO ] Deduced a trap composed of 60 places in 858 ms of which 8 ms to minimize.
[2024-05-31 21:12:33] [INFO ] Deduced a trap composed of 75 places in 791 ms of which 8 ms to minimize.
[2024-05-31 21:12:34] [INFO ] Deduced a trap composed of 48 places in 771 ms of which 8 ms to minimize.
[2024-05-31 21:12:34] [INFO ] Deduced a trap composed of 57 places in 752 ms of which 7 ms to minimize.
[2024-05-31 21:12:35] [INFO ] Deduced a trap composed of 61 places in 758 ms of which 7 ms to minimize.
[2024-05-31 21:12:36] [INFO ] Deduced a trap composed of 57 places in 750 ms of which 7 ms to minimize.
[2024-05-31 21:12:37] [INFO ] Deduced a trap composed of 54 places in 765 ms of which 7 ms to minimize.
[2024-05-31 21:12:38] [INFO ] Deduced a trap composed of 52 places in 748 ms of which 7 ms to minimize.
[2024-05-31 21:12:38] [INFO ] Deduced a trap composed of 55 places in 740 ms of which 6 ms to minimize.
[2024-05-31 21:12:39] [INFO ] Deduced a trap composed of 58 places in 767 ms of which 7 ms to minimize.
[2024-05-31 21:12:40] [INFO ] Deduced a trap composed of 57 places in 756 ms of which 7 ms to minimize.
[2024-05-31 21:12:41] [INFO ] Deduced a trap composed of 58 places in 758 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:42] [INFO ] Deduced a trap composed of 52 places in 810 ms of which 7 ms to minimize.
[2024-05-31 21:12:42] [INFO ] Deduced a trap composed of 48 places in 775 ms of which 7 ms to minimize.
[2024-05-31 21:12:43] [INFO ] Deduced a trap composed of 48 places in 771 ms of which 7 ms to minimize.
[2024-05-31 21:12:44] [INFO ] Deduced a trap composed of 54 places in 747 ms of which 7 ms to minimize.
[2024-05-31 21:12:45] [INFO ] Deduced a trap composed of 51 places in 694 ms of which 6 ms to minimize.
[2024-05-31 21:12:45] [INFO ] Deduced a trap composed of 47 places in 711 ms of which 7 ms to minimize.
[2024-05-31 21:12:46] [INFO ] Deduced a trap composed of 58 places in 680 ms of which 6 ms to minimize.
[2024-05-31 21:12:47] [INFO ] Deduced a trap composed of 54 places in 663 ms of which 7 ms to minimize.
[2024-05-31 21:12:48] [INFO ] Deduced a trap composed of 50 places in 684 ms of which 7 ms to minimize.
[2024-05-31 21:12:48] [INFO ] Deduced a trap composed of 56 places in 689 ms of which 6 ms to minimize.
[2024-05-31 21:12:49] [INFO ] Deduced a trap composed of 62 places in 634 ms of which 6 ms to minimize.
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 49 places in 641 ms of which 6 ms to minimize.
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 62 places in 640 ms of which 6 ms to minimize.
[2024-05-31 21:12:51] [INFO ] Deduced a trap composed of 62 places in 606 ms of which 8 ms to minimize.
[2024-05-31 21:12:52] [INFO ] Deduced a trap composed of 56 places in 642 ms of which 7 ms to minimize.
[2024-05-31 21:12:52] [INFO ] Deduced a trap composed of 47 places in 527 ms of which 6 ms to minimize.
[2024-05-31 21:12:53] [INFO ] Deduced a trap composed of 52 places in 654 ms of which 7 ms to minimize.
[2024-05-31 21:12:54] [INFO ] Deduced a trap composed of 49 places in 623 ms of which 6 ms to minimize.
[2024-05-31 21:12:54] [INFO ] Deduced a trap composed of 48 places in 502 ms of which 5 ms to minimize.
[2024-05-31 21:12:55] [INFO ] Deduced a trap composed of 57 places in 481 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:12:55] [INFO ] Deduced a trap composed of 46 places in 424 ms of which 5 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 48 places in 439 ms of which 5 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 51 places in 442 ms of which 4 ms to minimize.
[2024-05-31 21:12:56] [INFO ] Deduced a trap composed of 50 places in 413 ms of which 4 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 60 places in 406 ms of which 4 ms to minimize.
[2024-05-31 21:12:57] [INFO ] Deduced a trap composed of 61 places in 363 ms of which 5 ms to minimize.
[2024-05-31 21:12:58] [INFO ] Deduced a trap composed of 56 places in 317 ms of which 4 ms to minimize.
[2024-05-31 21:12:58] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 4 ms to minimize.
[2024-05-31 21:12:58] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 4 ms to minimize.
[2024-05-31 21:12:59] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 3 ms to minimize.
[2024-05-31 21:12:59] [INFO ] Deduced a trap composed of 68 places in 354 ms of which 4 ms to minimize.
[2024-05-31 21:12:59] [INFO ] Deduced a trap composed of 56 places in 348 ms of which 4 ms to minimize.
[2024-05-31 21:13:00] [INFO ] Deduced a trap composed of 62 places in 406 ms of which 4 ms to minimize.
[2024-05-31 21:13:00] [INFO ] Deduced a trap composed of 55 places in 340 ms of which 5 ms to minimize.
[2024-05-31 21:13:01] [INFO ] Deduced a trap composed of 49 places in 433 ms of which 5 ms to minimize.
[2024-05-31 21:13:01] [INFO ] Deduced a trap composed of 55 places in 410 ms of which 5 ms to minimize.
[2024-05-31 21:13:01] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 5 ms to minimize.
[2024-05-31 21:13:02] [INFO ] Deduced a trap composed of 57 places in 416 ms of which 5 ms to minimize.
[2024-05-31 21:13:02] [INFO ] Deduced a trap composed of 50 places in 363 ms of which 5 ms to minimize.
[2024-05-31 21:13:03] [INFO ] Deduced a trap composed of 57 places in 356 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1841 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:13:03] [INFO ] Deduced a trap composed of 53 places in 387 ms of which 4 ms to minimize.
[2024-05-31 21:13:04] [INFO ] Deduced a trap composed of 53 places in 395 ms of which 4 ms to minimize.
[2024-05-31 21:13:04] [INFO ] Deduced a trap composed of 64 places in 334 ms of which 4 ms to minimize.
[2024-05-31 21:13:05] [INFO ] Deduced a trap composed of 54 places in 430 ms of which 5 ms to minimize.
[2024-05-31 21:13:05] [INFO ] Deduced a trap composed of 52 places in 415 ms of which 4 ms to minimize.
[2024-05-31 21:13:05] [INFO ] Deduced a trap composed of 57 places in 409 ms of which 5 ms to minimize.
[2024-05-31 21:13:06] [INFO ] Deduced a trap composed of 55 places in 348 ms of which 4 ms to minimize.
[2024-05-31 21:13:06] [INFO ] Deduced a trap composed of 51 places in 406 ms of which 4 ms to minimize.
[2024-05-31 21:13:07] [INFO ] Deduced a trap composed of 67 places in 368 ms of which 4 ms to minimize.
[2024-05-31 21:13:07] [INFO ] Deduced a trap composed of 73 places in 379 ms of which 5 ms to minimize.
[2024-05-31 21:13:07] [INFO ] Deduced a trap composed of 53 places in 376 ms of which 4 ms to minimize.
[2024-05-31 21:13:08] [INFO ] Deduced a trap composed of 56 places in 414 ms of which 4 ms to minimize.
[2024-05-31 21:13:08] [INFO ] Deduced a trap composed of 52 places in 365 ms of which 4 ms to minimize.
[2024-05-31 21:13:09] [INFO ] Deduced a trap composed of 55 places in 354 ms of which 4 ms to minimize.
[2024-05-31 21:13:09] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 4 ms to minimize.
[2024-05-31 21:13:09] [INFO ] Deduced a trap composed of 53 places in 437 ms of which 5 ms to minimize.
[2024-05-31 21:13:10] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 4 ms to minimize.
[2024-05-31 21:13:11] [INFO ] Deduced a trap composed of 52 places in 563 ms of which 6 ms to minimize.
[2024-05-31 21:13:11] [INFO ] Deduced a trap composed of 57 places in 561 ms of which 6 ms to minimize.
[2024-05-31 21:13:12] [INFO ] Deduced a trap composed of 55 places in 516 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1841 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:13:12] [INFO ] Deduced a trap composed of 61 places in 393 ms of which 4 ms to minimize.
[2024-05-31 21:13:13] [INFO ] Deduced a trap composed of 54 places in 348 ms of which 4 ms to minimize.
[2024-05-31 21:13:13] [INFO ] Deduced a trap composed of 58 places in 328 ms of which 6 ms to minimize.
[2024-05-31 21:13:13] [INFO ] Deduced a trap composed of 48 places in 311 ms of which 4 ms to minimize.
[2024-05-31 21:13:14] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 3 ms to minimize.
[2024-05-31 21:13:14] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 4 ms to minimize.
[2024-05-31 21:13:14] [INFO ] Deduced a trap composed of 50 places in 310 ms of which 4 ms to minimize.
[2024-05-31 21:13:15] [INFO ] Deduced a trap composed of 55 places in 338 ms of which 4 ms to minimize.
[2024-05-31 21:13:15] [INFO ] Deduced a trap composed of 58 places in 422 ms of which 5 ms to minimize.
[2024-05-31 21:13:15] [INFO ] Deduced a trap composed of 55 places in 396 ms of which 4 ms to minimize.
[2024-05-31 21:13:16] [INFO ] Deduced a trap composed of 48 places in 480 ms of which 5 ms to minimize.
[2024-05-31 21:13:17] [INFO ] Deduced a trap composed of 54 places in 467 ms of which 5 ms to minimize.
[2024-05-31 21:13:17] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 6 ms to minimize.
[2024-05-31 21:13:17] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 3 ms to minimize.
[2024-05-31 21:13:17] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-05-31 21:13:18] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 3 ms to minimize.
[2024-05-31 21:13:18] [INFO ] Deduced a trap composed of 61 places in 354 ms of which 5 ms to minimize.
[2024-05-31 21:13:18] [INFO ] Deduced a trap composed of 63 places in 309 ms of which 4 ms to minimize.
[2024-05-31 21:13:19] [INFO ] Deduced a trap composed of 60 places in 362 ms of which 4 ms to minimize.
[2024-05-31 21:13:19] [INFO ] Deduced a trap composed of 59 places in 331 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1841 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:13:19] [INFO ] Deduced a trap composed of 56 places in 285 ms of which 4 ms to minimize.
[2024-05-31 21:13:20] [INFO ] Deduced a trap composed of 60 places in 318 ms of which 4 ms to minimize.
[2024-05-31 21:13:20] [INFO ] Deduced a trap composed of 60 places in 321 ms of which 4 ms to minimize.
[2024-05-31 21:13:20] [INFO ] Deduced a trap composed of 63 places in 286 ms of which 3 ms to minimize.
[2024-05-31 21:13:21] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 3 ms to minimize.
[2024-05-31 21:13:21] [INFO ] Deduced a trap composed of 59 places in 422 ms of which 5 ms to minimize.
[2024-05-31 21:13:22] [INFO ] Deduced a trap composed of 58 places in 441 ms of which 5 ms to minimize.
[2024-05-31 21:13:22] [INFO ] Deduced a trap composed of 48 places in 391 ms of which 4 ms to minimize.
[2024-05-31 21:13:23] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 4 ms to minimize.
[2024-05-31 21:13:23] [INFO ] Deduced a trap composed of 75 places in 296 ms of which 4 ms to minimize.
[2024-05-31 21:13:24] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 3 ms to minimize.
[2024-05-31 21:13:24] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 3 ms to minimize.
[2024-05-31 21:13:24] [INFO ] Deduced a trap composed of 54 places in 283 ms of which 4 ms to minimize.
[2024-05-31 21:13:25] [INFO ] Deduced a trap composed of 51 places in 287 ms of which 4 ms to minimize.
[2024-05-31 21:13:25] [INFO ] Deduced a trap composed of 49 places in 289 ms of which 3 ms to minimize.
[2024-05-31 21:13:26] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 3 ms to minimize.
[2024-05-31 21:13:26] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 5 ms to minimize.
[2024-05-31 21:13:27] [INFO ] Deduced a trap composed of 49 places in 384 ms of which 4 ms to minimize.
[2024-05-31 21:13:27] [INFO ] Deduced a trap composed of 57 places in 321 ms of which 4 ms to minimize.
[2024-05-31 21:13:27] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1841 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:13:28] [INFO ] Deduced a trap composed of 56 places in 385 ms of which 4 ms to minimize.
[2024-05-31 21:13:28] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 4 ms to minimize.
[2024-05-31 21:13:29] [INFO ] Deduced a trap composed of 56 places in 327 ms of which 3 ms to minimize.
[2024-05-31 21:13:29] [INFO ] Deduced a trap composed of 54 places in 320 ms of which 4 ms to minimize.
[2024-05-31 21:13:30] [INFO ] Deduced a trap composed of 54 places in 305 ms of which 4 ms to minimize.
[2024-05-31 21:13:30] [INFO ] Deduced a trap composed of 59 places in 333 ms of which 4 ms to minimize.
[2024-05-31 21:13:30] [INFO ] Deduced a trap composed of 56 places in 354 ms of which 5 ms to minimize.
[2024-05-31 21:13:31] [INFO ] Deduced a trap composed of 59 places in 333 ms of which 4 ms to minimize.
[2024-05-31 21:13:31] [INFO ] Deduced a trap composed of 60 places in 347 ms of which 4 ms to minimize.
[2024-05-31 21:13:32] [INFO ] Deduced a trap composed of 51 places in 360 ms of which 5 ms to minimize.
[2024-05-31 21:13:33] [INFO ] Deduced a trap composed of 53 places in 305 ms of which 3 ms to minimize.
[2024-05-31 21:13:33] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 4 ms to minimize.
[2024-05-31 21:13:34] [INFO ] Deduced a trap composed of 51 places in 247 ms of which 3 ms to minimize.
[2024-05-31 21:13:34] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1841 variables, 14/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1841 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6519/8360 variables, 1841/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/8360 variables, 6394/8470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/8360 variables, 1/8471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/8360 variables, 0/8471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/8362 variables, 2/8473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/8362 variables, 0/8473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/8362 variables, 0/8473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8362/8362 variables, and 8473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79734 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 193/193 constraints]
After SMT, in 143731ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 154 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 p2 (NOT p3) p4)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 (NOT p3) p4)), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) p2 (NOT p3) p4)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3 p4))), (F (NOT p4)), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p3 p4))), (F (NOT (AND (OR (NOT p1) p3 p4) (OR (NOT p2) p3 p4)))), (F p2), (F p1), (F p3), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 453 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 761 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:13:45] [INFO ] Computed 42 invariants in 133 ms
[2024-05-31 21:13:46] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2024-05-31 21:13:46] [INFO ] Invariant cache hit.
[2024-05-31 21:13:48] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:14:02] [INFO ] Implicit Places using invariants and state equation in 15404 ms returned []
Implicit Place search using SMT with State Equation took 16692 ms to find 0 implicit places.
[2024-05-31 21:14:02] [INFO ] Redundant transitions in 488 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:14:02] [INFO ] Invariant cache hit.
[2024-05-31 21:14:02] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34815ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34864ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52828 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 149 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (194 resets) in 1636 ms. (24 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
[2024-05-31 21:14:38] [INFO ] Invariant cache hit.
[2024-05-31 21:14:38] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:14:38] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:14:40] [INFO ] Deduced a trap composed of 68 places in 1375 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1887 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 0/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/8366 variables, 2/6646 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6646 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:14:45] [INFO ] Deduced a trap composed of 49 places in 1320 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6521/8364 variables, 1843/1888 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 4757/6645 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8364 variables, 4/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8364 variables, 0/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8366/8366 variables, and 6651 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10086ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 488 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 1289 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 79994 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 79994 steps, saw 24428 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:14:52] [INFO ] Computed 42 invariants in 147 ms
[2024-05-31 21:14:52] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:14:53] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:14:53] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:14:55] [INFO ] Deduced a trap composed of 62 places in 1442 ms of which 11 ms to minimize.
[2024-05-31 21:14:56] [INFO ] Deduced a trap composed of 46 places in 1348 ms of which 10 ms to minimize.
[2024-05-31 21:14:58] [INFO ] Deduced a trap composed of 60 places in 1324 ms of which 11 ms to minimize.
[2024-05-31 21:14:59] [INFO ] Deduced a trap composed of 51 places in 1387 ms of which 10 ms to minimize.
[2024-05-31 21:15:00] [INFO ] Deduced a trap composed of 51 places in 1288 ms of which 11 ms to minimize.
[2024-05-31 21:15:02] [INFO ] Deduced a trap composed of 55 places in 1315 ms of which 11 ms to minimize.
[2024-05-31 21:15:03] [INFO ] Deduced a trap composed of 53 places in 1327 ms of which 10 ms to minimize.
[2024-05-31 21:15:04] [INFO ] Deduced a trap composed of 51 places in 1227 ms of which 10 ms to minimize.
[2024-05-31 21:15:06] [INFO ] Deduced a trap composed of 54 places in 1202 ms of which 10 ms to minimize.
[2024-05-31 21:15:07] [INFO ] Deduced a trap composed of 65 places in 1205 ms of which 9 ms to minimize.
[2024-05-31 21:15:08] [INFO ] Deduced a trap composed of 52 places in 1214 ms of which 10 ms to minimize.
[2024-05-31 21:15:09] [INFO ] Deduced a trap composed of 53 places in 1141 ms of which 9 ms to minimize.
[2024-05-31 21:15:10] [INFO ] Deduced a trap composed of 51 places in 1104 ms of which 9 ms to minimize.
[2024-05-31 21:15:12] [INFO ] Deduced a trap composed of 53 places in 1104 ms of which 10 ms to minimize.
[2024-05-31 21:15:13] [INFO ] Deduced a trap composed of 48 places in 1134 ms of which 10 ms to minimize.
[2024-05-31 21:15:14] [INFO ] Deduced a trap composed of 51 places in 1140 ms of which 9 ms to minimize.
[2024-05-31 21:15:15] [INFO ] Deduced a trap composed of 47 places in 1104 ms of which 9 ms to minimize.
[2024-05-31 21:15:16] [INFO ] Deduced a trap composed of 46 places in 1043 ms of which 10 ms to minimize.
[2024-05-31 21:15:17] [INFO ] Deduced a trap composed of 56 places in 1013 ms of which 8 ms to minimize.
[2024-05-31 21:15:18] [INFO ] Deduced a trap composed of 61 places in 982 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:15:19] [INFO ] Deduced a trap composed of 55 places in 972 ms of which 9 ms to minimize.
[2024-05-31 21:15:20] [INFO ] Deduced a trap composed of 64 places in 988 ms of which 9 ms to minimize.
[2024-05-31 21:15:21] [INFO ] Deduced a trap composed of 57 places in 985 ms of which 8 ms to minimize.
[2024-05-31 21:15:22] [INFO ] Deduced a trap composed of 54 places in 920 ms of which 8 ms to minimize.
[2024-05-31 21:15:23] [INFO ] Deduced a trap composed of 55 places in 1001 ms of which 9 ms to minimize.
[2024-05-31 21:15:24] [INFO ] Deduced a trap composed of 56 places in 981 ms of which 9 ms to minimize.
[2024-05-31 21:15:25] [INFO ] Deduced a trap composed of 55 places in 989 ms of which 8 ms to minimize.
[2024-05-31 21:15:26] [INFO ] Deduced a trap composed of 56 places in 955 ms of which 8 ms to minimize.
[2024-05-31 21:15:27] [INFO ] Deduced a trap composed of 53 places in 943 ms of which 9 ms to minimize.
[2024-05-31 21:15:28] [INFO ] Deduced a trap composed of 56 places in 969 ms of which 8 ms to minimize.
[2024-05-31 21:15:29] [INFO ] Deduced a trap composed of 61 places in 966 ms of which 8 ms to minimize.
[2024-05-31 21:15:30] [INFO ] Deduced a trap composed of 47 places in 961 ms of which 9 ms to minimize.
[2024-05-31 21:15:31] [INFO ] Deduced a trap composed of 57 places in 942 ms of which 8 ms to minimize.
[2024-05-31 21:15:32] [INFO ] Deduced a trap composed of 63 places in 948 ms of which 8 ms to minimize.
[2024-05-31 21:15:33] [INFO ] Deduced a trap composed of 77 places in 898 ms of which 9 ms to minimize.
[2024-05-31 21:15:34] [INFO ] Deduced a trap composed of 54 places in 888 ms of which 8 ms to minimize.
[2024-05-31 21:15:35] [INFO ] Deduced a trap composed of 69 places in 899 ms of which 8 ms to minimize.
[2024-05-31 21:15:36] [INFO ] Deduced a trap composed of 52 places in 845 ms of which 8 ms to minimize.
[2024-05-31 21:15:37] [INFO ] Deduced a trap composed of 76 places in 827 ms of which 8 ms to minimize.
[2024-05-31 21:15:37] [INFO ] Deduced a trap composed of 49 places in 806 ms of which 8 ms to minimize.
SMT process timed out in 45232ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 152 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 147 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-31 21:15:38] [INFO ] Invariant cache hit.
[2024-05-31 21:15:40] [INFO ] Implicit Places using invariants in 1852 ms returned []
[2024-05-31 21:15:40] [INFO ] Invariant cache hit.
[2024-05-31 21:15:41] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-31 21:16:11] [INFO ] Performed 844/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:16:41] [INFO ] Implicit Places using invariants and state equation in 61232 ms returned []
Implicit Place search using SMT with State Equation took 63086 ms to find 0 implicit places.
[2024-05-31 21:16:41] [INFO ] Redundant transitions in 533 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-31 21:16:41] [INFO ] Invariant cache hit.
[2024-05-31 21:16:42] [INFO ] State equation strengthened by 6394 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36509ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100344 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1))), (G (OR (NOT p1) p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT p4)), (F p1), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (F (NOT (OR p1 p2 p3 p4))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 32 factoid took 406 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Product exploration explored 100000 steps with 33268 reset in 1254 ms.
Product exploration explored 100000 steps with 33374 reset in 1202 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 144 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:17:22] [INFO ] Computed 42 invariants in 141 ms
[2024-05-31 21:17:23] [INFO ] Implicit Places using invariants in 1256 ms returned []
[2024-05-31 21:17:23] [INFO ] Invariant cache hit.
[2024-05-31 21:17:24] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:17:38] [INFO ] Implicit Places using invariants and state equation in 15682 ms returned []
Implicit Place search using SMT with State Equation took 16939 ms to find 0 implicit places.
[2024-05-31 21:17:39] [INFO ] Redundant transitions in 482 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:17:39] [INFO ] Invariant cache hit.
[2024-05-31 21:17:39] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35062ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35110ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52687 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-06 finished in 555967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 184 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:18:15] [INFO ] Computed 42 invariants in 348 ms
[2024-05-31 21:18:17] [INFO ] Implicit Places using invariants in 2339 ms returned []
[2024-05-31 21:18:17] [INFO ] Invariant cache hit.
[2024-05-31 21:18:19] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:18:50] [INFO ] Performed 420/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:18:57] [INFO ] Implicit Places using invariants and state equation in 40473 ms returned []
Implicit Place search using SMT with State Equation took 42812 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:18:57] [INFO ] Invariant cache hit.
[2024-05-31 21:18:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 40067ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 40137ms
Finished structural reductions in LTL mode , in 1 iterations and 83144 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-08
Stuttering criterion allowed to conclude after 1090 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-08 finished in 83291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 178 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-31 21:19:38] [INFO ] Invariant cache hit.
[2024-05-31 21:19:40] [INFO ] Implicit Places using invariants in 2028 ms returned []
[2024-05-31 21:19:40] [INFO ] Invariant cache hit.
[2024-05-31 21:19:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:20:13] [INFO ] Performed 353/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:20:25] [INFO ] Implicit Places using invariants and state equation in 45426 ms returned []
Implicit Place search using SMT with State Equation took 47454 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:20:25] [INFO ] Invariant cache hit.
[2024-05-31 21:20:25] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38853ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38924ms
Finished structural reductions in LTL mode , in 1 iterations and 86568 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-09
Entered a terminal (fully accepting) state of product in 7651 steps with 8 reset in 55 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-09 finished in 86735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 175 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-31 21:21:04] [INFO ] Invariant cache hit.
[2024-05-31 21:21:06] [INFO ] Implicit Places using invariants in 1962 ms returned []
[2024-05-31 21:21:06] [INFO ] Invariant cache hit.
[2024-05-31 21:21:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:21:39] [INFO ] Performed 336/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:21:52] [INFO ] Implicit Places using invariants and state equation in 45788 ms returned []
Implicit Place search using SMT with State Equation took 47751 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:21:52] [INFO ] Invariant cache hit.
[2024-05-31 21:21:52] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38758ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38829ms
Finished structural reductions in LTL mode , in 1 iterations and 86772 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-10 finished in 86920 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||((X(p1)&&F(p2)) U (G(((X(p1)&&F(p2))||X(G(p1))))||(!p3&&((X(p1)&&F(p2))||X(G(p1))))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 179 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-31 21:22:31] [INFO ] Invariant cache hit.
[2024-05-31 21:22:33] [INFO ] Implicit Places using invariants in 1975 ms returned []
[2024-05-31 21:22:33] [INFO ] Invariant cache hit.
[2024-05-31 21:22:36] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:23:06] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:23:18] [INFO ] Implicit Places using invariants and state equation in 44935 ms returned []
Implicit Place search using SMT with State Equation took 46912 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:23:18] [INFO ] Invariant cache hit.
[2024-05-31 21:23:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38806ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38879ms
Finished structural reductions in LTL mode , in 1 iterations and 85981 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-11
Product exploration explored 100000 steps with 107 reset in 922 ms.
Product exploration explored 100000 steps with 105 reset in 836 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))]
Knowledge based reduction with 38 factoid took 710 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (37 resets) in 534 ms. (74 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
[2024-05-31 21:24:01] [INFO ] Invariant cache hit.
[2024-05-31 21:24:01] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:24:01] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3605 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/3679 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:24:08] [INFO ] Deduced a trap composed of 75 places in 3415 ms of which 21 ms to minimize.
SMT process timed out in 7544ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 3 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1233 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1236 ms. Remains : 1845/3683 places, 6522/9840 transitions.
RANDOM walk for 40000 steps (214 resets) in 1801 ms. (22 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 69225 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 12
Probabilistic random walk after 69225 steps, saw 21993 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-31 21:24:14] [INFO ] Computed 42 invariants in 140 ms
[2024-05-31 21:24:14] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:24:14] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/1841 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:24:17] [INFO ] Deduced a trap composed of 49 places in 1376 ms of which 11 ms to minimize.
[2024-05-31 21:24:19] [INFO ] Deduced a trap composed of 51 places in 1360 ms of which 10 ms to minimize.
[2024-05-31 21:24:20] [INFO ] Deduced a trap composed of 86 places in 1301 ms of which 10 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Deduced a trap composed of 67 places in 1405 ms of which 10 ms to minimize.
[2024-05-31 21:24:23] [INFO ] Deduced a trap composed of 66 places in 1448 ms of which 11 ms to minimize.
[2024-05-31 21:24:24] [INFO ] Deduced a trap composed of 56 places in 1478 ms of which 11 ms to minimize.
[2024-05-31 21:24:26] [INFO ] Deduced a trap composed of 56 places in 1328 ms of which 11 ms to minimize.
[2024-05-31 21:24:27] [INFO ] Deduced a trap composed of 55 places in 1417 ms of which 11 ms to minimize.
[2024-05-31 21:24:29] [INFO ] Deduced a trap composed of 59 places in 1453 ms of which 10 ms to minimize.
[2024-05-31 21:24:30] [INFO ] Deduced a trap composed of 61 places in 1459 ms of which 11 ms to minimize.
[2024-05-31 21:24:32] [INFO ] Deduced a trap composed of 68 places in 1428 ms of which 11 ms to minimize.
[2024-05-31 21:24:33] [INFO ] Deduced a trap composed of 49 places in 1327 ms of which 11 ms to minimize.
[2024-05-31 21:24:34] [INFO ] Deduced a trap composed of 54 places in 1358 ms of which 11 ms to minimize.
[2024-05-31 21:24:36] [INFO ] Deduced a trap composed of 59 places in 1348 ms of which 11 ms to minimize.
[2024-05-31 21:24:37] [INFO ] Deduced a trap composed of 57 places in 1341 ms of which 10 ms to minimize.
[2024-05-31 21:24:38] [INFO ] Deduced a trap composed of 57 places in 1325 ms of which 10 ms to minimize.
[2024-05-31 21:24:40] [INFO ] Deduced a trap composed of 45 places in 1262 ms of which 10 ms to minimize.
[2024-05-31 21:24:41] [INFO ] Deduced a trap composed of 57 places in 1223 ms of which 10 ms to minimize.
[2024-05-31 21:24:42] [INFO ] Deduced a trap composed of 55 places in 1204 ms of which 10 ms to minimize.
[2024-05-31 21:24:43] [INFO ] Deduced a trap composed of 61 places in 1256 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:24:45] [INFO ] Deduced a trap composed of 67 places in 1265 ms of which 10 ms to minimize.
[2024-05-31 21:24:46] [INFO ] Deduced a trap composed of 59 places in 1221 ms of which 9 ms to minimize.
[2024-05-31 21:24:47] [INFO ] Deduced a trap composed of 63 places in 1274 ms of which 10 ms to minimize.
[2024-05-31 21:24:49] [INFO ] Deduced a trap composed of 60 places in 1249 ms of which 10 ms to minimize.
[2024-05-31 21:24:50] [INFO ] Deduced a trap composed of 55 places in 1172 ms of which 11 ms to minimize.
[2024-05-31 21:24:51] [INFO ] Deduced a trap composed of 54 places in 1180 ms of which 10 ms to minimize.
[2024-05-31 21:24:52] [INFO ] Deduced a trap composed of 55 places in 1186 ms of which 9 ms to minimize.
[2024-05-31 21:24:53] [INFO ] Deduced a trap composed of 54 places in 1181 ms of which 10 ms to minimize.
[2024-05-31 21:24:55] [INFO ] Deduced a trap composed of 57 places in 1174 ms of which 9 ms to minimize.
[2024-05-31 21:24:56] [INFO ] Deduced a trap composed of 56 places in 1172 ms of which 9 ms to minimize.
[2024-05-31 21:24:57] [INFO ] Deduced a trap composed of 52 places in 1128 ms of which 9 ms to minimize.
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 51 places in 1122 ms of which 9 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 51 places in 1108 ms of which 9 ms to minimize.
SMT process timed out in 45717ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 149 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 168 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-31 21:25:00] [INFO ] Invariant cache hit.
[2024-05-31 21:25:01] [INFO ] Implicit Places using invariants in 1871 ms returned []
[2024-05-31 21:25:01] [INFO ] Invariant cache hit.
[2024-05-31 21:25:03] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-31 21:25:33] [INFO ] Performed 826/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:26:01] [INFO ] Implicit Places using invariants and state equation in 59922 ms returned []
Implicit Place search using SMT with State Equation took 61793 ms to find 0 implicit places.
[2024-05-31 21:26:02] [INFO ] Redundant transitions in 521 ms returned []
Running 6482 sub problems to find dead transitions.
[2024-05-31 21:26:02] [INFO ] Invariant cache hit.
[2024-05-31 21:26:02] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6482 unsolved
SMT process timed out in 35961ms, After SMT, problems are : Problem set: 0 solved, 6482 unsolved
Search for dead transitions found 0 dead transitions in 36010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98510 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR p2 p3)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 (NOT p1)))), (F p3), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT p0))]
Knowledge based reduction with 38 factoid took 1275 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 178 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:26:41] [INFO ] Computed 42 invariants in 347 ms
[2024-05-31 21:26:43] [INFO ] Implicit Places using invariants in 2545 ms returned []
[2024-05-31 21:26:43] [INFO ] Invariant cache hit.
[2024-05-31 21:26:45] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:27:16] [INFO ] Performed 301/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:27:31] [INFO ] Implicit Places using invariants and state equation in 48263 ms returned []
Implicit Place search using SMT with State Equation took 50809 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:27:31] [INFO ] Invariant cache hit.
[2024-05-31 21:27:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39032ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39103ms
Finished structural reductions in LTL mode , in 1 iterations and 90111 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 38 factoid took 748 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (40 resets) in 1973 ms. (20 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
[2024-05-31 21:28:12] [INFO ] Invariant cache hit.
[2024-05-31 21:28:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:28:13] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3605 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/3679 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:28:20] [INFO ] Deduced a trap composed of 75 places in 3549 ms of which 22 ms to minimize.
SMT process timed out in 7705ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 2 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1190 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1190 ms. Remains : 1845/3683 places, 6522/9840 transitions.
RANDOM walk for 40000 steps (217 resets) in 1862 ms. (21 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 70598 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 12
Probabilistic random walk after 70598 steps, saw 22187 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-31 21:28:25] [INFO ] Computed 42 invariants in 139 ms
[2024-05-31 21:28:25] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:28:26] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/1841 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:28:29] [INFO ] Deduced a trap composed of 49 places in 1384 ms of which 11 ms to minimize.
[2024-05-31 21:28:30] [INFO ] Deduced a trap composed of 51 places in 1367 ms of which 11 ms to minimize.
[2024-05-31 21:28:32] [INFO ] Deduced a trap composed of 86 places in 1469 ms of which 11 ms to minimize.
[2024-05-31 21:28:33] [INFO ] Deduced a trap composed of 52 places in 1386 ms of which 12 ms to minimize.
[2024-05-31 21:28:35] [INFO ] Deduced a trap composed of 53 places in 1428 ms of which 11 ms to minimize.
[2024-05-31 21:28:36] [INFO ] Deduced a trap composed of 55 places in 1313 ms of which 10 ms to minimize.
[2024-05-31 21:28:37] [INFO ] Deduced a trap composed of 55 places in 1350 ms of which 11 ms to minimize.
[2024-05-31 21:28:39] [INFO ] Deduced a trap composed of 51 places in 1323 ms of which 11 ms to minimize.
[2024-05-31 21:28:40] [INFO ] Deduced a trap composed of 51 places in 1195 ms of which 10 ms to minimize.
[2024-05-31 21:28:41] [INFO ] Deduced a trap composed of 52 places in 1258 ms of which 10 ms to minimize.
[2024-05-31 21:28:43] [INFO ] Deduced a trap composed of 53 places in 1285 ms of which 10 ms to minimize.
[2024-05-31 21:28:44] [INFO ] Deduced a trap composed of 55 places in 1318 ms of which 10 ms to minimize.
[2024-05-31 21:28:45] [INFO ] Deduced a trap composed of 56 places in 1278 ms of which 10 ms to minimize.
[2024-05-31 21:28:46] [INFO ] Deduced a trap composed of 53 places in 1223 ms of which 10 ms to minimize.
[2024-05-31 21:28:48] [INFO ] Deduced a trap composed of 55 places in 1215 ms of which 10 ms to minimize.
[2024-05-31 21:28:49] [INFO ] Deduced a trap composed of 53 places in 1188 ms of which 10 ms to minimize.
[2024-05-31 21:28:50] [INFO ] Deduced a trap composed of 52 places in 1252 ms of which 10 ms to minimize.
[2024-05-31 21:28:51] [INFO ] Deduced a trap composed of 54 places in 1158 ms of which 10 ms to minimize.
[2024-05-31 21:28:53] [INFO ] Deduced a trap composed of 51 places in 1098 ms of which 10 ms to minimize.
[2024-05-31 21:28:54] [INFO ] Deduced a trap composed of 51 places in 1093 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:28:55] [INFO ] Deduced a trap composed of 53 places in 1133 ms of which 9 ms to minimize.
[2024-05-31 21:28:56] [INFO ] Deduced a trap composed of 57 places in 1043 ms of which 9 ms to minimize.
[2024-05-31 21:28:57] [INFO ] Deduced a trap composed of 54 places in 995 ms of which 9 ms to minimize.
[2024-05-31 21:28:58] [INFO ] Deduced a trap composed of 67 places in 1045 ms of which 8 ms to minimize.
[2024-05-31 21:28:59] [INFO ] Deduced a trap composed of 57 places in 1026 ms of which 9 ms to minimize.
[2024-05-31 21:29:00] [INFO ] Deduced a trap composed of 55 places in 967 ms of which 9 ms to minimize.
[2024-05-31 21:29:01] [INFO ] Deduced a trap composed of 53 places in 929 ms of which 8 ms to minimize.
[2024-05-31 21:29:02] [INFO ] Deduced a trap composed of 73 places in 902 ms of which 7 ms to minimize.
[2024-05-31 21:29:03] [INFO ] Deduced a trap composed of 65 places in 899 ms of which 8 ms to minimize.
[2024-05-31 21:29:04] [INFO ] Deduced a trap composed of 75 places in 905 ms of which 8 ms to minimize.
[2024-05-31 21:29:05] [INFO ] Deduced a trap composed of 49 places in 901 ms of which 8 ms to minimize.
[2024-05-31 21:29:06] [INFO ] Deduced a trap composed of 45 places in 874 ms of which 8 ms to minimize.
[2024-05-31 21:29:07] [INFO ] Deduced a trap composed of 51 places in 806 ms of which 7 ms to minimize.
[2024-05-31 21:29:07] [INFO ] Deduced a trap composed of 67 places in 818 ms of which 8 ms to minimize.
[2024-05-31 21:29:08] [INFO ] Deduced a trap composed of 64 places in 816 ms of which 7 ms to minimize.
[2024-05-31 21:29:09] [INFO ] Deduced a trap composed of 60 places in 816 ms of which 7 ms to minimize.
[2024-05-31 21:29:10] [INFO ] Deduced a trap composed of 57 places in 855 ms of which 8 ms to minimize.
[2024-05-31 21:29:11] [INFO ] Deduced a trap composed of 80 places in 784 ms of which 7 ms to minimize.
SMT process timed out in 45493ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 152 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 148 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-31 21:29:11] [INFO ] Invariant cache hit.
[2024-05-31 21:29:13] [INFO ] Implicit Places using invariants in 1798 ms returned []
[2024-05-31 21:29:13] [INFO ] Invariant cache hit.
[2024-05-31 21:29:14] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-31 21:29:45] [INFO ] Performed 582/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:30:15] [INFO ] Performed 1582/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:30:24] [INFO ] Implicit Places using invariants and state equation in 70991 ms returned []
Implicit Place search using SMT with State Equation took 72791 ms to find 0 implicit places.
[2024-05-31 21:30:24] [INFO ] Redundant transitions in 531 ms returned []
Running 6482 sub problems to find dead transitions.
[2024-05-31 21:30:24] [INFO ] Invariant cache hit.
[2024-05-31 21:30:25] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6482 unsolved
SMT process timed out in 35863ms, After SMT, problems are : Problem set: 0 solved, 6482 unsolved
Search for dead transitions found 0 dead transitions in 35913ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109404 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p3 p2)))), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 38 factoid took 1124 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 107 reset in 790 ms.
Product exploration explored 100000 steps with 104 reset in 739 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 3683 transition count 9840
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 198 place count 3683 transition count 9840
Deduced a syphon composed of 239 places in 3 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 239 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 319 place count 3603 transition count 9760
Deduced a syphon composed of 159 places in 3 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 399 place count 3603 transition count 9760
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: -3036
Deduced a syphon composed of 1756 places in 3 ms
Iterating global reduction 1 with 1597 rules applied. Total rules applied 1996 place count 3603 transition count 12796
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 2153 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 2 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 2310 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 1 with 1480 rules applied. Total rules applied 3790 place count 3446 transition count 11159
Deduced a syphon composed of 1599 places in 2 ms
Applied a total of 3790 rules in 2439 ms. Remains 3446 /3683 variables (removed 237) and now considering 11159/9840 (removed -1319) transitions.
Running 11119 sub problems to find dead transitions.
// Phase 1: matrix 11159 rows 3446 cols
[2024-05-31 21:31:07] [INFO ] Computed 42 invariants in 329 ms
[2024-05-31 21:31:07] [INFO ] State equation strengthened by 4756 read => feed constraints.
(s973 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.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 1.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 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 1.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3445 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 11119 unsolved
SMT process timed out in 42197ms, After SMT, problems are : Problem set: 0 solved, 11119 unsolved
Search for dead transitions found 0 dead transitions in 42300ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3446/3683 places, 11159/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44759 ms. Remains : 3446/3683 places, 11159/9840 transitions.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 235 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:31:50] [INFO ] Computed 42 invariants in 357 ms
[2024-05-31 21:31:52] [INFO ] Implicit Places using invariants in 2446 ms returned []
[2024-05-31 21:31:52] [INFO ] Invariant cache hit.
[2024-05-31 21:31:55] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:32:26] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:32:39] [INFO ] Implicit Places using invariants and state equation in 47527 ms returned []
Implicit Place search using SMT with State Equation took 49975 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:32:40] [INFO ] Invariant cache hit.
[2024-05-31 21:32:40] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39975ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 40045ms
Finished structural reductions in LTL mode , in 1 iterations and 90266 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-11 finished in 648604 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(X((G(p1) U X(p2))))||p0))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 191 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-31 21:33:20] [INFO ] Invariant cache hit.
[2024-05-31 21:33:22] [INFO ] Implicit Places using invariants in 2087 ms returned []
[2024-05-31 21:33:22] [INFO ] Invariant cache hit.
[2024-05-31 21:33:25] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:33:55] [INFO ] Performed 301/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:34:11] [INFO ] Implicit Places using invariants and state equation in 49351 ms returned []
Implicit Place search using SMT with State Equation took 51440 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:34:11] [INFO ] Invariant cache hit.
[2024-05-31 21:34:11] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38859ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38929ms
Finished structural reductions in LTL mode , in 1 iterations and 90573 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 1174 ms.
Product exploration explored 100000 steps with 33333 reset in 1206 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-12 finished in 93397 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 (G(!p0)||(!p0&&G(p1)))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 1060 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:34:54] [INFO ] Computed 42 invariants in 134 ms
[2024-05-31 21:34:55] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2024-05-31 21:34:55] [INFO ] Invariant cache hit.
[2024-05-31 21:34:57] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:35:14] [INFO ] Implicit Places using invariants and state equation in 18810 ms returned []
Implicit Place search using SMT with State Equation took 20131 ms to find 0 implicit places.
[2024-05-31 21:35:15] [INFO ] Redundant transitions in 711 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:35:15] [INFO ] Invariant cache hit.
[2024-05-31 21:35:15] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34870ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34919ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56840 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-13
Product exploration explored 100000 steps with 492 reset in 964 ms.
Product exploration explored 100000 steps with 492 reset in 989 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (193 resets) in 521 ms. (76 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2024-05-31 21:35:53] [INFO ] Invariant cache hit.
[2024-05-31 21:35:53] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:35:53] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:35:53] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:35:55] [INFO ] Deduced a trap composed of 60 places in 1470 ms of which 12 ms to minimize.
[2024-05-31 21:35:56] [INFO ] Deduced a trap composed of 50 places in 1377 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8364/8366 variables, and 6646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:35:59] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/1841 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:00] [INFO ] Deduced a trap composed of 69 places in 1400 ms of which 11 ms to minimize.
[2024-05-31 21:36:01] [INFO ] Deduced a trap composed of 57 places in 1305 ms of which 10 ms to minimize.
[2024-05-31 21:36:03] [INFO ] Deduced a trap composed of 48 places in 1253 ms of which 10 ms to minimize.
SMT process timed out in 10191ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1644 place count 1843 transition count 6519
Applied a total of 1644 rules in 665 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (218 resets) in 519 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 99500 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 99500 steps, saw 27437 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:36:07] [INFO ] Computed 42 invariants in 146 ms
[2024-05-31 21:36:07] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:07] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:09] [INFO ] Deduced a trap composed of 67 places in 1420 ms of which 11 ms to minimize.
[2024-05-31 21:36:10] [INFO ] Deduced a trap composed of 64 places in 1346 ms of which 10 ms to minimize.
[2024-05-31 21:36:11] [INFO ] Deduced a trap composed of 55 places in 1292 ms of which 10 ms to minimize.
[2024-05-31 21:36:13] [INFO ] Deduced a trap composed of 48 places in 1260 ms of which 10 ms to minimize.
[2024-05-31 21:36:14] [INFO ] Deduced a trap composed of 46 places in 1246 ms of which 10 ms to minimize.
[2024-05-31 21:36:15] [INFO ] Deduced a trap composed of 72 places in 1236 ms of which 9 ms to minimize.
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 59 places in 1180 ms of which 9 ms to minimize.
[2024-05-31 21:36:18] [INFO ] Deduced a trap composed of 45 places in 1127 ms of which 10 ms to minimize.
[2024-05-31 21:36:19] [INFO ] Deduced a trap composed of 47 places in 1080 ms of which 9 ms to minimize.
[2024-05-31 21:36:20] [INFO ] Deduced a trap composed of 47 places in 1098 ms of which 9 ms to minimize.
[2024-05-31 21:36:21] [INFO ] Deduced a trap composed of 45 places in 1017 ms of which 9 ms to minimize.
[2024-05-31 21:36:22] [INFO ] Deduced a trap composed of 65 places in 1073 ms of which 9 ms to minimize.
[2024-05-31 21:36:23] [INFO ] Deduced a trap composed of 48 places in 1020 ms of which 9 ms to minimize.
[2024-05-31 21:36:24] [INFO ] Deduced a trap composed of 45 places in 1019 ms of which 9 ms to minimize.
[2024-05-31 21:36:25] [INFO ] Deduced a trap composed of 56 places in 961 ms of which 8 ms to minimize.
[2024-05-31 21:36:26] [INFO ] Deduced a trap composed of 53 places in 959 ms of which 8 ms to minimize.
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 50 places in 946 ms of which 9 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 47 places in 922 ms of which 9 ms to minimize.
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 53 places in 937 ms of which 9 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 49 places in 891 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 68 places in 853 ms of which 7 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 54 places in 815 ms of which 7 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 49 places in 794 ms of which 7 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 50 places in 769 ms of which 7 ms to minimize.
[2024-05-31 21:36:34] [INFO ] Deduced a trap composed of 51 places in 802 ms of which 8 ms to minimize.
[2024-05-31 21:36:35] [INFO ] Deduced a trap composed of 56 places in 763 ms of which 7 ms to minimize.
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 48 places in 728 ms of which 7 ms to minimize.
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 47 places in 719 ms of which 7 ms to minimize.
[2024-05-31 21:36:37] [INFO ] Deduced a trap composed of 48 places in 740 ms of which 7 ms to minimize.
[2024-05-31 21:36:38] [INFO ] Deduced a trap composed of 56 places in 696 ms of which 7 ms to minimize.
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 57 places in 699 ms of which 7 ms to minimize.
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 45 places in 655 ms of which 6 ms to minimize.
[2024-05-31 21:36:40] [INFO ] Deduced a trap composed of 55 places in 688 ms of which 7 ms to minimize.
[2024-05-31 21:36:41] [INFO ] Deduced a trap composed of 53 places in 729 ms of which 7 ms to minimize.
[2024-05-31 21:36:42] [INFO ] Deduced a trap composed of 48 places in 758 ms of which 8 ms to minimize.
[2024-05-31 21:36:42] [INFO ] Deduced a trap composed of 47 places in 764 ms of which 7 ms to minimize.
[2024-05-31 21:36:43] [INFO ] Deduced a trap composed of 49 places in 759 ms of which 7 ms to minimize.
[2024-05-31 21:36:44] [INFO ] Deduced a trap composed of 55 places in 728 ms of which 7 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 48 places in 675 ms of which 6 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 47 places in 661 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:46] [INFO ] Deduced a trap composed of 47 places in 648 ms of which 6 ms to minimize.
[2024-05-31 21:36:47] [INFO ] Deduced a trap composed of 46 places in 652 ms of which 6 ms to minimize.
[2024-05-31 21:36:47] [INFO ] Deduced a trap composed of 46 places in 614 ms of which 7 ms to minimize.
[2024-05-31 21:36:48] [INFO ] Deduced a trap composed of 46 places in 605 ms of which 6 ms to minimize.
[2024-05-31 21:36:49] [INFO ] Deduced a trap composed of 45 places in 624 ms of which 7 ms to minimize.
[2024-05-31 21:36:49] [INFO ] Deduced a trap composed of 57 places in 602 ms of which 6 ms to minimize.
[2024-05-31 21:36:50] [INFO ] Deduced a trap composed of 52 places in 620 ms of which 6 ms to minimize.
[2024-05-31 21:36:50] [INFO ] Deduced a trap composed of 50 places in 582 ms of which 6 ms to minimize.
[2024-05-31 21:36:51] [INFO ] Deduced a trap composed of 56 places in 641 ms of which 7 ms to minimize.
[2024-05-31 21:36:52] [INFO ] Deduced a trap composed of 52 places in 637 ms of which 6 ms to minimize.
SMT process timed out in 45241ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 226 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 214 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-31 21:36:52] [INFO ] Invariant cache hit.
[2024-05-31 21:36:54] [INFO ] Implicit Places using invariants in 1851 ms returned []
[2024-05-31 21:36:54] [INFO ] Invariant cache hit.
[2024-05-31 21:36:55] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-31 21:37:26] [INFO ] Performed 672/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:37:56] [INFO ] Performed 1663/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:38:01] [INFO ] Implicit Places using invariants and state equation in 66740 ms returned []
Implicit Place search using SMT with State Equation took 68591 ms to find 0 implicit places.
[2024-05-31 21:38:01] [INFO ] Redundant transitions in 512 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-31 21:38:01] [INFO ] Invariant cache hit.
[2024-05-31 21:38:01] [INFO ] State equation strengthened by 6396 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 35994ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36042ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105387 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 291 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 203 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:38:38] [INFO ] Computed 42 invariants in 132 ms
[2024-05-31 21:38:40] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2024-05-31 21:38:40] [INFO ] Invariant cache hit.
[2024-05-31 21:38:41] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:38:57] [INFO ] Implicit Places using invariants and state equation in 17268 ms returned []
Implicit Place search using SMT with State Equation took 18535 ms to find 0 implicit places.
[2024-05-31 21:38:57] [INFO ] Redundant transitions in 476 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:38:57] [INFO ] Invariant cache hit.
[2024-05-31 21:38:57] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35738ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35787ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55020 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (197 resets) in 503 ms. (79 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2024-05-31 21:39:34] [INFO ] Invariant cache hit.
[2024-05-31 21:39:34] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:39:34] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:39:34] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:39:36] [INFO ] Deduced a trap composed of 60 places in 1473 ms of which 11 ms to minimize.
[2024-05-31 21:39:37] [INFO ] Deduced a trap composed of 50 places in 1339 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8364/8366 variables, and 6646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/1841 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:39:41] [INFO ] Deduced a trap composed of 69 places in 1348 ms of which 10 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 57 places in 1299 ms of which 10 ms to minimize.
[2024-05-31 21:39:44] [INFO ] Deduced a trap composed of 48 places in 1267 ms of which 11 ms to minimize.
SMT process timed out in 10099ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1644 place count 1843 transition count 6519
Applied a total of 1644 rules in 700 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 700 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 479 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 99760 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 99760 steps, saw 27456 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:39:48] [INFO ] Computed 42 invariants in 142 ms
[2024-05-31 21:39:48] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:39:48] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:39:50] [INFO ] Deduced a trap composed of 67 places in 1394 ms of which 14 ms to minimize.
[2024-05-31 21:39:51] [INFO ] Deduced a trap composed of 64 places in 1349 ms of which 11 ms to minimize.
[2024-05-31 21:39:52] [INFO ] Deduced a trap composed of 55 places in 1346 ms of which 11 ms to minimize.
[2024-05-31 21:39:54] [INFO ] Deduced a trap composed of 48 places in 1314 ms of which 11 ms to minimize.
[2024-05-31 21:39:55] [INFO ] Deduced a trap composed of 46 places in 1314 ms of which 10 ms to minimize.
[2024-05-31 21:39:56] [INFO ] Deduced a trap composed of 72 places in 1295 ms of which 10 ms to minimize.
[2024-05-31 21:39:58] [INFO ] Deduced a trap composed of 59 places in 1220 ms of which 10 ms to minimize.
[2024-05-31 21:39:59] [INFO ] Deduced a trap composed of 45 places in 1080 ms of which 9 ms to minimize.
[2024-05-31 21:40:00] [INFO ] Deduced a trap composed of 47 places in 1123 ms of which 9 ms to minimize.
[2024-05-31 21:40:01] [INFO ] Deduced a trap composed of 47 places in 1126 ms of which 9 ms to minimize.
[2024-05-31 21:40:02] [INFO ] Deduced a trap composed of 45 places in 1099 ms of which 9 ms to minimize.
[2024-05-31 21:40:03] [INFO ] Deduced a trap composed of 65 places in 1072 ms of which 9 ms to minimize.
[2024-05-31 21:40:04] [INFO ] Deduced a trap composed of 48 places in 1116 ms of which 9 ms to minimize.
[2024-05-31 21:40:05] [INFO ] Deduced a trap composed of 45 places in 1015 ms of which 8 ms to minimize.
[2024-05-31 21:40:06] [INFO ] Deduced a trap composed of 56 places in 994 ms of which 8 ms to minimize.
[2024-05-31 21:40:08] [INFO ] Deduced a trap composed of 53 places in 997 ms of which 8 ms to minimize.
[2024-05-31 21:40:09] [INFO ] Deduced a trap composed of 50 places in 993 ms of which 9 ms to minimize.
[2024-05-31 21:40:09] [INFO ] Deduced a trap composed of 47 places in 928 ms of which 8 ms to minimize.
[2024-05-31 21:40:10] [INFO ] Deduced a trap composed of 53 places in 948 ms of which 8 ms to minimize.
[2024-05-31 21:40:11] [INFO ] Deduced a trap composed of 49 places in 921 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:40:12] [INFO ] Deduced a trap composed of 68 places in 920 ms of which 8 ms to minimize.
[2024-05-31 21:40:13] [INFO ] Deduced a trap composed of 54 places in 859 ms of which 8 ms to minimize.
[2024-05-31 21:40:14] [INFO ] Deduced a trap composed of 49 places in 800 ms of which 11 ms to minimize.
[2024-05-31 21:40:15] [INFO ] Deduced a trap composed of 50 places in 805 ms of which 8 ms to minimize.
[2024-05-31 21:40:16] [INFO ] Deduced a trap composed of 51 places in 813 ms of which 8 ms to minimize.
[2024-05-31 21:40:17] [INFO ] Deduced a trap composed of 56 places in 780 ms of which 7 ms to minimize.
[2024-05-31 21:40:17] [INFO ] Deduced a trap composed of 48 places in 777 ms of which 7 ms to minimize.
[2024-05-31 21:40:18] [INFO ] Deduced a trap composed of 47 places in 751 ms of which 7 ms to minimize.
[2024-05-31 21:40:19] [INFO ] Deduced a trap composed of 48 places in 770 ms of which 7 ms to minimize.
[2024-05-31 21:40:20] [INFO ] Deduced a trap composed of 56 places in 723 ms of which 6 ms to minimize.
[2024-05-31 21:40:20] [INFO ] Deduced a trap composed of 57 places in 669 ms of which 7 ms to minimize.
[2024-05-31 21:40:21] [INFO ] Deduced a trap composed of 45 places in 717 ms of which 7 ms to minimize.
[2024-05-31 21:40:22] [INFO ] Deduced a trap composed of 55 places in 716 ms of which 7 ms to minimize.
[2024-05-31 21:40:23] [INFO ] Deduced a trap composed of 53 places in 716 ms of which 7 ms to minimize.
[2024-05-31 21:40:23] [INFO ] Deduced a trap composed of 48 places in 763 ms of which 7 ms to minimize.
[2024-05-31 21:40:24] [INFO ] Deduced a trap composed of 47 places in 837 ms of which 7 ms to minimize.
[2024-05-31 21:40:25] [INFO ] Deduced a trap composed of 49 places in 730 ms of which 7 ms to minimize.
[2024-05-31 21:40:26] [INFO ] Deduced a trap composed of 55 places in 728 ms of which 7 ms to minimize.
[2024-05-31 21:40:27] [INFO ] Deduced a trap composed of 48 places in 671 ms of which 6 ms to minimize.
[2024-05-31 21:40:27] [INFO ] Deduced a trap composed of 47 places in 657 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:40:28] [INFO ] Deduced a trap composed of 47 places in 661 ms of which 7 ms to minimize.
[2024-05-31 21:40:29] [INFO ] Deduced a trap composed of 46 places in 608 ms of which 7 ms to minimize.
[2024-05-31 21:40:29] [INFO ] Deduced a trap composed of 46 places in 643 ms of which 7 ms to minimize.
[2024-05-31 21:40:30] [INFO ] Deduced a trap composed of 46 places in 660 ms of which 7 ms to minimize.
[2024-05-31 21:40:31] [INFO ] Deduced a trap composed of 45 places in 602 ms of which 7 ms to minimize.
[2024-05-31 21:40:31] [INFO ] Deduced a trap composed of 57 places in 594 ms of which 6 ms to minimize.
[2024-05-31 21:40:32] [INFO ] Deduced a trap composed of 52 places in 631 ms of which 6 ms to minimize.
[2024-05-31 21:40:32] [INFO ] Deduced a trap composed of 50 places in 577 ms of which 6 ms to minimize.
[2024-05-31 21:40:33] [INFO ] Deduced a trap composed of 56 places in 643 ms of which 6 ms to minimize.
SMT process timed out in 45612ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 237 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 226 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-31 21:40:34] [INFO ] Invariant cache hit.
[2024-05-31 21:40:35] [INFO ] Implicit Places using invariants in 1894 ms returned []
[2024-05-31 21:40:35] [INFO ] Invariant cache hit.
[2024-05-31 21:40:37] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-31 21:41:07] [INFO ] Performed 547/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:41:37] [INFO ] Performed 1500/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:41:48] [INFO ] Implicit Places using invariants and state equation in 72484 ms returned []
Implicit Place search using SMT with State Equation took 74380 ms to find 0 implicit places.
[2024-05-31 21:41:48] [INFO ] Redundant transitions in 512 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-31 21:41:49] [INFO ] Invariant cache hit.
[2024-05-31 21:41:49] [INFO ] State equation strengthened by 6396 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36382ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111569 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 290 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 492 reset in 1008 ms.
Product exploration explored 100000 steps with 491 reset in 1030 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 205 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:42:28] [INFO ] Computed 42 invariants in 133 ms
[2024-05-31 21:42:29] [INFO ] Implicit Places using invariants in 1348 ms returned []
[2024-05-31 21:42:29] [INFO ] Invariant cache hit.
[2024-05-31 21:42:31] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:42:49] [INFO ] Implicit Places using invariants and state equation in 19650 ms returned []
Implicit Place search using SMT with State Equation took 20998 ms to find 0 implicit places.
[2024-05-31 21:42:49] [INFO ] Redundant transitions in 466 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:42:49] [INFO ] Invariant cache hit.
[2024-05-31 21:42:49] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35160ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56902 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-13 finished in 511628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p1 U p2)||p0)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-040-LTLFireability-06
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 913 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:43:26] [INFO ] Computed 42 invariants in 132 ms
[2024-05-31 21:43:28] [INFO ] Implicit Places using invariants in 1368 ms returned []
[2024-05-31 21:43:28] [INFO ] Invariant cache hit.
[2024-05-31 21:43:29] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:43:44] [INFO ] Implicit Places using invariants and state equation in 16863 ms returned []
Implicit Place search using SMT with State Equation took 18233 ms to find 0 implicit places.
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:43:45] [INFO ] Invariant cache hit.
[2024-05-31 21:43:45] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35108ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35155ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54308 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06
Product exploration explored 100000 steps with 33363 reset in 1218 ms.
Product exploration explored 100000 steps with 33238 reset in 1373 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 141 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (197 resets) in 834 ms. (47 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
[2024-05-31 21:44:23] [INFO ] Invariant cache hit.
[2024-05-31 21:44:23] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-31 21:44:24] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-31 21:44:26] [INFO ] Deduced a trap composed of 68 places in 1373 ms of which 10 ms to minimize.
[2024-05-31 21:44:27] [INFO ] Deduced a trap composed of 69 places in 1389 ms of which 11 ms to minimize.
[2024-05-31 21:44:28] [INFO ] Deduced a trap composed of 49 places in 1305 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1843/8366 variables, and 46 constraints, problems are : Problem set: 6 solved, 4 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1845 constraints, ReadFeed: 0/4757 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 6 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/46 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-31 21:44:30] [INFO ] Deduced a trap composed of 62 places in 1407 ms of which 12 ms to minimize.
[2024-05-31 21:44:32] [INFO ] Deduced a trap composed of 51 places in 1399 ms of which 11 ms to minimize.
[2024-05-31 21:44:33] [INFO ] Deduced a trap composed of 49 places in 1349 ms of which 11 ms to minimize.
[2024-05-31 21:44:35] [INFO ] Deduced a trap composed of 46 places in 1260 ms of which 10 ms to minimize.
SMT process timed out in 11148ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 609 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (214 resets) in 1881 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 83045 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 4
Probabilistic random walk after 83045 steps, saw 24872 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:44:39] [INFO ] Computed 42 invariants in 148 ms
[2024-05-31 21:44:39] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:44:39] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:44:39] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:44:41] [INFO ] Deduced a trap composed of 67 places in 1407 ms of which 10 ms to minimize.
[2024-05-31 21:44:41] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-05-31 21:44:42] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-31 21:44:42] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8285 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7352 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:44:48] [INFO ] Deduced a trap composed of 71 places in 1287 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6519/8360 variables, 1841/1890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 6394/8284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8360 variables, 4/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8360 variables, 0/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8362 variables, 2/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8362/8362 variables, and 8290 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9947 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 17514ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 226 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 229 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-31 21:44:57] [INFO ] Invariant cache hit.
[2024-05-31 21:44:59] [INFO ] Implicit Places using invariants in 1875 ms returned []
[2024-05-31 21:44:59] [INFO ] Invariant cache hit.
[2024-05-31 21:45:00] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-31 21:45:31] [INFO ] Performed 700/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:46:01] [INFO ] Performed 1622/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:46:08] [INFO ] Implicit Places using invariants and state equation in 69094 ms returned []
Implicit Place search using SMT with State Equation took 70971 ms to find 0 implicit places.
[2024-05-31 21:46:08] [INFO ] Redundant transitions in 515 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-31 21:46:09] [INFO ] Invariant cache hit.
[2024-05-31 21:46:09] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36117ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107899 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 p2 (NOT p3) p4)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 (NOT p3) p4)), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) p2 (NOT p3) p4)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3 p4))), (F (NOT p4)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p2), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 352 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 200 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:46:46] [INFO ] Computed 42 invariants in 133 ms
[2024-05-31 21:46:47] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2024-05-31 21:46:47] [INFO ] Invariant cache hit.
[2024-05-31 21:46:48] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:47:03] [INFO ] Implicit Places using invariants and state equation in 15925 ms returned []
Implicit Place search using SMT with State Equation took 17195 ms to find 0 implicit places.
[2024-05-31 21:47:03] [INFO ] Redundant transitions in 474 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:47:03] [INFO ] Invariant cache hit.
[2024-05-31 21:47:03] [INFO ] State equation strengthened by 4757 read => feed constraints.
(s1033 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 1.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0timeout
)
(s1034 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35345ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35394ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53280 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 163 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (196 resets) in 2621 ms. (15 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
[2024-05-31 21:47:40] [INFO ] Invariant cache hit.
[2024-05-31 21:47:40] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:47:40] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:47:42] [INFO ] Deduced a trap composed of 68 places in 1405 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1887 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 0/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/8366 variables, 2/6646 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6646 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 21:47:47] [INFO ] Deduced a trap composed of 49 places in 1373 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6521/8364 variables, 1843/1888 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 4757/6645 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8364 variables, 4/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8364 variables, 0/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8366 variables, 2/6651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8366/8366 variables, and 6651 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10089ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 610 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (217 resets) in 1904 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 83869 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 4
Probabilistic random walk after 83869 steps, saw 24978 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:47:54] [INFO ] Computed 42 invariants in 146 ms
[2024-05-31 21:47:54] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:47:55] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:47:55] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:47:57] [INFO ] Deduced a trap composed of 62 places in 1422 ms of which 11 ms to minimize.
[2024-05-31 21:47:58] [INFO ] Deduced a trap composed of 46 places in 1391 ms of which 11 ms to minimize.
[2024-05-31 21:48:00] [INFO ] Deduced a trap composed of 60 places in 1344 ms of which 11 ms to minimize.
[2024-05-31 21:48:01] [INFO ] Deduced a trap composed of 51 places in 1356 ms of which 10 ms to minimize.
[2024-05-31 21:48:02] [INFO ] Deduced a trap composed of 51 places in 1316 ms of which 11 ms to minimize.
[2024-05-31 21:48:04] [INFO ] Deduced a trap composed of 55 places in 1270 ms of which 10 ms to minimize.
[2024-05-31 21:48:05] [INFO ] Deduced a trap composed of 53 places in 1291 ms of which 10 ms to minimize.
[2024-05-31 21:48:06] [INFO ] Deduced a trap composed of 51 places in 1250 ms of which 10 ms to minimize.
[2024-05-31 21:48:08] [INFO ] Deduced a trap composed of 54 places in 1228 ms of which 11 ms to minimize.
[2024-05-31 21:48:09] [INFO ] Deduced a trap composed of 65 places in 1258 ms of which 10 ms to minimize.
[2024-05-31 21:48:10] [INFO ] Deduced a trap composed of 52 places in 1188 ms of which 10 ms to minimize.
[2024-05-31 21:48:11] [INFO ] Deduced a trap composed of 53 places in 1110 ms of which 9 ms to minimize.
[2024-05-31 21:48:12] [INFO ] Deduced a trap composed of 51 places in 1133 ms of which 10 ms to minimize.
[2024-05-31 21:48:13] [INFO ] Deduced a trap composed of 53 places in 1132 ms of which 9 ms to minimize.
[2024-05-31 21:48:15] [INFO ] Deduced a trap composed of 48 places in 1117 ms of which 9 ms to minimize.
[2024-05-31 21:48:16] [INFO ] Deduced a trap composed of 51 places in 1120 ms of which 9 ms to minimize.
[2024-05-31 21:48:17] [INFO ] Deduced a trap composed of 47 places in 1070 ms of which 9 ms to minimize.
[2024-05-31 21:48:18] [INFO ] Deduced a trap composed of 46 places in 1034 ms of which 9 ms to minimize.
[2024-05-31 21:48:19] [INFO ] Deduced a trap composed of 56 places in 1058 ms of which 9 ms to minimize.
[2024-05-31 21:48:20] [INFO ] Deduced a trap composed of 61 places in 1030 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:48:21] [INFO ] Deduced a trap composed of 55 places in 1004 ms of which 9 ms to minimize.
[2024-05-31 21:48:22] [INFO ] Deduced a trap composed of 64 places in 1033 ms of which 9 ms to minimize.
[2024-05-31 21:48:23] [INFO ] Deduced a trap composed of 57 places in 983 ms of which 9 ms to minimize.
[2024-05-31 21:48:24] [INFO ] Deduced a trap composed of 54 places in 985 ms of which 9 ms to minimize.
[2024-05-31 21:48:25] [INFO ] Deduced a trap composed of 55 places in 984 ms of which 8 ms to minimize.
[2024-05-31 21:48:26] [INFO ] Deduced a trap composed of 56 places in 985 ms of which 8 ms to minimize.
[2024-05-31 21:48:27] [INFO ] Deduced a trap composed of 55 places in 972 ms of which 9 ms to minimize.
[2024-05-31 21:48:28] [INFO ] Deduced a trap composed of 56 places in 984 ms of which 8 ms to minimize.
[2024-05-31 21:48:29] [INFO ] Deduced a trap composed of 53 places in 955 ms of which 8 ms to minimize.
[2024-05-31 21:48:30] [INFO ] Deduced a trap composed of 56 places in 974 ms of which 8 ms to minimize.
[2024-05-31 21:48:31] [INFO ] Deduced a trap composed of 61 places in 969 ms of which 8 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 47 places in 950 ms of which 9 ms to minimize.
[2024-05-31 21:48:33] [INFO ] Deduced a trap composed of 57 places in 954 ms of which 9 ms to minimize.
[2024-05-31 21:48:34] [INFO ] Deduced a trap composed of 63 places in 948 ms of which 9 ms to minimize.
[2024-05-31 21:48:35] [INFO ] Deduced a trap composed of 77 places in 889 ms of which 8 ms to minimize.
[2024-05-31 21:48:36] [INFO ] Deduced a trap composed of 54 places in 861 ms of which 8 ms to minimize.
[2024-05-31 21:48:37] [INFO ] Deduced a trap composed of 69 places in 881 ms of which 8 ms to minimize.
[2024-05-31 21:48:38] [INFO ] Deduced a trap composed of 52 places in 862 ms of which 8 ms to minimize.
[2024-05-31 21:48:39] [INFO ] Deduced a trap composed of 76 places in 778 ms of which 7 ms to minimize.
[2024-05-31 21:48:39] [INFO ] Deduced a trap composed of 49 places in 794 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:48:40] [INFO ] Deduced a trap composed of 65 places in 776 ms of which 6 ms to minimize.
SMT process timed out in 45987ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 214 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 211 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-31 21:48:41] [INFO ] Invariant cache hit.
[2024-05-31 21:48:43] [INFO ] Implicit Places using invariants in 1835 ms returned []
[2024-05-31 21:48:43] [INFO ] Invariant cache hit.
[2024-05-31 21:48:44] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-31 21:49:14] [INFO ] Performed 692/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:49:44] [INFO ] Performed 1683/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:49:49] [INFO ] Implicit Places using invariants and state equation in 66778 ms returned []
Implicit Place search using SMT with State Equation took 68618 ms to find 0 implicit places.
[2024-05-31 21:49:50] [INFO ] Redundant transitions in 511 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-31 21:49:50] [INFO ] Invariant cache hit.
[2024-05-31 21:49:50] [INFO ] State equation strengthened by 6394 read => feed constraints.

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="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-040, 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 r476-tall-171620505200124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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