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.r069-tall-171620503800116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CANInsertWithFailure-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 5.6M 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-030-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716392203089

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:36:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 15:36:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:36:44] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-05-22 15:36:44] [INFO ] Transformed 2164 places.
[2024-05-22 15:36:44] [INFO ] Transformed 5580 transitions.
[2024-05-22 15:36:44] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 403 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 3 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 276 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-22 15:36:45] [INFO ] Computed 32 invariants in 248 ms
[2024-05-22 15:36:46] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2024-05-22 15:36:46] [INFO ] Invariant cache hit.
[2024-05-22 15:36:48] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:37:01] [INFO ] Implicit Places using invariants and state equation in 14386 ms returned []
Implicit Place search using SMT with State Equation took 15825 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:37:01] [INFO ] Invariant cache hit.
[2024-05-22 15:37:01] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33623ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33696ms
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49861 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 42 out of 2163 places after structural reductions.
[2024-05-22 15:37:35] [INFO ] Flatten gal took : 255 ms
[2024-05-22 15:37:35] [INFO ] Flatten gal took : 156 ms
[2024-05-22 15:37:35] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 37 out of 2163 places (down from 42) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (55 resets) in 3639 ms. (10 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
[2024-05-22 15:37:36] [INFO ] Invariant cache hit.
[2024-05-22 15:37:36] [INFO ] State equation strengthened by 1770 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) 2100/2103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:37:37] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 14 ms to minimize.
[2024-05-22 15:37:37] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-22 15:37:37] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:37:37] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:37:37] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:37:37] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:37:37] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:37:38] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2103 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/2159 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:37:40] [INFO ] Deduced a trap composed of 59 places in 1379 ms of which 18 ms to minimize.
[2024-05-22 15:37:41] [INFO ] Deduced a trap composed of 53 places in 1259 ms of which 12 ms to minimize.
[2024-05-22 15:37:42] [INFO ] Deduced a trap composed of 65 places in 1236 ms of which 12 ms to minimize.
SMT process timed out in 6036ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 3 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2969 place count 1085 transition count 3689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2971 place count 1083 transition count 3689
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3901 place count 1083 transition count 3689
Applied a total of 3901 rules in 930 ms. Remains 1083 /2163 variables (removed 1080) and now considering 3689/5580 (removed 1891) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 931 ms. Remains : 1083/2163 places, 3689/5580 transitions.
RANDOM walk for 40000 steps (283 resets) in 1016 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 212920 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 212920 steps, saw 34255 distinct states, run finished after 3005 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 3689 rows 1083 cols
[2024-05-22 15:37:47] [INFO ] Computed 32 invariants in 50 ms
[2024-05-22 15:37:47] [INFO ] State equation strengthened by 3596 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) 1020/1023 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:37:47] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-22 15:37:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/1079 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:37:49] [INFO ] Deduced a trap composed of 43 places in 650 ms of which 6 ms to minimize.
[2024-05-22 15:37:50] [INFO ] Deduced a trap composed of 48 places in 590 ms of which 6 ms to minimize.
[2024-05-22 15:37:50] [INFO ] Deduced a trap composed of 35 places in 595 ms of which 7 ms to minimize.
[2024-05-22 15:37:51] [INFO ] Deduced a trap composed of 35 places in 520 ms of which 6 ms to minimize.
[2024-05-22 15:37:52] [INFO ] Deduced a trap composed of 39 places in 558 ms of which 6 ms to minimize.
[2024-05-22 15:37:52] [INFO ] Deduced a trap composed of 50 places in 546 ms of which 6 ms to minimize.
[2024-05-22 15:37:53] [INFO ] Deduced a trap composed of 48 places in 544 ms of which 5 ms to minimize.
[2024-05-22 15:37:53] [INFO ] Deduced a trap composed of 44 places in 503 ms of which 5 ms to minimize.
[2024-05-22 15:37:54] [INFO ] Deduced a trap composed of 43 places in 504 ms of which 5 ms to minimize.
[2024-05-22 15:37:54] [INFO ] Deduced a trap composed of 35 places in 512 ms of which 8 ms to minimize.
[2024-05-22 15:37:55] [INFO ] Deduced a trap composed of 42 places in 467 ms of which 5 ms to minimize.
[2024-05-22 15:37:55] [INFO ] Deduced a trap composed of 42 places in 486 ms of which 5 ms to minimize.
[2024-05-22 15:37:56] [INFO ] Deduced a trap composed of 45 places in 444 ms of which 6 ms to minimize.
[2024-05-22 15:37:56] [INFO ] Deduced a trap composed of 36 places in 409 ms of which 5 ms to minimize.
[2024-05-22 15:37:57] [INFO ] Deduced a trap composed of 40 places in 398 ms of which 4 ms to minimize.
[2024-05-22 15:37:57] [INFO ] Deduced a trap composed of 39 places in 341 ms of which 5 ms to minimize.
[2024-05-22 15:37:57] [INFO ] Deduced a trap composed of 42 places in 382 ms of which 5 ms to minimize.
[2024-05-22 15:37:58] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 5 ms to minimize.
[2024-05-22 15:37:58] [INFO ] Deduced a trap composed of 38 places in 378 ms of which 4 ms to minimize.
[2024-05-22 15:37:59] [INFO ] Deduced a trap composed of 39 places in 379 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:37:59] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 4 ms to minimize.
[2024-05-22 15:37:59] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 4 ms to minimize.
[2024-05-22 15:38:00] [INFO ] Deduced a trap composed of 40 places in 328 ms of which 4 ms to minimize.
[2024-05-22 15:38:00] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 4 ms to minimize.
[2024-05-22 15:38:00] [INFO ] Deduced a trap composed of 49 places in 299 ms of which 4 ms to minimize.
[2024-05-22 15:38:01] [INFO ] Deduced a trap composed of 49 places in 296 ms of which 4 ms to minimize.
[2024-05-22 15:38:01] [INFO ] Deduced a trap composed of 49 places in 270 ms of which 4 ms to minimize.
[2024-05-22 15:38:01] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 4 ms to minimize.
[2024-05-22 15:38:01] [INFO ] Deduced a trap composed of 48 places in 303 ms of which 4 ms to minimize.
[2024-05-22 15:38:02] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 5 ms to minimize.
[2024-05-22 15:38:02] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 4 ms to minimize.
[2024-05-22 15:38:02] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 4 ms to minimize.
[2024-05-22 15:38:03] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-05-22 15:38:03] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 3 ms to minimize.
[2024-05-22 15:38:03] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 3 ms to minimize.
[2024-05-22 15:38:03] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 3 ms to minimize.
[2024-05-22 15:38:04] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-05-22 15:38:04] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 3 ms to minimize.
[2024-05-22 15:38:04] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-05-22 15:38:04] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:38:04] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 3 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-22 15:38:07] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-22 15:38:07] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 3689/4770 variables, 1081/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4770 variables, 3596/4792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4770 variables, 0/4792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4772 variables, 2/4794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4772 variables, 0/4794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4772 variables, 0/4794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4772/4772 variables, and 4794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21324 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3596/3596 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 83/83 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) 1020/1023 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/1079 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 54/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:38:09] [INFO ] Deduced a trap composed of 41 places in 379 ms of which 4 ms to minimize.
[2024-05-22 15:38:09] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 4 ms to minimize.
[2024-05-22 15:38:10] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 4 ms to minimize.
[2024-05-22 15:38:10] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 4 ms to minimize.
[2024-05-22 15:38:10] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 3 ms to minimize.
[2024-05-22 15:38:10] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 3 ms to minimize.
[2024-05-22 15:38:11] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 3 ms to minimize.
[2024-05-22 15:38:11] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 3 ms to minimize.
[2024-05-22 15:38:11] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-05-22 15:38:11] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-22 15:38:12] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
[2024-05-22 15:38:12] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2024-05-22 15:38:12] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-05-22 15:38:12] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2024-05-22 15:38:12] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2024-05-22 15:38:12] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2024-05-22 15:38:13] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-05-22 15:38:13] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-22 15:38:13] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-22 15:38:13] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:38:13] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2024-05-22 15:38:13] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-22 15:38:13] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:38:14] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:38:15] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 14/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3689/4770 variables, 1081/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4770 variables, 3596/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4770 variables, 1/4827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4770 variables, 0/4827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4772 variables, 2/4829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4772 variables, 0/4829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4772 variables, 0/4829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4772/4772 variables, and 4829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8514 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3596/3596 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 117/117 constraints]
After SMT, in 29997ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3689/3689 transitions.
Applied a total of 0 rules in 72 ms. Remains 1083 /1083 variables (removed 0) and now considering 3689/3689 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1083/1083 places, 3689/3689 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3689/3689 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3689/3689 (removed 0) transitions.
[2024-05-22 15:38:17] [INFO ] Invariant cache hit.
[2024-05-22 15:38:18] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-05-22 15:38:18] [INFO ] Invariant cache hit.
[2024-05-22 15:38:19] [INFO ] State equation strengthened by 3596 read => feed constraints.
[2024-05-22 15:38:43] [INFO ] Implicit Places using invariants and state equation in 25017 ms returned []
Implicit Place search using SMT with State Equation took 25883 ms to find 0 implicit places.
[2024-05-22 15:38:43] [INFO ] Redundant transitions in 231 ms returned []
Running 3659 sub problems to find dead transitions.
[2024-05-22 15:38:43] [INFO ] Invariant cache hit.
[2024-05-22 15:38:43] [INFO ] State equation strengthened by 3596 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3659 unsolved
SMT process timed out in 32559ms, After SMT, problems are : Problem set: 0 solved, 3659 unsolved
Search for dead transitions found 0 dead transitions in 32597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58794 ms. Remains : 1083/1083 places, 3689/3689 transitions.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 122 stabilizing places and 210 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((G(p0) U !p1)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 56 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-22 15:39:16] [INFO ] Computed 32 invariants in 125 ms
[2024-05-22 15:39:17] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2024-05-22 15:39:17] [INFO ] Invariant cache hit.
[2024-05-22 15:39:19] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:39:33] [INFO ] Implicit Places using invariants and state equation in 16108 ms returned []
Implicit Place search using SMT with State Equation took 17158 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:39:33] [INFO ] Invariant cache hit.
[2024-05-22 15:39:33] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33522ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33567ms
Finished structural reductions in LTL mode , in 1 iterations and 50811 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 284 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 1019 ms.
Product exploration explored 100000 steps with 50000 reset in 938 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-01 finished in 53200 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(p2)||p1))||G(p3)))||p0)))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:40:09] [INFO ] Invariant cache hit.
[2024-05-22 15:40:10] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-05-22 15:40:10] [INFO ] Invariant cache hit.
[2024-05-22 15:40:12] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:40:27] [INFO ] Implicit Places using invariants and state equation in 16466 ms returned []
Implicit Place search using SMT with State Equation took 17386 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:40:27] [INFO ] Invariant cache hit.
[2024-05-22 15:40:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33432ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33489ms
Finished structural reductions in LTL mode , in 1 iterations and 50950 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 932 ms.
Product exploration explored 100000 steps with 50000 reset in 887 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X p0), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 9 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-02 finished in 53215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (G(p1)&&(!p1||F(!p0))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 59 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:41:02] [INFO ] Invariant cache hit.
[2024-05-22 15:41:03] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-22 15:41:03] [INFO ] Invariant cache hit.
[2024-05-22 15:41:05] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:41:19] [INFO ] Implicit Places using invariants and state equation in 15501 ms returned []
Implicit Place search using SMT with State Equation took 16374 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:41:19] [INFO ] Invariant cache hit.
[2024-05-22 15:41:19] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33125ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33172ms
Finished structural reductions in LTL mode , in 1 iterations and 49616 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) p0), true, (AND (NOT p1) (NOT p0)), (NOT p1), p0, true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-04 finished in 49956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:41:52] [INFO ] Invariant cache hit.
[2024-05-22 15:41:53] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-05-22 15:41:53] [INFO ] Invariant cache hit.
[2024-05-22 15:41:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:42:09] [INFO ] Implicit Places using invariants and state equation in 16148 ms returned []
Implicit Place search using SMT with State Equation took 17038 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:42:10] [INFO ] Invariant cache hit.
[2024-05-22 15:42:10] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33126ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33182ms
Finished structural reductions in LTL mode , in 1 iterations and 50294 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05
Product exploration explored 100000 steps with 141 reset in 558 ms.
Product exploration explored 100000 steps with 137 reset in 657 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 167 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (52 resets) in 595 ms. (67 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
[2024-05-22 15:42:45] [INFO ] Invariant cache hit.
[2024-05-22 15:42:45] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2099/2105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:42:45] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-22 15:42:45] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-22 15:42:45] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:42:46] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:42:47] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:42:47] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2105 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/2159 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2161 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5580/7741 variables, 2161/2207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/7741 variables, 1770/3977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7741 variables, 0/3977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/7743 variables, 2/3979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/7743 variables, 0/3979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/7743 variables, 0/3979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7743/7743 variables, and 3979 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4767 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2163/2163 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2099/2105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2105 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/2159 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2161 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5580/7741 variables, 2161/2207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7741/7743 variables, and 3977 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4834 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2161/2163 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 9694ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 266 ms.
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 2964 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 4 with 930 rules applied. Total rules applied 3897 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 3927 place count 1085 transition count 3691
Applied a total of 3927 rules in 666 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 667 ms. Remains : 1085/2163 places, 3691/5580 transitions.
RANDOM walk for 40000 steps (280 resets) in 1135 ms. (35 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 150049 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 3
Probabilistic random walk after 150049 steps, saw 28577 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-22 15:42:59] [INFO ] Computed 32 invariants in 49 ms
[2024-05-22 15:42:59] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:42:59] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2126 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:43:01] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:43:01] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
[2024-05-22 15:43:01] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:43:01] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:43:01] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-22 15:43:01] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:43:02] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4311 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 6548ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 67 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 63 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-22 15:43:06] [INFO ] Invariant cache hit.
[2024-05-22 15:43:07] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2024-05-22 15:43:07] [INFO ] Invariant cache hit.
[2024-05-22 15:43:07] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-22 15:43:25] [INFO ] Implicit Places using invariants and state equation in 18222 ms returned []
Implicit Place search using SMT with State Equation took 19276 ms to find 0 implicit places.
[2024-05-22 15:43:25] [INFO ] Redundant transitions in 195 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-22 15:43:25] [INFO ] Invariant cache hit.
[2024-05-22 15:43:25] [INFO ] State equation strengthened by 3564 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/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32357ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51947 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 9 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 54 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-22 15:43:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 15:43:58] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 15:43:58] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 15:43:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 15:43:58] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 15:43:58] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 15:43:58] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 188 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Applied a total of 2961 rules in 710 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-22 15:43:59] [INFO ] Computed 32 invariants in 54 ms
[2024-05-22 15:43:59] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-22 15:43:59] [INFO ] Invariant cache hit.
[2024-05-22 15:44:00] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-22 15:44:06] [INFO ] Implicit Places using invariants and state equation in 6891 ms returned []
Implicit Place search using SMT with State Equation took 7490 ms to find 0 implicit places.
[2024-05-22 15:44:06] [INFO ] Redundant transitions in 127 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 15:44:06] [INFO ] Invariant cache hit.
[2024-05-22 15:44:06] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32235ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1088/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40621 ms. Remains : 1088/2163 places, 3694/5580 transitions.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (250 resets) in 847 ms. (47 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
[2024-05-22 15:44:39] [INFO ] Invariant cache hit.
[2024-05-22 15:44:39] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:44:39] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:44:39] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:44:40] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:44:41] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:44:41] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:44:41] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4782/4782 variables, and 3809 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3265 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 3/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4782/4782 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2770 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 6067ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 250 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 1085/1088 places, 3691/3694 transitions.
RANDOM walk for 40000 steps (279 resets) in 916 ms. (43 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 144006 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 144006 steps, saw 27813 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-22 15:44:49] [INFO ] Computed 32 invariants in 46 ms
[2024-05-22 15:44:49] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:44:49] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:44:52] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:44:53] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:44:53] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:44:53] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4408 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 6811ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 69 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 68 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-22 15:44:56] [INFO ] Invariant cache hit.
[2024-05-22 15:44:57] [INFO ] Implicit Places using invariants in 919 ms returned []
[2024-05-22 15:44:57] [INFO ] Invariant cache hit.
[2024-05-22 15:44:58] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-22 15:45:16] [INFO ] Implicit Places using invariants and state equation in 18915 ms returned []
Implicit Place search using SMT with State Equation took 19841 ms to find 0 implicit places.
[2024-05-22 15:45:16] [INFO ] Redundant transitions in 136 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-22 15:45:16] [INFO ] Invariant cache hit.
[2024-05-22 15:45:16] [INFO ] State equation strengthened by 3564 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/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32765ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52869 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 20 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-22 15:45:49] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 15:45:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 15:45:49] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 15:45:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 15:45:49] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 15:45:49] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 15:45:49] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 127 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 640 reset in 800 ms.
Product exploration explored 100000 steps with 642 reset in 796 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 58 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-22 15:45:51] [INFO ] Computed 32 invariants in 53 ms
[2024-05-22 15:45:52] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-22 15:45:52] [INFO ] Invariant cache hit.
[2024-05-22 15:45:53] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-22 15:45:58] [INFO ] Implicit Places using invariants and state equation in 6673 ms returned []
Implicit Place search using SMT with State Equation took 7259 ms to find 0 implicit places.
[2024-05-22 15:45:59] [INFO ] Redundant transitions in 131 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 15:45:59] [INFO ] Invariant cache hit.
[2024-05-22 15:45:59] [INFO ] State equation strengthened by 2666 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31992ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32026ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39493 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 278527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 59 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-22 15:46:31] [INFO ] Computed 32 invariants in 118 ms
[2024-05-22 15:46:32] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-05-22 15:46:32] [INFO ] Invariant cache hit.
[2024-05-22 15:46:33] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:46:48] [INFO ] Implicit Places using invariants and state equation in 16291 ms returned []
Implicit Place search using SMT with State Equation took 17340 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:46:48] [INFO ] Invariant cache hit.
[2024-05-22 15:46:48] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.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 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 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 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.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 1.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.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 1.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.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 timeout
0.0)
(s982 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33549ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33606ms
Finished structural reductions in LTL mode , in 1 iterations and 51018 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-06 finished in 51142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 61 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:47:22] [INFO ] Invariant cache hit.
[2024-05-22 15:47:23] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-22 15:47:23] [INFO ] Invariant cache hit.
[2024-05-22 15:47:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:47:40] [INFO ] Implicit Places using invariants and state equation in 16663 ms returned []
Implicit Place search using SMT with State Equation took 17568 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:47:40] [INFO ] Invariant cache hit.
[2024-05-22 15:47:40] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33418ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33462ms
Finished structural reductions in LTL mode , in 1 iterations and 51103 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-09
Stuttering criterion allowed to conclude after 577 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-09 finished in 51213 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(F(p0))||(p1&&F(p2))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 64 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:48:13] [INFO ] Invariant cache hit.
[2024-05-22 15:48:14] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-22 15:48:14] [INFO ] Invariant cache hit.
[2024-05-22 15:48:16] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:48:29] [INFO ] Implicit Places using invariants and state equation in 15130 ms returned []
Implicit Place search using SMT with State Equation took 16022 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:48:29] [INFO ] Invariant cache hit.
[2024-05-22 15:48:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33268ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33316ms
Finished structural reductions in LTL mode , in 1 iterations and 49413 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-10
Stuttering criterion allowed to conclude after 562 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-10 finished in 49641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F((p1 U (G(p1)||(p1&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2))))))))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 56 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:49:03] [INFO ] Invariant cache hit.
[2024-05-22 15:49:04] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-05-22 15:49:04] [INFO ] Invariant cache hit.
[2024-05-22 15:49:05] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:49:20] [INFO ] Implicit Places using invariants and state equation in 16493 ms returned []
Implicit Place search using SMT with State Equation took 17419 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:49:20] [INFO ] Invariant cache hit.
[2024-05-22 15:49:20] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33260ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33306ms
Finished structural reductions in LTL mode , in 1 iterations and 50791 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-11
Stuttering criterion allowed to conclude after 917 steps with 2 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-11 finished in 51071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:49:54] [INFO ] Invariant cache hit.
[2024-05-22 15:49:55] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-22 15:49:55] [INFO ] Invariant cache hit.
[2024-05-22 15:49:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:50:10] [INFO ] Implicit Places using invariants and state equation in 15111 ms returned []
Implicit Place search using SMT with State Equation took 16028 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:50:10] [INFO ] Invariant cache hit.
[2024-05-22 15:50:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33221ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33268ms
Finished structural reductions in LTL mode , in 1 iterations and 49365 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-12 finished in 49486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 64 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-22 15:50:43] [INFO ] Invariant cache hit.
[2024-05-22 15:50:44] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-22 15:50:44] [INFO ] Invariant cache hit.
[2024-05-22 15:50:46] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:50:59] [INFO ] Implicit Places using invariants and state equation in 14842 ms returned []
Implicit Place search using SMT with State Equation took 15729 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:50:59] [INFO ] Invariant cache hit.
[2024-05-22 15:50:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33164ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33211ms
Finished structural reductions in LTL mode , in 1 iterations and 49012 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-13
Stuttering criterion allowed to conclude after 807 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-13 finished in 49207 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(X(!(F(p0) U !p1)))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Applied a total of 2967 rules in 350 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-22 15:51:33] [INFO ] Computed 32 invariants in 57 ms
[2024-05-22 15:51:34] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-22 15:51:34] [INFO ] Invariant cache hit.
[2024-05-22 15:51:34] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-22 15:51:41] [INFO ] Implicit Places using invariants and state equation in 7140 ms returned []
Implicit Place search using SMT with State Equation took 7757 ms to find 0 implicit places.
[2024-05-22 15:51:41] [INFO ] Redundant transitions in 145 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-22 15:51:41] [INFO ] Invariant cache hit.
[2024-05-22 15:51:41] [INFO ] State equation strengthened by 2667 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31835ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31865ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40134 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-14
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-14 finished in 40299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(!p0)))||G(p1)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 62 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-22 15:52:13] [INFO ] Computed 32 invariants in 124 ms
[2024-05-22 15:52:14] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2024-05-22 15:52:14] [INFO ] Invariant cache hit.
[2024-05-22 15:52:16] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:52:29] [INFO ] Implicit Places using invariants and state equation in 15175 ms returned []
Implicit Place search using SMT with State Equation took 16203 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-22 15:52:29] [INFO ] Invariant cache hit.
[2024-05-22 15:52:29] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33092ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33137ms
Finished structural reductions in LTL mode , in 1 iterations and 49408 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 242 ms :[p0, (NOT p1), (AND p0 (NOT p1)), true, true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-15
Stuttering criterion allowed to conclude after 698 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-15 finished in 49685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-030-LTLFireability-05
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Applied a total of 2961 rules in 331 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-22 15:53:03] [INFO ] Computed 32 invariants in 51 ms
[2024-05-22 15:53:04] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-22 15:53:04] [INFO ] Invariant cache hit.
[2024-05-22 15:53:05] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-22 15:53:10] [INFO ] Implicit Places using invariants and state equation in 6625 ms returned []
Implicit Place search using SMT with State Equation took 7231 ms to find 0 implicit places.
Running 3664 sub problems to find dead transitions.
[2024-05-22 15:53:11] [INFO ] Invariant cache hit.
[2024-05-22 15:53:11] [INFO ] State equation strengthened by 2666 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/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32060ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32099ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1088/2163 places, 3694/5580 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 39670 ms. Remains : 1088/2163 places, 3694/5580 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05
Product exploration explored 100000 steps with 638 reset in 682 ms.
Product exploration explored 100000 steps with 641 reset in 701 ms.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (255 resets) in 555 ms. (71 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
[2024-05-22 15:53:44] [INFO ] Invariant cache hit.
[2024-05-22 15:53:44] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:53:45] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 650 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 2 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4782/4782 variables, and 3809 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4241 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 3/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4782/4782 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2676 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 6952ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 265 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 1085/1088 places, 3691/3694 transitions.
RANDOM walk for 40000 steps (278 resets) in 1164 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 142789 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 142789 steps, saw 27678 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-22 15:53:55] [INFO ] Computed 32 invariants in 50 ms
[2024-05-22 15:53:55] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:53:56] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2389 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:53:58] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 2 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-22 15:53:59] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4583 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 7072ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 69 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 64 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-22 15:54:03] [INFO ] Invariant cache hit.
[2024-05-22 15:54:04] [INFO ] Implicit Places using invariants in 914 ms returned []
[2024-05-22 15:54:04] [INFO ] Invariant cache hit.
[2024-05-22 15:54:04] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-22 15:54:24] [INFO ] Implicit Places using invariants and state equation in 20105 ms returned []
Implicit Place search using SMT with State Equation took 21022 ms to find 0 implicit places.
[2024-05-22 15:54:24] [INFO ] Redundant transitions in 134 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-22 15:54:24] [INFO ] Invariant cache hit.
[2024-05-22 15:54:24] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32584ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32635ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53870 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 26 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-22 15:54:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 15:54:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 15:54:57] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 15:54:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 15:54:57] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 15:54:57] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 15:54:57] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 62 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-22 15:54:57] [INFO ] Computed 32 invariants in 51 ms
[2024-05-22 15:54:58] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-05-22 15:54:58] [INFO ] Invariant cache hit.
[2024-05-22 15:54:58] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-22 15:55:04] [INFO ] Implicit Places using invariants and state equation in 6324 ms returned []
Implicit Place search using SMT with State Equation took 6904 ms to find 0 implicit places.
[2024-05-22 15:55:04] [INFO ] Redundant transitions in 124 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 15:55:04] [INFO ] Invariant cache hit.
[2024-05-22 15:55:04] [INFO ] State equation strengthened by 2666 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31883ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 31916ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39023 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (256 resets) in 829 ms. (48 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2024-05-22 15:55:37] [INFO ] Invariant cache hit.
[2024-05-22 15:55:37] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 3 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-22 15:55:37] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-22 15:55:38] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4782/4782 variables, and 3809 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3574 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1030 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1030 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1030 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1084 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1084 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1086 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3694/4780 variables, 1086/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4780 variables, 2666/3807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4780 variables, 3/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4780 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4782 variables, 2/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4782 variables, 0/3812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4782/4782 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2803 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 2666/2666 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 6417ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 236 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 1085/1088 places, 3691/3694 transitions.
RANDOM walk for 40000 steps (279 resets) in 814 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 147529 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 3
Probabilistic random walk after 147529 steps, saw 28243 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-22 15:55:47] [INFO ] Computed 32 invariants in 47 ms
[2024-05-22 15:55:47] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:55:47] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 54/1081 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3691/4774 variables, 1083/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 3564/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 0/4680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4776 variables, 2/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4776 variables, 0/4682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4682 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2286 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1027 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:55:49] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:55:49] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 4 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:55:50] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/1081 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4774 variables, 1083/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3564/4699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4539 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3564/3564 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 6923ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 159 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 65 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 63 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-22 15:55:54] [INFO ] Invariant cache hit.
[2024-05-22 15:55:55] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-05-22 15:55:55] [INFO ] Invariant cache hit.
[2024-05-22 15:55:56] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2024-05-22 15:56:15] [INFO ] Implicit Places using invariants and state equation in 20494 ms returned []
Implicit Place search using SMT with State Equation took 21424 ms to find 0 implicit places.
[2024-05-22 15:56:16] [INFO ] Redundant transitions in 134 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-22 15:56:16] [INFO ] Invariant cache hit.
[2024-05-22 15:56:16] [INFO ] State equation strengthened by 3564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 32562ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 32591ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54223 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 0 ms
Free SCC test removed 924 places
Drop transitions (Empty/Sink Transition effects.) removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 8 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2024-05-22 15:56:48] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 15:56:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 15:56:48] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 15:56:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 15:56:48] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 15:56:48] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 15:56:48] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 110 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 640 reset in 763 ms.
Product exploration explored 100000 steps with 638 reset in 728 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 53 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2024-05-22 15:56:50] [INFO ] Computed 32 invariants in 48 ms
[2024-05-22 15:56:51] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-22 15:56:51] [INFO ] Invariant cache hit.
[2024-05-22 15:56:52] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-22 15:56:58] [INFO ] Implicit Places using invariants and state equation in 7049 ms returned []
Implicit Place search using SMT with State Equation took 7661 ms to find 0 implicit places.
[2024-05-22 15:56:58] [INFO ] Redundant transitions in 131 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 15:56:58] [INFO ] Invariant cache hit.
[2024-05-22 15:56:58] [INFO ] State equation strengthened by 2666 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/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31901ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 31936ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39796 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 267662 ms.
[2024-05-22 15:57:30] [INFO ] Flatten gal took : 143 ms
[2024-05-22 15:57:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 15:57:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2163 places, 5580 transitions and 14940 arcs took 23 ms.
Total runtime 1246679 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-030

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2163
TRANSITIONS: 5580
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.076s, Sys 0.014s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.017s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 2370
MODEL NAME: /home/mcc/execution/413/model
2163 places, 5580 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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
Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 ;