MCC'2024- Execution of r476-tall-171620505200123

About the Execution of LTSMin+red for CANInsertWithFailure-PT-040

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8101.136	3600000.00	4036572.00	9454.50	FFF?FTF??F?FFFF?	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717188371220

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:46:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:46:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:46:12] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2024-05-31 20:46:12] [INFO ] Transformed 3684 places.
[2024-05-31 20:46:12] [INFO ] Transformed 9840 transitions.
[2024-05-31 20:46:12] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 478 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 20:46:14] [INFO ] Computed 42 invariants in 461 ms
[2024-05-31 20:46:16] [INFO ] Implicit Places using invariants in 2844 ms returned []
[2024-05-31 20:46:16] [INFO ] Invariant cache hit.
[2024-05-31 20:46:19] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 20:46:50] [INFO ] Performed 385/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:46:59] [INFO ] Implicit Places using invariants and state equation in 42808 ms returned []
Implicit Place search using SMT with State Equation took 45679 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 20:46:59] [INFO ] Invariant cache hit.
[2024-05-31 20:46:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39768ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39866ms
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86087 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 48 out of 3683 places after structural reductions.
[2024-05-31 20:47:39] [INFO ] Flatten gal took : 405 ms
[2024-05-31 20:47:40] [INFO ] Flatten gal took : 244 ms
[2024-05-31 20:47:40] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 47 out of 3683 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (39 resets) in 1825 ms. (21 steps per ms) remains 12/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
[2024-05-31 20:47:41] [INFO ] Invariant cache hit.
[2024-05-31 20:47:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 3587/3605 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 74/3679 variables, 37/40 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13521 variables, 3160/6883 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 6883 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3585/3601 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 18 ms to minimize.
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 2 ms to minimize.
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-31 20:47:47] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:47:49] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:47:50] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3601/13523 variables, and 33 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 32/32 constraints]
After SMT, in 10136ms problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1476 Post agglomeration using F-continuation condition.Transition count delta: 1476
Deduced a syphon composed of 1476 places in 5 ms
Reduce places removed 1476 places and 0 transitions.
Iterating global reduction 3 with 2952 rules applied. Total rules applied 3512 place count 1927 transition count 8084
Drop transitions (Redundant composition of simpler transitions.) removed 1400 transitions
Redundant transition composition rules discarded 1400 transitions
Iterating global reduction 3 with 1400 rules applied. Total rules applied 4912 place count 1927 transition count 6684
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4914 place count 1927 transition count 6682
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4916 place count 1925 transition count 6682
Partial Free-agglomeration rule applied 1708 times.
Drop transitions (Partial Free agglomeration) removed 1708 transitions
Iterating global reduction 4 with 1708 rules applied. Total rules applied 6624 place count 1925 transition count 6682
Applied a total of 6624 rules in 1666 ms. Remains 1925 /3683 variables (removed 1758) and now considering 6682/9840 (removed 3158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1668 ms. Remains : 1925/3683 places, 6682/9840 transitions.
RANDOM walk for 40000 steps (201 resets) in 1200 ms. (33 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
// Phase 1: matrix 6682 rows 1925 cols
[2024-05-31 20:47:54] [INFO ] Computed 42 invariants in 163 ms
[2024-05-31 20:47:54] [INFO ] State equation strengthened by 6341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1831/1843 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1843 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 78/1921 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1921 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1923 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1923 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6682/8605 variables, 1923/1965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8605 variables, 6341/8306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8605 variables, 0/8306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8607 variables, 2/8308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8607 variables, 0/8308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8607 variables, 0/8308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8607/8607 variables, and 8308 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7231 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1925/1925 constraints, ReadFeed: 6341/6341 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1831/1843 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 3 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:48:01] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:48:02] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1843 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 2 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 2 ms to minimize.
[2024-05-31 20:48:03] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1843 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1843 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 78/1921 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1921 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/1923 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 67 places in 1603 ms of which 13 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1923 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1923 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 6682/8605 variables, 1923/2008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8605 variables, 6341/8349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8605 variables, 7/8356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8605/8607 variables, and 8356 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1923/1925 constraints, ReadFeed: 6341/6341 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 43/43 constraints]
After SMT, in 52523ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1925/1925 places, 6682/6682 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1922 transition count 6679
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 1922 transition count 6679
Applied a total of 7 rules in 458 ms. Remains 1922 /1925 variables (removed 3) and now considering 6679/6682 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 1922/1925 places, 6679/6682 transitions.
RANDOM walk for 40000 steps (203 resets) in 516 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 104683 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 7
Probabilistic random walk after 104683 steps, saw 31925 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 6679 rows 1922 cols
[2024-05-31 20:48:50] [INFO ] Computed 42 invariants in 153 ms
[2024-05-31 20:48:50] [INFO ] State equation strengthened by 6348 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1828/1840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1840 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 78/1918 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1918 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1920 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6679/8599 variables, 1920/1962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8599 variables, 6348/8310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8599 variables, 0/8310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8601 variables, 2/8312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8601 variables, 0/8312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8601 variables, 0/8312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8601/8601 variables, and 8312 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6821 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1922/1922 constraints, ReadFeed: 6348/6348 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1828/1840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:48:57] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 78/1918 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1918 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1920 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:48:59] [INFO ] Deduced a trap composed of 56 places in 1580 ms of which 12 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 52 places in 1461 ms of which 12 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1920 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 6679/8599 variables, 1920/1968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8599 variables, 6348/8316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8599 variables, 7/8323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8599 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/8601 variables, 2/8325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8601/8601 variables, and 8325 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75040 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1922/1922 constraints, ReadFeed: 6348/6348 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 82110ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6679/6679 transitions.
Applied a total of 0 rules in 177 ms. Remains 1922 /1922 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 1922/1922 places, 6679/6679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6679/6679 transitions.
Applied a total of 0 rules in 168 ms. Remains 1922 /1922 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
[2024-05-31 20:50:12] [INFO ] Invariant cache hit.
[2024-05-31 20:50:14] [INFO ] Implicit Places using invariants in 1952 ms returned []
[2024-05-31 20:50:14] [INFO ] Invariant cache hit.
[2024-05-31 20:50:16] [INFO ] State equation strengthened by 6348 read => feed constraints.
[2024-05-31 20:50:46] [INFO ] Performed 902/1922 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:51:08] [INFO ] Implicit Places using invariants and state equation in 54316 ms returned []
Implicit Place search using SMT with State Equation took 56270 ms to find 0 implicit places.
[2024-05-31 20:51:09] [INFO ] Redundant transitions in 620 ms returned []
Running 6639 sub problems to find dead transitions.
[2024-05-31 20:51:09] [INFO ] Invariant cache hit.
[2024-05-31 20:51:09] [INFO ] State equation strengthened by 6348 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.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 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1921 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6639 unsolved
SMT process timed out in 36805ms, After SMT, problems are : Problem set: 0 solved, 6639 unsolved
Search for dead transitions found 0 dead transitions in 36865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93948 ms. Remains : 1922/1922 places, 6679/6679 transitions.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1028 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-31 20:51:47] [INFO ] Computed 42 invariants in 236 ms
[2024-05-31 20:51:49] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2024-05-31 20:51:49] [INFO ] Invariant cache hit.
[2024-05-31 20:51:50] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 20:52:06] [INFO ] Implicit Places using invariants and state equation in 17040 ms returned []
Implicit Place search using SMT with State Equation took 18462 ms to find 0 implicit places.
[2024-05-31 20:52:07] [INFO ] Redundant transitions in 821 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 20:52:07] [INFO ] Invariant cache hit.
[2024-05-31 20:52:07] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 timeout
1.0)
(s101 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35031ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55426 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-00
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 15 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-00 finished in 55804 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)&&(p1||(p2&&X(X(p3)))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 196 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 20:52:43] [INFO ] Computed 42 invariants in 379 ms
[2024-05-31 20:52:45] [INFO ] Implicit Places using invariants in 2471 ms returned []
[2024-05-31 20:52:45] [INFO ] Invariant cache hit.
[2024-05-31 20:52:47] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 20:53:18] [INFO ] Performed 362/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:53:29] [INFO ] Implicit Places using invariants and state equation in 44803 ms returned []
Implicit Place search using SMT with State Equation took 47274 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 20:53:30] [INFO ] Invariant cache hit.
[2024-05-31 20:53:30] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38963ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39038ms
Finished structural reductions in LTL mode , in 1 iterations and 86535 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-01
Product exploration explored 100000 steps with 33478 reset in 1220 ms.
Product exploration explored 100000 steps with 33198 reset in 1105 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X p2), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 109 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (39 resets) in 642 ms. (62 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
[2024-05-31 20:54:12] [INFO ] Invariant cache hit.
[2024-05-31 20:54:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 78/3679 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13521 variables, 3160/6883 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13521 variables, 0/6883 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/13523 variables, 2/6885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13523 variables, 0/6885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/13523 variables, 0/6885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13523/13523 variables, and 6885 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3683/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:54:17] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:54:18] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:54:19] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:54:19] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:54:19] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:54:19] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:54:19] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:54:19] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-31 20:54:19] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3601/13523 variables, and 36 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 35/35 constraints]
After SMT, in 10080ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1637 times.
Drop transitions (Partial Free agglomeration) removed 1637 transitions
Iterating global reduction 3 with 1637 rules applied. Total rules applied 6798 place count 1843 transition count 6519
Applied a total of 6798 rules in 1112 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1113 ms. Remains : 1843/3683 places, 6519/9840 transitions.
RANDOM walk for 40000 steps (214 resets) in 709 ms. (56 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 20:54:24] [INFO ] Computed 42 invariants in 152 ms
[2024-05-31 20:54:24] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1761 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:54:24] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1761 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1761 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1839 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:54:26] [INFO ] Deduced a trap composed of 61 places in 1543 ms of which 11 ms to minimize.
[2024-05-31 20:54:27] [INFO ] Deduced a trap composed of 58 places in 1509 ms of which 11 ms to minimize.
[2024-05-31 20:54:29] [INFO ] Deduced a trap composed of 46 places in 1463 ms of which 11 ms to minimize.
[2024-05-31 20:54:30] [INFO ] Deduced a trap composed of 69 places in 1452 ms of which 11 ms to minimize.
[2024-05-31 20:54:32] [INFO ] Deduced a trap composed of 47 places in 1355 ms of which 11 ms to minimize.
[2024-05-31 20:54:33] [INFO ] Deduced a trap composed of 50 places in 1405 ms of which 12 ms to minimize.
[2024-05-31 20:54:34] [INFO ] Deduced a trap composed of 46 places in 1332 ms of which 11 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 56 places in 1293 ms of which 11 ms to minimize.
[2024-05-31 20:54:37] [INFO ] Deduced a trap composed of 54 places in 1266 ms of which 11 ms to minimize.
[2024-05-31 20:54:38] [INFO ] Deduced a trap composed of 58 places in 1309 ms of which 10 ms to minimize.
[2024-05-31 20:54:40] [INFO ] Deduced a trap composed of 58 places in 1312 ms of which 10 ms to minimize.
[2024-05-31 20:54:41] [INFO ] Deduced a trap composed of 54 places in 1216 ms of which 10 ms to minimize.
[2024-05-31 20:54:42] [INFO ] Deduced a trap composed of 48 places in 1248 ms of which 10 ms to minimize.
[2024-05-31 20:54:43] [INFO ] Deduced a trap composed of 50 places in 1220 ms of which 10 ms to minimize.
[2024-05-31 20:54:45] [INFO ] Deduced a trap composed of 61 places in 1213 ms of which 9 ms to minimize.
[2024-05-31 20:54:46] [INFO ] Deduced a trap composed of 53 places in 1132 ms of which 9 ms to minimize.
[2024-05-31 20:54:47] [INFO ] Deduced a trap composed of 51 places in 1147 ms of which 10 ms to minimize.
[2024-05-31 20:54:48] [INFO ] Deduced a trap composed of 53 places in 1113 ms of which 9 ms to minimize.
[2024-05-31 20:54:49] [INFO ] Deduced a trap composed of 51 places in 1182 ms of which 9 ms to minimize.
[2024-05-31 20:54:51] [INFO ] Deduced a trap composed of 47 places in 1195 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:54:52] [INFO ] Deduced a trap composed of 80 places in 1180 ms of which 10 ms to minimize.
[2024-05-31 20:54:53] [INFO ] Deduced a trap composed of 60 places in 1117 ms of which 9 ms to minimize.
[2024-05-31 20:54:54] [INFO ] Deduced a trap composed of 71 places in 1121 ms of which 9 ms to minimize.
[2024-05-31 20:54:55] [INFO ] Deduced a trap composed of 72 places in 1130 ms of which 9 ms to minimize.
[2024-05-31 20:54:56] [INFO ] Deduced a trap composed of 59 places in 1130 ms of which 10 ms to minimize.
[2024-05-31 20:54:58] [INFO ] Deduced a trap composed of 60 places in 1069 ms of which 8 ms to minimize.
[2024-05-31 20:54:59] [INFO ] Deduced a trap composed of 57 places in 1029 ms of which 9 ms to minimize.
[2024-05-31 20:55:00] [INFO ] Deduced a trap composed of 56 places in 1032 ms of which 8 ms to minimize.
[2024-05-31 20:55:01] [INFO ] Deduced a trap composed of 57 places in 1018 ms of which 8 ms to minimize.
[2024-05-31 20:55:02] [INFO ] Deduced a trap composed of 48 places in 991 ms of which 8 ms to minimize.
[2024-05-31 20:55:03] [INFO ] Deduced a trap composed of 48 places in 1026 ms of which 9 ms to minimize.
[2024-05-31 20:55:04] [INFO ] Deduced a trap composed of 47 places in 988 ms of which 9 ms to minimize.
[2024-05-31 20:55:05] [INFO ] Deduced a trap composed of 52 places in 987 ms of which 8 ms to minimize.
[2024-05-31 20:55:06] [INFO ] Deduced a trap composed of 59 places in 937 ms of which 8 ms to minimize.
[2024-05-31 20:55:07] [INFO ] Deduced a trap composed of 55 places in 935 ms of which 8 ms to minimize.
[2024-05-31 20:55:08] [INFO ] Deduced a trap composed of 67 places in 872 ms of which 7 ms to minimize.
[2024-05-31 20:55:09] [INFO ] Deduced a trap composed of 67 places in 870 ms of which 7 ms to minimize.
SMT process timed out in 45271ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1842 transition count 6518
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 1842 transition count 6518
Applied a total of 5 rules in 444 ms. Remains 1842 /1843 variables (removed 1) and now considering 6518/6519 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 1842/1843 places, 6518/6519 transitions.
RANDOM walk for 40000 steps (214 resets) in 507 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107965 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107965 steps, saw 28471 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6518 rows 1842 cols
[2024-05-31 20:55:12] [INFO ] Computed 42 invariants in 163 ms
[2024-05-31 20:55:13] [INFO ] State equation strengthened by 6398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1759/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:55:13] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:55:14] [INFO ] Deduced a trap composed of 53 places in 1408 ms of which 11 ms to minimize.
[2024-05-31 20:55:16] [INFO ] Deduced a trap composed of 49 places in 1457 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6518/8358 variables, 1840/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8358 variables, 6398/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8358 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8360 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8360 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8360 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8360/8360 variables, and 8285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5826 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6398/6398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1759/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:55:19] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 2 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:55:23] [INFO ] Deduced a trap composed of 67 places in 1464 ms of which 11 ms to minimize.
[2024-05-31 20:55:24] [INFO ] Deduced a trap composed of 51 places in 1465 ms of which 11 ms to minimize.
[2024-05-31 20:55:26] [INFO ] Deduced a trap composed of 46 places in 1425 ms of which 11 ms to minimize.
[2024-05-31 20:55:27] [INFO ] Deduced a trap composed of 61 places in 1473 ms of which 11 ms to minimize.
[2024-05-31 20:55:29] [INFO ] Deduced a trap composed of 73 places in 1490 ms of which 11 ms to minimize.
[2024-05-31 20:55:30] [INFO ] Deduced a trap composed of 76 places in 1504 ms of which 11 ms to minimize.
[2024-05-31 20:55:32] [INFO ] Deduced a trap composed of 45 places in 1440 ms of which 12 ms to minimize.
[2024-05-31 20:55:33] [INFO ] Deduced a trap composed of 49 places in 1384 ms of which 11 ms to minimize.
[2024-05-31 20:55:35] [INFO ] Deduced a trap composed of 79 places in 1516 ms of which 12 ms to minimize.
[2024-05-31 20:55:36] [INFO ] Deduced a trap composed of 51 places in 1437 ms of which 11 ms to minimize.
[2024-05-31 20:55:38] [INFO ] Deduced a trap composed of 48 places in 1456 ms of which 11 ms to minimize.
[2024-05-31 20:55:39] [INFO ] Deduced a trap composed of 55 places in 1429 ms of which 11 ms to minimize.
[2024-05-31 20:55:40] [INFO ] Deduced a trap composed of 47 places in 1425 ms of which 11 ms to minimize.
[2024-05-31 20:55:42] [INFO ] Deduced a trap composed of 55 places in 1449 ms of which 11 ms to minimize.
[2024-05-31 20:55:43] [INFO ] Deduced a trap composed of 50 places in 1384 ms of which 11 ms to minimize.
[2024-05-31 20:55:45] [INFO ] Deduced a trap composed of 47 places in 1446 ms of which 11 ms to minimize.
[2024-05-31 20:55:46] [INFO ] Deduced a trap composed of 55 places in 1468 ms of which 30 ms to minimize.
[2024-05-31 20:55:48] [INFO ] Deduced a trap composed of 57 places in 1466 ms of which 10 ms to minimize.
[2024-05-31 20:55:49] [INFO ] Deduced a trap composed of 81 places in 1341 ms of which 11 ms to minimize.
[2024-05-31 20:55:51] [INFO ] Deduced a trap composed of 51 places in 1433 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:55:52] [INFO ] Deduced a trap composed of 130 places in 1512 ms of which 11 ms to minimize.
[2024-05-31 20:55:54] [INFO ] Deduced a trap composed of 56 places in 1487 ms of which 11 ms to minimize.
[2024-05-31 20:55:55] [INFO ] Deduced a trap composed of 52 places in 1492 ms of which 11 ms to minimize.
[2024-05-31 20:55:57] [INFO ] Deduced a trap composed of 50 places in 1490 ms of which 11 ms to minimize.
[2024-05-31 20:55:58] [INFO ] Deduced a trap composed of 45 places in 1445 ms of which 10 ms to minimize.
[2024-05-31 20:56:00] [INFO ] Deduced a trap composed of 47 places in 1456 ms of which 11 ms to minimize.
[2024-05-31 20:56:01] [INFO ] Deduced a trap composed of 57 places in 1335 ms of which 11 ms to minimize.
[2024-05-31 20:56:03] [INFO ] Deduced a trap composed of 49 places in 1479 ms of which 11 ms to minimize.
[2024-05-31 20:56:04] [INFO ] Deduced a trap composed of 47 places in 1412 ms of which 11 ms to minimize.
[2024-05-31 20:56:05] [INFO ] Deduced a trap composed of 45 places in 1420 ms of which 10 ms to minimize.
[2024-05-31 20:56:07] [INFO ] Deduced a trap composed of 55 places in 1454 ms of which 11 ms to minimize.
[2024-05-31 20:56:08] [INFO ] Deduced a trap composed of 53 places in 1501 ms of which 12 ms to minimize.
[2024-05-31 20:56:10] [INFO ] Deduced a trap composed of 52 places in 1433 ms of which 11 ms to minimize.
[2024-05-31 20:56:11] [INFO ] Deduced a trap composed of 50 places in 1422 ms of which 11 ms to minimize.
[2024-05-31 20:56:13] [INFO ] Deduced a trap composed of 48 places in 1408 ms of which 11 ms to minimize.
[2024-05-31 20:56:14] [INFO ] Deduced a trap composed of 80 places in 1464 ms of which 11 ms to minimize.
[2024-05-31 20:56:16] [INFO ] Deduced a trap composed of 79 places in 1449 ms of which 11 ms to minimize.
[2024-05-31 20:56:17] [INFO ] Deduced a trap composed of 50 places in 1547 ms of which 11 ms to minimize.
[2024-05-31 20:56:19] [INFO ] Deduced a trap composed of 61 places in 1481 ms of which 11 ms to minimize.
[2024-05-31 20:56:20] [INFO ] Deduced a trap composed of 45 places in 1422 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1840 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:56:22] [INFO ] Deduced a trap composed of 59 places in 1358 ms of which 11 ms to minimize.
[2024-05-31 20:56:23] [INFO ] Deduced a trap composed of 58 places in 1429 ms of which 11 ms to minimize.
[2024-05-31 20:56:25] [INFO ] Deduced a trap composed of 45 places in 1386 ms of which 13 ms to minimize.
[2024-05-31 20:56:26] [INFO ] Deduced a trap composed of 45 places in 1316 ms of which 11 ms to minimize.
[2024-05-31 20:56:27] [INFO ] Deduced a trap composed of 64 places in 1350 ms of which 10 ms to minimize.
[2024-05-31 20:56:29] [INFO ] Deduced a trap composed of 61 places in 1312 ms of which 11 ms to minimize.
[2024-05-31 20:56:30] [INFO ] Deduced a trap composed of 62 places in 1340 ms of which 10 ms to minimize.
[2024-05-31 20:56:31] [INFO ] Deduced a trap composed of 56 places in 1318 ms of which 10 ms to minimize.
[2024-05-31 20:56:33] [INFO ] Deduced a trap composed of 55 places in 1319 ms of which 11 ms to minimize.
[2024-05-31 20:56:34] [INFO ] Deduced a trap composed of 56 places in 1291 ms of which 10 ms to minimize.
SMT process timed out in 81790ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6518/6518 transitions.
Applied a total of 0 rules in 171 ms. Remains 1842 /1842 variables (removed 0) and now considering 6518/6518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 1842/1842 places, 6518/6518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6518/6518 transitions.
Applied a total of 0 rules in 173 ms. Remains 1842 /1842 variables (removed 0) and now considering 6518/6518 (removed 0) transitions.
[2024-05-31 20:56:34] [INFO ] Invariant cache hit.
[2024-05-31 20:56:36] [INFO ] Implicit Places using invariants in 1892 ms returned []
[2024-05-31 20:56:36] [INFO ] Invariant cache hit.
[2024-05-31 20:56:38] [INFO ] State equation strengthened by 6398 read => feed constraints.
[2024-05-31 20:57:08] [INFO ] Performed 666/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:57:38] [INFO ] Performed 1562/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 20:57:47] [INFO ] Implicit Places using invariants and state equation in 70484 ms returned []
Implicit Place search using SMT with State Equation took 72378 ms to find 0 implicit places.
[2024-05-31 20:57:47] [INFO ] Redundant transitions in 527 ms returned []
Running 6478 sub problems to find dead transitions.
[2024-05-31 20:57:47] [INFO ] Invariant cache hit.
[2024-05-31 20:57:47] [INFO ] State equation strengthened by 6398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6478 unsolved
SMT process timed out in 36421ms, After SMT, problems are : Problem set: 0 solved, 6478 unsolved
Search for dead transitions found 0 dead transitions in 36476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109581 ms. Remains : 1842/1842 places, 6518/6518 transitions.
Knowledge obtained : [(AND p1 p2 p0 p3), (X p2), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0))))
Knowledge based reduction with 16 factoid took 132 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-01 finished in 342027 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))||F((!p0&&X((F(p2)||G(!p0))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 194 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 20:58:25] [INFO ] Computed 42 invariants in 379 ms
[2024-05-31 20:58:27] [INFO ] Implicit Places using invariants in 2457 ms returned []
[2024-05-31 20:58:27] [INFO ] Invariant cache hit.
[2024-05-31 20:58:30] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 20:59:00] [INFO ] Performed 357/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 20:59:12] [INFO ] Implicit Places using invariants and state equation in 45438 ms returned []
Implicit Place search using SMT with State Equation took 47896 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 20:59:12] [INFO ] Invariant cache hit.
[2024-05-31 20:59:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39317ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39397ms
Finished structural reductions in LTL mode , in 1 iterations and 87506 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-03
Product exploration explored 100000 steps with 103 reset in 808 ms.
Product exploration explored 100000 steps with 102 reset in 959 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 173 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (40 resets) in 559 ms. (71 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
[2024-05-31 20:59:54] [INFO ] Invariant cache hit.
[2024-05-31 20:59:54] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:59:55] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:59:55] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:59:55] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:59:55] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:59:55] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:59:55] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:59:56] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-31 20:59:56] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:59:56] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:59:56] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-31 20:59:56] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:59:56] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:59:57] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:59:58] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:59:59] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3601/13523 variables, and 33 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-31 21:00:00] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3601 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3601 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 78/3679 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3679 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3681 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:00:05] [INFO ] Deduced a trap composed of 87 places in 3700 ms of which 24 ms to minimize.
SMT process timed out in 10926ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1127 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1127 ms. Remains : 1845/3683 places, 6523/9840 transitions.
RANDOM walk for 40000 steps (215 resets) in 971 ms. (41 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-31 21:00:07] [INFO ] Computed 42 invariants in 153 ms
[2024-05-31 21:00:07] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2622 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:00:10] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:00:11] [INFO ] Deduced a trap composed of 68 places in 1513 ms of which 12 ms to minimize.
[2024-05-31 21:00:13] [INFO ] Deduced a trap composed of 54 places in 1402 ms of which 10 ms to minimize.
[2024-05-31 21:00:14] [INFO ] Deduced a trap composed of 49 places in 1433 ms of which 11 ms to minimize.
[2024-05-31 21:00:16] [INFO ] Deduced a trap composed of 47 places in 1374 ms of which 11 ms to minimize.
[2024-05-31 21:00:17] [INFO ] Deduced a trap composed of 53 places in 1348 ms of which 11 ms to minimize.
[2024-05-31 21:00:19] [INFO ] Deduced a trap composed of 51 places in 1366 ms of which 11 ms to minimize.
[2024-05-31 21:00:20] [INFO ] Deduced a trap composed of 45 places in 1307 ms of which 10 ms to minimize.
[2024-05-31 21:00:21] [INFO ] Deduced a trap composed of 53 places in 1293 ms of which 10 ms to minimize.
[2024-05-31 21:00:23] [INFO ] Deduced a trap composed of 53 places in 1257 ms of which 10 ms to minimize.
[2024-05-31 21:00:24] [INFO ] Deduced a trap composed of 58 places in 1187 ms of which 9 ms to minimize.
[2024-05-31 21:00:25] [INFO ] Deduced a trap composed of 64 places in 1157 ms of which 10 ms to minimize.
[2024-05-31 21:00:26] [INFO ] Deduced a trap composed of 55 places in 1130 ms of which 9 ms to minimize.
[2024-05-31 21:00:27] [INFO ] Deduced a trap composed of 60 places in 1149 ms of which 10 ms to minimize.
[2024-05-31 21:00:28] [INFO ] Deduced a trap composed of 52 places in 1166 ms of which 10 ms to minimize.
[2024-05-31 21:00:30] [INFO ] Deduced a trap composed of 63 places in 1210 ms of which 9 ms to minimize.
[2024-05-31 21:00:31] [INFO ] Deduced a trap composed of 61 places in 1130 ms of which 9 ms to minimize.
[2024-05-31 21:00:32] [INFO ] Deduced a trap composed of 46 places in 1153 ms of which 9 ms to minimize.
[2024-05-31 21:00:33] [INFO ] Deduced a trap composed of 53 places in 1109 ms of which 9 ms to minimize.
[2024-05-31 21:00:34] [INFO ] Deduced a trap composed of 47 places in 1072 ms of which 9 ms to minimize.
[2024-05-31 21:00:35] [INFO ] Deduced a trap composed of 48 places in 1052 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:00:36] [INFO ] Deduced a trap composed of 46 places in 1092 ms of which 9 ms to minimize.
[2024-05-31 21:00:38] [INFO ] Deduced a trap composed of 45 places in 1114 ms of which 9 ms to minimize.
[2024-05-31 21:00:39] [INFO ] Deduced a trap composed of 51 places in 1111 ms of which 9 ms to minimize.
[2024-05-31 21:00:40] [INFO ] Deduced a trap composed of 48 places in 1097 ms of which 9 ms to minimize.
[2024-05-31 21:00:41] [INFO ] Deduced a trap composed of 47 places in 1074 ms of which 9 ms to minimize.
[2024-05-31 21:00:42] [INFO ] Deduced a trap composed of 47 places in 1102 ms of which 9 ms to minimize.
[2024-05-31 21:00:43] [INFO ] Deduced a trap composed of 53 places in 1030 ms of which 9 ms to minimize.
[2024-05-31 21:00:44] [INFO ] Deduced a trap composed of 60 places in 1100 ms of which 9 ms to minimize.
[2024-05-31 21:00:45] [INFO ] Deduced a trap composed of 49 places in 1076 ms of which 9 ms to minimize.
[2024-05-31 21:00:46] [INFO ] Deduced a trap composed of 48 places in 1058 ms of which 9 ms to minimize.
[2024-05-31 21:00:48] [INFO ] Deduced a trap composed of 48 places in 1046 ms of which 9 ms to minimize.
[2024-05-31 21:00:49] [INFO ] Deduced a trap composed of 50 places in 936 ms of which 8 ms to minimize.
[2024-05-31 21:00:50] [INFO ] Deduced a trap composed of 47 places in 981 ms of which 9 ms to minimize.
[2024-05-31 21:00:51] [INFO ] Deduced a trap composed of 46 places in 976 ms of which 8 ms to minimize.
[2024-05-31 21:00:52] [INFO ] Deduced a trap composed of 47 places in 996 ms of which 8 ms to minimize.
[2024-05-31 21:00:53] [INFO ] Deduced a trap composed of 50 places in 977 ms of which 8 ms to minimize.
[2024-05-31 21:00:54] [INFO ] Deduced a trap composed of 46 places in 944 ms of which 8 ms to minimize.
[2024-05-31 21:00:54] [INFO ] Deduced a trap composed of 72 places in 903 ms of which 8 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1843/8368 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1845 constraints, ReadFeed: 0/6393 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 47857ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 179 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 1845/1845 places, 6523/6523 transitions.
RANDOM walk for 40000 steps (215 resets) in 529 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 105534 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 105534 steps, saw 28205 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-31 21:00:58] [INFO ] Invariant cache hit.
[2024-05-31 21:00:58] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2679 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:01:01] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:01:03] [INFO ] Deduced a trap composed of 96 places in 1476 ms of which 12 ms to minimize.
[2024-05-31 21:01:04] [INFO ] Deduced a trap composed of 90 places in 1544 ms of which 12 ms to minimize.
[2024-05-31 21:01:06] [INFO ] Deduced a trap composed of 80 places in 1565 ms of which 12 ms to minimize.
[2024-05-31 21:01:07] [INFO ] Deduced a trap composed of 71 places in 1525 ms of which 12 ms to minimize.
[2024-05-31 21:01:09] [INFO ] Deduced a trap composed of 66 places in 1534 ms of which 12 ms to minimize.
[2024-05-31 21:01:10] [INFO ] Deduced a trap composed of 52 places in 1472 ms of which 12 ms to minimize.
[2024-05-31 21:01:12] [INFO ] Deduced a trap composed of 50 places in 1475 ms of which 12 ms to minimize.
[2024-05-31 21:01:13] [INFO ] Deduced a trap composed of 53 places in 1421 ms of which 11 ms to minimize.
[2024-05-31 21:01:15] [INFO ] Deduced a trap composed of 57 places in 1520 ms of which 11 ms to minimize.
[2024-05-31 21:01:16] [INFO ] Deduced a trap composed of 59 places in 1466 ms of which 10 ms to minimize.
[2024-05-31 21:01:18] [INFO ] Deduced a trap composed of 56 places in 1461 ms of which 10 ms to minimize.
[2024-05-31 21:01:19] [INFO ] Deduced a trap composed of 50 places in 1429 ms of which 11 ms to minimize.
[2024-05-31 21:01:21] [INFO ] Deduced a trap composed of 50 places in 1372 ms of which 10 ms to minimize.
[2024-05-31 21:01:22] [INFO ] Deduced a trap composed of 50 places in 1380 ms of which 11 ms to minimize.
[2024-05-31 21:01:24] [INFO ] Deduced a trap composed of 49 places in 1413 ms of which 11 ms to minimize.
[2024-05-31 21:01:25] [INFO ] Deduced a trap composed of 51 places in 1424 ms of which 10 ms to minimize.
[2024-05-31 21:01:26] [INFO ] Deduced a trap composed of 60 places in 1427 ms of which 11 ms to minimize.
[2024-05-31 21:01:28] [INFO ] Deduced a trap composed of 55 places in 1446 ms of which 11 ms to minimize.
[2024-05-31 21:01:29] [INFO ] Deduced a trap composed of 48 places in 1382 ms of which 11 ms to minimize.
[2024-05-31 21:01:31] [INFO ] Deduced a trap composed of 59 places in 1267 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:01:32] [INFO ] Deduced a trap composed of 60 places in 1317 ms of which 10 ms to minimize.
[2024-05-31 21:01:33] [INFO ] Deduced a trap composed of 68 places in 1263 ms of which 9 ms to minimize.
[2024-05-31 21:01:35] [INFO ] Deduced a trap composed of 81 places in 1330 ms of which 10 ms to minimize.
[2024-05-31 21:01:36] [INFO ] Deduced a trap composed of 47 places in 1264 ms of which 10 ms to minimize.
[2024-05-31 21:01:37] [INFO ] Deduced a trap composed of 74 places in 1279 ms of which 10 ms to minimize.
[2024-05-31 21:01:39] [INFO ] Deduced a trap composed of 64 places in 1272 ms of which 10 ms to minimize.
[2024-05-31 21:01:40] [INFO ] Deduced a trap composed of 60 places in 1319 ms of which 11 ms to minimize.
[2024-05-31 21:01:41] [INFO ] Deduced a trap composed of 52 places in 1276 ms of which 10 ms to minimize.
[2024-05-31 21:01:43] [INFO ] Deduced a trap composed of 48 places in 1298 ms of which 10 ms to minimize.
[2024-05-31 21:01:44] [INFO ] Deduced a trap composed of 52 places in 1279 ms of which 10 ms to minimize.
[2024-05-31 21:01:45] [INFO ] Deduced a trap composed of 46 places in 1295 ms of which 10 ms to minimize.
[2024-05-31 21:01:47] [INFO ] Deduced a trap composed of 55 places in 1292 ms of which 11 ms to minimize.
[2024-05-31 21:01:48] [INFO ] Deduced a trap composed of 50 places in 1245 ms of which 10 ms to minimize.
[2024-05-31 21:01:49] [INFO ] Deduced a trap composed of 49 places in 1285 ms of which 10 ms to minimize.
[2024-05-31 21:01:50] [INFO ] Deduced a trap composed of 46 places in 1189 ms of which 10 ms to minimize.
[2024-05-31 21:01:52] [INFO ] Deduced a trap composed of 65 places in 1235 ms of which 10 ms to minimize.
[2024-05-31 21:01:53] [INFO ] Deduced a trap composed of 49 places in 1158 ms of which 10 ms to minimize.
[2024-05-31 21:01:54] [INFO ] Deduced a trap composed of 51 places in 1158 ms of which 10 ms to minimize.
[2024-05-31 21:01:55] [INFO ] Deduced a trap composed of 48 places in 1175 ms of which 10 ms to minimize.
[2024-05-31 21:01:56] [INFO ] Deduced a trap composed of 58 places in 1169 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:01:58] [INFO ] Deduced a trap composed of 60 places in 1139 ms of which 9 ms to minimize.
[2024-05-31 21:01:59] [INFO ] Deduced a trap composed of 62 places in 1108 ms of which 9 ms to minimize.
[2024-05-31 21:02:00] [INFO ] Deduced a trap composed of 53 places in 1073 ms of which 9 ms to minimize.
[2024-05-31 21:02:01] [INFO ] Deduced a trap composed of 57 places in 1089 ms of which 9 ms to minimize.
[2024-05-31 21:02:02] [INFO ] Deduced a trap composed of 55 places in 1053 ms of which 9 ms to minimize.
[2024-05-31 21:02:03] [INFO ] Deduced a trap composed of 55 places in 1097 ms of which 9 ms to minimize.
[2024-05-31 21:02:04] [INFO ] Deduced a trap composed of 67 places in 1076 ms of which 9 ms to minimize.
[2024-05-31 21:02:05] [INFO ] Deduced a trap composed of 62 places in 1062 ms of which 9 ms to minimize.
[2024-05-31 21:02:06] [INFO ] Deduced a trap composed of 61 places in 1068 ms of which 9 ms to minimize.
[2024-05-31 21:02:08] [INFO ] Deduced a trap composed of 50 places in 1149 ms of which 9 ms to minimize.
[2024-05-31 21:02:09] [INFO ] Deduced a trap composed of 51 places in 1101 ms of which 9 ms to minimize.
[2024-05-31 21:02:10] [INFO ] Deduced a trap composed of 51 places in 1101 ms of which 9 ms to minimize.
[2024-05-31 21:02:11] [INFO ] Deduced a trap composed of 51 places in 1067 ms of which 9 ms to minimize.
[2024-05-31 21:02:12] [INFO ] Deduced a trap composed of 67 places in 1069 ms of which 9 ms to minimize.
[2024-05-31 21:02:13] [INFO ] Deduced a trap composed of 68 places in 1101 ms of which 9 ms to minimize.
[2024-05-31 21:02:14] [INFO ] Deduced a trap composed of 53 places in 1072 ms of which 10 ms to minimize.
[2024-05-31 21:02:15] [INFO ] Deduced a trap composed of 52 places in 1057 ms of which 9 ms to minimize.
[2024-05-31 21:02:16] [INFO ] Deduced a trap composed of 48 places in 953 ms of which 8 ms to minimize.
SMT process timed out in 78434ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 166 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 173 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-31 21:02:17] [INFO ] Invariant cache hit.
[2024-05-31 21:02:18] [INFO ] Implicit Places using invariants in 1842 ms returned []
[2024-05-31 21:02:18] [INFO ] Invariant cache hit.
[2024-05-31 21:02:20] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-31 21:02:50] [INFO ] Performed 855/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:03:16] [INFO ] Implicit Places using invariants and state equation in 57530 ms returned []
Implicit Place search using SMT with State Equation took 59375 ms to find 0 implicit places.
[2024-05-31 21:03:17] [INFO ] Redundant transitions in 509 ms returned []
Running 6483 sub problems to find dead transitions.
[2024-05-31 21:03:17] [INFO ] Invariant cache hit.
[2024-05-31 21:03:17] [INFO ] State equation strengthened by 6393 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6483 unsolved
SMT process timed out in 36109ms, After SMT, problems are : Problem set: 0 solved, 6483 unsolved
Search for dead transitions found 0 dead transitions in 36163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96249 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 21 factoid took 363 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 198 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:03:54] [INFO ] Computed 42 invariants in 400 ms
[2024-05-31 21:03:56] [INFO ] Implicit Places using invariants in 2569 ms returned []
[2024-05-31 21:03:56] [INFO ] Invariant cache hit.
[2024-05-31 21:03:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:04:30] [INFO ] Performed 371/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:04:41] [INFO ] Implicit Places using invariants and state equation in 44298 ms returned []
Implicit Place search using SMT with State Equation took 46874 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:04:41] [INFO ] Invariant cache hit.
[2024-05-31 21:04:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39239ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39323ms
Finished structural reductions in LTL mode , in 1 iterations and 86424 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 124 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (41 resets) in 363 ms. (109 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 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-31 21:05:20] [INFO ] Invariant cache hit.
[2024-05-31 21:05:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/3679 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13521 variables, 3160/6883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13521 variables, 0/6883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/13523 variables, 2/6885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13523 variables, 0/6885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/13523 variables, 0/6885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13523/13523 variables, and 6885 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4098 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3683/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:05:25] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-31 21:05:25] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3601 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 78/3679 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:05:28] [INFO ] Deduced a trap composed of 81 places in 1645 ms of which 12 ms to minimize.
[2024-05-31 21:05:29] [INFO ] Deduced a trap composed of 64 places in 1442 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3681 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3681/13523 variables, and 46 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 9154ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1124 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1124 ms. Remains : 1845/3683 places, 6523/9840 transitions.
RANDOM walk for 40000 steps (213 resets) in 824 ms. (48 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-31 21:05:31] [INFO ] Computed 42 invariants in 146 ms
[2024-05-31 21:05:31] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2519 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:05:34] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:05:36] [INFO ] Deduced a trap composed of 76 places in 1488 ms of which 11 ms to minimize.
[2024-05-31 21:05:37] [INFO ] Deduced a trap composed of 73 places in 1422 ms of which 11 ms to minimize.
[2024-05-31 21:05:39] [INFO ] Deduced a trap composed of 80 places in 1456 ms of which 12 ms to minimize.
[2024-05-31 21:05:40] [INFO ] Deduced a trap composed of 65 places in 1455 ms of which 11 ms to minimize.
[2024-05-31 21:05:41] [INFO ] Deduced a trap composed of 62 places in 1406 ms of which 10 ms to minimize.
[2024-05-31 21:05:43] [INFO ] Deduced a trap composed of 49 places in 1412 ms of which 11 ms to minimize.
[2024-05-31 21:05:44] [INFO ] Deduced a trap composed of 49 places in 1382 ms of which 11 ms to minimize.
[2024-05-31 21:05:46] [INFO ] Deduced a trap composed of 70 places in 1304 ms of which 11 ms to minimize.
[2024-05-31 21:05:47] [INFO ] Deduced a trap composed of 45 places in 1086 ms of which 9 ms to minimize.
[2024-05-31 21:05:48] [INFO ] Deduced a trap composed of 48 places in 1173 ms of which 10 ms to minimize.
[2024-05-31 21:05:49] [INFO ] Deduced a trap composed of 47 places in 1175 ms of which 10 ms to minimize.
[2024-05-31 21:05:50] [INFO ] Deduced a trap composed of 46 places in 1164 ms of which 10 ms to minimize.
[2024-05-31 21:05:52] [INFO ] Deduced a trap composed of 46 places in 1175 ms of which 10 ms to minimize.
[2024-05-31 21:05:53] [INFO ] Deduced a trap composed of 48 places in 1236 ms of which 10 ms to minimize.
[2024-05-31 21:05:54] [INFO ] Deduced a trap composed of 47 places in 1214 ms of which 10 ms to minimize.
[2024-05-31 21:05:55] [INFO ] Deduced a trap composed of 47 places in 1204 ms of which 10 ms to minimize.
[2024-05-31 21:05:57] [INFO ] Deduced a trap composed of 56 places in 1226 ms of which 10 ms to minimize.
[2024-05-31 21:05:58] [INFO ] Deduced a trap composed of 67 places in 1246 ms of which 10 ms to minimize.
[2024-05-31 21:05:59] [INFO ] Deduced a trap composed of 55 places in 1228 ms of which 10 ms to minimize.
[2024-05-31 21:06:00] [INFO ] Deduced a trap composed of 53 places in 1204 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:06:01] [INFO ] Deduced a trap composed of 79 places in 1139 ms of which 9 ms to minimize.
[2024-05-31 21:06:03] [INFO ] Deduced a trap composed of 48 places in 1104 ms of which 10 ms to minimize.
[2024-05-31 21:06:04] [INFO ] Deduced a trap composed of 55 places in 1086 ms of which 9 ms to minimize.
[2024-05-31 21:06:05] [INFO ] Deduced a trap composed of 53 places in 1049 ms of which 9 ms to minimize.
[2024-05-31 21:06:06] [INFO ] Deduced a trap composed of 53 places in 1078 ms of which 9 ms to minimize.
[2024-05-31 21:06:07] [INFO ] Deduced a trap composed of 50 places in 1063 ms of which 9 ms to minimize.
[2024-05-31 21:06:08] [INFO ] Deduced a trap composed of 58 places in 1005 ms of which 9 ms to minimize.
[2024-05-31 21:06:09] [INFO ] Deduced a trap composed of 67 places in 1021 ms of which 8 ms to minimize.
[2024-05-31 21:06:10] [INFO ] Deduced a trap composed of 51 places in 1057 ms of which 9 ms to minimize.
[2024-05-31 21:06:11] [INFO ] Deduced a trap composed of 68 places in 1055 ms of which 9 ms to minimize.
[2024-05-31 21:06:12] [INFO ] Deduced a trap composed of 49 places in 961 ms of which 9 ms to minimize.
[2024-05-31 21:06:13] [INFO ] Deduced a trap composed of 63 places in 956 ms of which 8 ms to minimize.
[2024-05-31 21:06:14] [INFO ] Deduced a trap composed of 46 places in 879 ms of which 8 ms to minimize.
[2024-05-31 21:06:15] [INFO ] Deduced a trap composed of 46 places in 897 ms of which 7 ms to minimize.
[2024-05-31 21:06:16] [INFO ] Deduced a trap composed of 45 places in 891 ms of which 8 ms to minimize.
[2024-05-31 21:06:17] [INFO ] Deduced a trap composed of 63 places in 861 ms of which 7 ms to minimize.
[2024-05-31 21:06:18] [INFO ] Deduced a trap composed of 46 places in 873 ms of which 7 ms to minimize.
[2024-05-31 21:06:19] [INFO ] Deduced a trap composed of 56 places in 876 ms of which 8 ms to minimize.
SMT process timed out in 47783ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 172 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1845/1845 places, 6523/6523 transitions.
RANDOM walk for 40000 steps (214 resets) in 515 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107898 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107898 steps, saw 28464 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-31 21:06:22] [INFO ] Invariant cache hit.
[2024-05-31 21:06:22] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2473 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:06:25] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:06:27] [INFO ] Deduced a trap composed of 50 places in 1482 ms of which 11 ms to minimize.
[2024-05-31 21:06:28] [INFO ] Deduced a trap composed of 48 places in 1464 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6523/8366 variables, 1843/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8366 variables, 6393/8281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 1/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8366 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/8368 variables, 2/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8368 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/8368 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8368/8368 variables, and 8284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6796 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 9331ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 166 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 164 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-31 21:06:32] [INFO ] Invariant cache hit.
[2024-05-31 21:06:34] [INFO ] Implicit Places using invariants in 1878 ms returned []
[2024-05-31 21:06:34] [INFO ] Invariant cache hit.
[2024-05-31 21:06:35] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-31 21:07:06] [INFO ] Performed 851/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:07:32] [INFO ] Implicit Places using invariants and state equation in 58216 ms returned []
Implicit Place search using SMT with State Equation took 60096 ms to find 0 implicit places.
[2024-05-31 21:07:32] [INFO ] Redundant transitions in 475 ms returned []
Running 6483 sub problems to find dead transitions.
[2024-05-31 21:07:32] [INFO ] Invariant cache hit.
[2024-05-31 21:07:33] [INFO ] State equation strengthened by 6393 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6483 unsolved
SMT process timed out in 35928ms, After SMT, problems are : Problem set: 0 solved, 6483 unsolved
Search for dead transitions found 0 dead transitions in 35980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96741 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 19 factoid took 432 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 104 reset in 839 ms.
Product exploration explored 100000 steps with 103 reset in 877 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 200 place count 3683 transition count 9840
Deduced a syphon composed of 240 places in 2 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 240 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 320 place count 3603 transition count 9760
Deduced a syphon composed of 160 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 400 place count 3603 transition count 9760
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: -3034
Deduced a syphon composed of 1757 places in 3 ms
Iterating global reduction 1 with 1597 rules applied. Total rules applied 1997 place count 3603 transition count 12794
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2157 place count 3443 transition count 12634
Deduced a syphon composed of 1597 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 2317 place count 3443 transition count 12634
Deduced a syphon composed of 1597 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 1 with 1479 rules applied. Total rules applied 3796 place count 3443 transition count 11155
Deduced a syphon composed of 1597 places in 2 ms
Applied a total of 3796 rules in 2355 ms. Remains 3443 /3683 variables (removed 240) and now considering 11155/9840 (removed -1315) transitions.
Running 11115 sub problems to find dead transitions.
// Phase 1: matrix 11155 rows 3443 cols
[2024-05-31 21:08:14] [INFO ] Computed 42 invariants in 374 ms
[2024-05-31 21:08:14] [INFO ] State equation strengthened by 4755 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/3442 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 11115 unsolved
SMT process timed out in 42047ms, After SMT, problems are : Problem set: 0 solved, 11115 unsolved
Search for dead transitions found 0 dead transitions in 42133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3443/3683 places, 11155/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44503 ms. Remains : 3443/3683 places, 11155/9840 transitions.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 235 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:08:56] [INFO ] Computed 42 invariants in 389 ms
[2024-05-31 21:08:59] [INFO ] Implicit Places using invariants in 2467 ms returned []
[2024-05-31 21:08:59] [INFO ] Invariant cache hit.
[2024-05-31 21:09:01] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:09:32] [INFO ] Performed 365/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:09:43] [INFO ] Implicit Places using invariants and state equation in 44648 ms returned []
Implicit Place search using SMT with State Equation took 47117 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:09:43] [INFO ] Invariant cache hit.
[2024-05-31 21:09:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38858ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38931ms
Finished structural reductions in LTL mode , in 1 iterations and 86293 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-03 finished in 718603 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 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 192 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-31 21:10:23] [INFO ] Invariant cache hit.
[2024-05-31 21:10:25] [INFO ] Implicit Places using invariants in 2011 ms returned []
[2024-05-31 21:10:25] [INFO ] Invariant cache hit.
[2024-05-31 21:10:27] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:10:58] [INFO ] Performed 376/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:11:08] [INFO ] Implicit Places using invariants and state equation in 43003 ms returned []
Implicit Place search using SMT with State Equation took 45015 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:11:08] [INFO ] Invariant cache hit.
[2024-05-31 21:11:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38785ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38859ms
Finished structural reductions in LTL mode , in 1 iterations and 84077 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-04
Stuttering criterion allowed to conclude after 1023 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-04 finished in 84199 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((G((G(p1) U p2))||p0))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 791 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:11:48] [INFO ] Computed 42 invariants in 138 ms
[2024-05-31 21:11:49] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2024-05-31 21:11:49] [INFO ] Invariant cache hit.
[2024-05-31 21:11:50] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:12:06] [INFO ] Implicit Places using invariants and state equation in 17231 ms returned []
Implicit Place search using SMT with State Equation took 18561 ms to find 0 implicit places.
[2024-05-31 21:12:07] [INFO ] Redundant transitions in 693 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:12:07] [INFO ] Invariant cache hit.
[2024-05-31 21:12:07] [INFO ] State equation strengthened by 4757 read => feed constraints.
(s1358 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.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 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.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 1.0)
(s621 1.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 1.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 1.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 1.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.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 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0timeout
)
(s1359 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34871ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34919ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54981 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-07
Product exploration explored 100000 steps with 490 reset in 948 ms.
Product exploration explored 100000 steps with 491 reset in 1007 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 17 factoid took 193 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (195 resets) in 802 ms. (49 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
[2024-05-31 21:12:45] [INFO ] Invariant cache hit.
[2024-05-31 21:12:45] [INFO ] State equation strengthened by 4757 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1841 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6521/8364 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8364 variables, 4757/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8364 variables, 0/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8366 variables, 2/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6644 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:12:53] [INFO ] Deduced a trap composed of 46 places in 1456 ms of which 11 ms to minimize.
[2024-05-31 21:12:54] [INFO ] Deduced a trap composed of 56 places in 1459 ms of which 11 ms to minimize.
[2024-05-31 21:12:55] [INFO ] Deduced a trap composed of 46 places in 1375 ms of which 11 ms to minimize.
SMT process timed out in 10548ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 457 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 1379 ms. (28 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 75488 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 7
Probabilistic random walk after 75488 steps, saw 22382 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:13:00] [INFO ] Computed 42 invariants in 170 ms
[2024-05-31 21:13:00] [INFO ] State equation strengthened by 6394 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1839 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1839 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1841 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6519/8360 variables, 1841/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8360 variables, 6394/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8360 variables, 0/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8362 variables, 2/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8279 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6628 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:13:07] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:13:09] [INFO ] Deduced a trap composed of 57 places in 1506 ms of which 12 ms to minimize.
[2024-05-31 21:13:11] [INFO ] Deduced a trap composed of 53 places in 1465 ms of which 11 ms to minimize.
[2024-05-31 21:13:12] [INFO ] Deduced a trap composed of 57 places in 1426 ms of which 11 ms to minimize.
[2024-05-31 21:13:14] [INFO ] Deduced a trap composed of 56 places in 1462 ms of which 11 ms to minimize.
[2024-05-31 21:13:15] [INFO ] Deduced a trap composed of 60 places in 1330 ms of which 11 ms to minimize.
[2024-05-31 21:13:16] [INFO ] Deduced a trap composed of 55 places in 1418 ms of which 11 ms to minimize.
[2024-05-31 21:13:18] [INFO ] Deduced a trap composed of 58 places in 1373 ms of which 11 ms to minimize.
[2024-05-31 21:13:19] [INFO ] Deduced a trap composed of 56 places in 1369 ms of which 10 ms to minimize.
[2024-05-31 21:13:21] [INFO ] Deduced a trap composed of 59 places in 1346 ms of which 10 ms to minimize.
[2024-05-31 21:13:22] [INFO ] Deduced a trap composed of 58 places in 1364 ms of which 10 ms to minimize.
[2024-05-31 21:13:23] [INFO ] Deduced a trap composed of 59 places in 1324 ms of which 10 ms to minimize.
[2024-05-31 21:13:25] [INFO ] Deduced a trap composed of 55 places in 1344 ms of which 10 ms to minimize.
[2024-05-31 21:13:26] [INFO ] Deduced a trap composed of 57 places in 1299 ms of which 10 ms to minimize.
[2024-05-31 21:13:27] [INFO ] Deduced a trap composed of 55 places in 1356 ms of which 10 ms to minimize.
[2024-05-31 21:13:29] [INFO ] Deduced a trap composed of 58 places in 1324 ms of which 10 ms to minimize.
[2024-05-31 21:13:30] [INFO ] Deduced a trap composed of 50 places in 1317 ms of which 10 ms to minimize.
[2024-05-31 21:13:31] [INFO ] Deduced a trap composed of 53 places in 1237 ms of which 10 ms to minimize.
[2024-05-31 21:13:33] [INFO ] Deduced a trap composed of 45 places in 1245 ms of which 10 ms to minimize.
[2024-05-31 21:13:34] [INFO ] Deduced a trap composed of 55 places in 1210 ms of which 10 ms to minimize.
[2024-05-31 21:13:35] [INFO ] Deduced a trap composed of 58 places in 1194 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:13:36] [INFO ] Deduced a trap composed of 64 places in 1158 ms of which 9 ms to minimize.
[2024-05-31 21:13:37] [INFO ] Deduced a trap composed of 50 places in 1097 ms of which 10 ms to minimize.
[2024-05-31 21:13:39] [INFO ] Deduced a trap composed of 51 places in 1097 ms of which 9 ms to minimize.
[2024-05-31 21:13:40] [INFO ] Deduced a trap composed of 56 places in 1117 ms of which 9 ms to minimize.
[2024-05-31 21:13:41] [INFO ] Deduced a trap composed of 54 places in 1041 ms of which 8 ms to minimize.
[2024-05-31 21:13:42] [INFO ] Deduced a trap composed of 58 places in 1064 ms of which 9 ms to minimize.
[2024-05-31 21:13:43] [INFO ] Deduced a trap composed of 54 places in 1040 ms of which 9 ms to minimize.
[2024-05-31 21:13:44] [INFO ] Deduced a trap composed of 61 places in 995 ms of which 9 ms to minimize.
[2024-05-31 21:13:45] [INFO ] Deduced a trap composed of 47 places in 977 ms of which 9 ms to minimize.
[2024-05-31 21:13:46] [INFO ] Deduced a trap composed of 52 places in 982 ms of which 8 ms to minimize.
[2024-05-31 21:13:47] [INFO ] Deduced a trap composed of 83 places in 962 ms of which 8 ms to minimize.
[2024-05-31 21:13:48] [INFO ] Deduced a trap composed of 76 places in 905 ms of which 8 ms to minimize.
[2024-05-31 21:13:49] [INFO ] Deduced a trap composed of 61 places in 941 ms of which 8 ms to minimize.
[2024-05-31 21:13:50] [INFO ] Deduced a trap composed of 57 places in 938 ms of which 9 ms to minimize.
[2024-05-31 21:13:51] [INFO ] Deduced a trap composed of 53 places in 911 ms of which 7 ms to minimize.
[2024-05-31 21:13:52] [INFO ] Deduced a trap composed of 75 places in 902 ms of which 8 ms to minimize.
SMT process timed out in 52113ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 158 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 156 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-31 21:13:52] [INFO ] Invariant cache hit.
[2024-05-31 21:13:54] [INFO ] Implicit Places using invariants in 1864 ms returned []
[2024-05-31 21:13:54] [INFO ] Invariant cache hit.
[2024-05-31 21:13:55] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-31 21:14:26] [INFO ] Performed 801/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:14:56] [INFO ] Performed 1814/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:14:57] [INFO ] Implicit Places using invariants and state equation in 62869 ms returned []
Implicit Place search using SMT with State Equation took 64734 ms to find 0 implicit places.
[2024-05-31 21:14:57] [INFO ] Redundant transitions in 500 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-31 21:14:57] [INFO ] Invariant cache hit.
[2024-05-31 21:14:57] [INFO ] State equation strengthened by 6394 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36031ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36082ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101491 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 17 factoid took 253 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 149 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:15:34] [INFO ] Computed 42 invariants in 120 ms
[2024-05-31 21:15:35] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2024-05-31 21:15:35] [INFO ] Invariant cache hit.
[2024-05-31 21:15:37] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:15:53] [INFO ] Implicit Places using invariants and state equation in 17135 ms returned []
Implicit Place search using SMT with State Equation took 18402 ms to find 0 implicit places.
[2024-05-31 21:15:53] [INFO ] Redundant transitions in 467 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:15:53] [INFO ] Invariant cache hit.
[2024-05-31 21:15:53] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34935ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34984ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54019 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 17 factoid took 206 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (193 resets) in 1424 ms. (28 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
[2024-05-31 21:16:29] [INFO ] Invariant cache hit.
[2024-05-31 21:16:29] [INFO ] State equation strengthened by 4757 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1841 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6521/8364 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8364 variables, 4757/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8364 variables, 0/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8366 variables, 2/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6644 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:16:34] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:16:35] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:16:37] [INFO ] Deduced a trap composed of 46 places in 1414 ms of which 11 ms to minimize.
[2024-05-31 21:16:38] [INFO ] Deduced a trap composed of 56 places in 1418 ms of which 10 ms to minimize.
[2024-05-31 21:16:40] [INFO ] Deduced a trap composed of 46 places in 1378 ms of which 10 ms to minimize.
SMT process timed out in 10486ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 489 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (217 resets) in 1679 ms. (23 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 82354 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 7
Probabilistic random walk after 82354 steps, saw 23303 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-31 21:16:44] [INFO ] Computed 42 invariants in 155 ms
[2024-05-31 21:16:44] [INFO ] State equation strengthened by 6394 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1839 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1839 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1841 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6519/8360 variables, 1841/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8360 variables, 6394/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8360 variables, 0/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8362 variables, 2/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8279 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:16:51] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:16:54] [INFO ] Deduced a trap composed of 57 places in 1455 ms of which 11 ms to minimize.
[2024-05-31 21:16:55] [INFO ] Deduced a trap composed of 53 places in 1307 ms of which 10 ms to minimize.
[2024-05-31 21:16:56] [INFO ] Deduced a trap composed of 57 places in 1419 ms of which 10 ms to minimize.
[2024-05-31 21:16:58] [INFO ] Deduced a trap composed of 56 places in 1439 ms of which 11 ms to minimize.
[2024-05-31 21:16:59] [INFO ] Deduced a trap composed of 60 places in 1462 ms of which 11 ms to minimize.
[2024-05-31 21:17:01] [INFO ] Deduced a trap composed of 55 places in 1437 ms of which 11 ms to minimize.
[2024-05-31 21:17:02] [INFO ] Deduced a trap composed of 58 places in 1410 ms of which 11 ms to minimize.
[2024-05-31 21:17:04] [INFO ] Deduced a trap composed of 56 places in 1351 ms of which 10 ms to minimize.
[2024-05-31 21:17:05] [INFO ] Deduced a trap composed of 59 places in 1332 ms of which 11 ms to minimize.
[2024-05-31 21:17:06] [INFO ] Deduced a trap composed of 58 places in 1397 ms of which 11 ms to minimize.
[2024-05-31 21:17:08] [INFO ] Deduced a trap composed of 59 places in 1334 ms of which 11 ms to minimize.
[2024-05-31 21:17:09] [INFO ] Deduced a trap composed of 55 places in 1329 ms of which 11 ms to minimize.
[2024-05-31 21:17:11] [INFO ] Deduced a trap composed of 57 places in 1339 ms of which 10 ms to minimize.
[2024-05-31 21:17:12] [INFO ] Deduced a trap composed of 55 places in 1335 ms of which 12 ms to minimize.
[2024-05-31 21:17:13] [INFO ] Deduced a trap composed of 58 places in 1343 ms of which 15 ms to minimize.
[2024-05-31 21:17:15] [INFO ] Deduced a trap composed of 50 places in 1303 ms of which 10 ms to minimize.
[2024-05-31 21:17:16] [INFO ] Deduced a trap composed of 53 places in 1245 ms of which 10 ms to minimize.
[2024-05-31 21:17:17] [INFO ] Deduced a trap composed of 45 places in 1200 ms of which 10 ms to minimize.
[2024-05-31 21:17:18] [INFO ] Deduced a trap composed of 55 places in 1196 ms of which 10 ms to minimize.
[2024-05-31 21:17:20] [INFO ] Deduced a trap composed of 58 places in 1180 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:17:21] [INFO ] Deduced a trap composed of 64 places in 1153 ms of which 9 ms to minimize.
[2024-05-31 21:17:22] [INFO ] Deduced a trap composed of 50 places in 1072 ms of which 9 ms to minimize.
[2024-05-31 21:17:23] [INFO ] Deduced a trap composed of 51 places in 1040 ms of which 9 ms to minimize.
[2024-05-31 21:17:24] [INFO ] Deduced a trap composed of 56 places in 1102 ms of which 9 ms to minimize.
[2024-05-31 21:17:25] [INFO ] Deduced a trap composed of 54 places in 1094 ms of which 8 ms to minimize.
[2024-05-31 21:17:26] [INFO ] Deduced a trap composed of 58 places in 1049 ms of which 9 ms to minimize.
[2024-05-31 21:17:27] [INFO ] Deduced a trap composed of 54 places in 1039 ms of which 8 ms to minimize.
[2024-05-31 21:17:28] [INFO ] Deduced a trap composed of 61 places in 958 ms of which 8 ms to minimize.
[2024-05-31 21:17:29] [INFO ] Deduced a trap composed of 47 places in 953 ms of which 8 ms to minimize.
[2024-05-31 21:17:30] [INFO ] Deduced a trap composed of 52 places in 922 ms of which 7 ms to minimize.
[2024-05-31 21:17:31] [INFO ] Deduced a trap composed of 83 places in 968 ms of which 7 ms to minimize.
[2024-05-31 21:17:32] [INFO ] Deduced a trap composed of 76 places in 921 ms of which 8 ms to minimize.
[2024-05-31 21:17:33] [INFO ] Deduced a trap composed of 61 places in 909 ms of which 8 ms to minimize.
[2024-05-31 21:17:34] [INFO ] Deduced a trap composed of 57 places in 931 ms of which 8 ms to minimize.
[2024-05-31 21:17:35] [INFO ] Deduced a trap composed of 53 places in 907 ms of which 7 ms to minimize.
[2024-05-31 21:17:36] [INFO ] Deduced a trap composed of 75 places in 934 ms of which 12 ms to minimize.
[2024-05-31 21:17:37] [INFO ] Deduced a trap composed of 58 places in 965 ms of which 7 ms to minimize.
SMT process timed out in 53117ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 162 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 156 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-31 21:17:37] [INFO ] Invariant cache hit.
[2024-05-31 21:17:39] [INFO ] Implicit Places using invariants in 1825 ms returned []
[2024-05-31 21:17:39] [INFO ] Invariant cache hit.
[2024-05-31 21:17:41] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-31 21:18:11] [INFO ] Performed 842/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:18:40] [INFO ] Implicit Places using invariants and state equation in 61059 ms returned []
Implicit Place search using SMT with State Equation took 62884 ms to find 0 implicit places.
[2024-05-31 21:18:41] [INFO ] Redundant transitions in 509 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-31 21:18:41] [INFO ] Invariant cache hit.
[2024-05-31 21:18:41] [INFO ] State equation strengthened by 6394 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36043ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36094ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99657 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 17 factoid took 250 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 494 reset in 1039 ms.
Product exploration explored 100000 steps with 493 reset in 979 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 145 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-31 21:19:20] [INFO ] Computed 42 invariants in 127 ms
[2024-05-31 21:19:21] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-05-31 21:19:21] [INFO ] Invariant cache hit.
[2024-05-31 21:19:22] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:19:39] [INFO ] Implicit Places using invariants and state equation in 17849 ms returned []
Implicit Place search using SMT with State Equation took 19113 ms to find 0 implicit places.
[2024-05-31 21:19:39] [INFO ] Redundant transitions in 473 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-31 21:19:39] [INFO ] Invariant cache hit.
[2024-05-31 21:19:39] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35135ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54930 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-07 finished in 507892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(F(p1)))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 184 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:20:15] [INFO ] Computed 42 invariants in 381 ms
[2024-05-31 21:20:17] [INFO ] Implicit Places using invariants in 2458 ms returned []
[2024-05-31 21:20:17] [INFO ] Invariant cache hit.
[2024-05-31 21:20:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:20:51] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:21:04] [INFO ] Implicit Places using invariants and state equation in 46529 ms returned []
Implicit Place search using SMT with State Equation took 48989 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:21:04] [INFO ] Invariant cache hit.
[2024-05-31 21:21:04] [INFO ] State equation strengthened by 3160 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 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 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 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.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 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.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 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38874ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38950ms
Finished structural reductions in LTL mode , in 1 iterations and 88142 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08
Product exploration explored 100000 steps with 104 reset in 696 ms.
Product exploration explored 100000 steps with 102 reset in 717 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (39 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 74897 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 74897 steps, saw 48395 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-31 21:21:48] [INFO ] Invariant cache hit.
[2024-05-31 21:21:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:48] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-31 21:21:48] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-31 21:21:49] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-31 21:21:49] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-31 21:21:49] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-31 21:21:49] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-31 21:21:49] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-31 21:21:49] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:21:49] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-31 21:21:51] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 21:21:52] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-31 21:21:53] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-31 21:21:53] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-31 21:21:53] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
SMT process timed out in 5075ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 3 with 1641 rules applied. Total rules applied 6802 place count 1843 transition count 6519
Applied a total of 6802 rules in 1090 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1090 ms. Remains : 1843/3683 places, 6519/9840 transitions.
RANDOM walk for 37598 steps (202 resets) in 444 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 744 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-31 21:21:55] [INFO ] Computed 42 invariants in 120 ms
[2024-05-31 21:21:56] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2024-05-31 21:21:56] [INFO ] Invariant cache hit.
[2024-05-31 21:21:58] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:22:12] [INFO ] Implicit Places using invariants and state equation in 15264 ms returned []
Implicit Place search using SMT with State Equation took 16553 ms to find 0 implicit places.
[2024-05-31 21:22:12] [INFO ] Redundant transitions in 492 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:22:12] [INFO ] Invariant cache hit.
[2024-05-31 21:22:12] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34814ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34862ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52667 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 27086 steps (132 resets) in 281 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 495 reset in 905 ms.
Product exploration explored 100000 steps with 493 reset in 938 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 142 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2024-05-31 21:22:50] [INFO ] Invariant cache hit.
[2024-05-31 21:22:51] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2024-05-31 21:22:51] [INFO ] Invariant cache hit.
[2024-05-31 21:22:52] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:23:06] [INFO ] Implicit Places using invariants and state equation in 14690 ms returned []
Implicit Place search using SMT with State Equation took 15892 ms to find 0 implicit places.
[2024-05-31 21:23:06] [INFO ] Redundant transitions in 466 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:23:06] [INFO ] Invariant cache hit.
[2024-05-31 21:23:06] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34845ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34896ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51412 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-08 finished in 206414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1481 Post agglomeration using F-continuation condition.Transition count delta: 1481
Deduced a syphon composed of 1481 places in 2 ms
Reduce places removed 1481 places and 0 transitions.
Iterating global reduction 3 with 2962 rules applied. Total rules applied 3522 place count 1922 transition count 8079
Drop transitions (Redundant composition of simpler transitions.) removed 1405 transitions
Redundant transition composition rules discarded 1405 transitions
Iterating global reduction 3 with 1405 rules applied. Total rules applied 4927 place count 1922 transition count 6674
Partial Post-agglomeration rule applied 154 times.
Drop transitions (Partial Post agglomeration) removed 154 transitions
Iterating global reduction 3 with 154 rules applied. Total rules applied 5081 place count 1922 transition count 6674
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 5157 place count 1846 transition count 6598
Iterating global reduction 3 with 76 rules applied. Total rules applied 5233 place count 1846 transition count 6598
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 5271 place count 1846 transition count 6560
Applied a total of 5271 rules in 1214 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6560/9840 (removed 3280) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-31 21:23:42] [INFO ] Computed 42 invariants in 126 ms
[2024-05-31 21:23:44] [INFO ] Implicit Places using invariants in 1315 ms returned []
[2024-05-31 21:23:44] [INFO ] Invariant cache hit.
[2024-05-31 21:23:45] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-31 21:24:00] [INFO ] Implicit Places using invariants and state equation in 16730 ms returned []
Implicit Place search using SMT with State Equation took 18046 ms to find 0 implicit places.
[2024-05-31 21:24:01] [INFO ] Redundant transitions in 702 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-31 21:24:01] [INFO ] Invariant cache hit.
[2024-05-31 21:24:01] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 34834ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 34884ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1846/3683 places, 6560/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54863 ms. Remains : 1846/3683 places, 6560/9840 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-10
Product exploration explored 100000 steps with 485 reset in 918 ms.
Product exploration explored 100000 steps with 487 reset in 941 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (193 resets) in 463 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 108158 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 108158 steps, saw 29896 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-31 21:24:41] [INFO ] Invariant cache hit.
[2024-05-31 21:24:41] [INFO ] State equation strengthened by 4793 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) 1761/1764 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:24:42] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1764 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1842 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:24:43] [INFO ] Deduced a trap composed of 77 places in 1420 ms of which 11 ms to minimize.
[2024-05-31 21:24:45] [INFO ] Deduced a trap composed of 52 places in 1500 ms of which 12 ms to minimize.
[2024-05-31 21:24:46] [INFO ] Deduced a trap composed of 66 places in 1485 ms of which 11 ms to minimize.
[2024-05-31 21:24:48] [INFO ] Deduced a trap composed of 57 places in 1394 ms of which 11 ms to minimize.
SMT process timed out in 6402ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions (Partial Free agglomeration) removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 475 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 1845/1846 places, 6559/6560 transitions.
RANDOM walk for 40000 steps (209 resets) in 463 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 104503 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 104503 steps, saw 28117 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-31 21:24:51] [INFO ] Computed 42 invariants in 148 ms
[2024-05-31 21:24:52] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:24:52] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-31 21:24:52] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:24:54] [INFO ] Deduced a trap composed of 68 places in 1484 ms of which 11 ms to minimize.
[2024-05-31 21:24:55] [INFO ] Deduced a trap composed of 48 places in 1367 ms of which 10 ms to minimize.
[2024-05-31 21:24:55] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6559/8402 variables, 1843/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8402 variables, 6393/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8402 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8404 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8404/8404 variables, and 8285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6273 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:24:58] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:24: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/1763 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:24:59] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:25:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1763 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1763 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1841 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1843 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6559/8402 variables, 1843/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8402 variables, 6393/8320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8402 variables, 1/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8402 variables, 0/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/8404 variables, 2/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8404/8404 variables, and 8323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12136 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 18622ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 168 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 166 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-31 21:25:10] [INFO ] Invariant cache hit.
[2024-05-31 21:25:12] [INFO ] Implicit Places using invariants in 1962 ms returned []
[2024-05-31 21:25:12] [INFO ] Invariant cache hit.
[2024-05-31 21:25:14] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-31 21:25:44] [INFO ] Performed 711/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:26:14] [INFO ] Performed 1642/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:26:20] [INFO ] Implicit Places using invariants and state equation in 67244 ms returned []
Implicit Place search using SMT with State Equation took 69208 ms to find 0 implicit places.
[2024-05-31 21:26:20] [INFO ] Redundant transitions in 487 ms returned []
Running 6519 sub problems to find dead transitions.
[2024-05-31 21:26:20] [INFO ] Invariant cache hit.
[2024-05-31 21:26:20] [INFO ] State equation strengthened by 6393 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6519 unsolved
SMT process timed out in 36099ms, After SMT, problems are : Problem set: 0 solved, 6519 unsolved
Search for dead transitions found 0 dead transitions in 36151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106030 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 168 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-31 21:26:57] [INFO ] Computed 42 invariants in 124 ms
[2024-05-31 21:26:58] [INFO ] Implicit Places using invariants in 1307 ms returned []
[2024-05-31 21:26:58] [INFO ] Invariant cache hit.
[2024-05-31 21:26:59] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-31 21:27:15] [INFO ] Implicit Places using invariants and state equation in 16704 ms returned []
Implicit Place search using SMT with State Equation took 18012 ms to find 0 implicit places.
[2024-05-31 21:27:15] [INFO ] Redundant transitions in 493 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-31 21:27:15] [INFO ] Invariant cache hit.
[2024-05-31 21:27:15] [INFO ] State equation strengthened by 4793 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/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 35083ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 35132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53822 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (192 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 108823 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 108823 steps, saw 29993 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-31 21:27:54] [INFO ] Invariant cache hit.
[2024-05-31 21:27:54] [INFO ] State equation strengthened by 4793 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) 1761/1764 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:27:54] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1764 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1842 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:27:56] [INFO ] Deduced a trap composed of 77 places in 1449 ms of which 11 ms to minimize.
[2024-05-31 21:27:57] [INFO ] Deduced a trap composed of 52 places in 1444 ms of which 12 ms to minimize.
[2024-05-31 21:27:59] [INFO ] Deduced a trap composed of 66 places in 1447 ms of which 11 ms to minimize.
[2024-05-31 21:28:00] [INFO ] Deduced a trap composed of 57 places in 1366 ms of which 11 ms to minimize.
SMT process timed out in 6331ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions (Partial Free agglomeration) removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 518 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 1845/1846 places, 6559/6560 transitions.
RANDOM walk for 40000 steps (212 resets) in 455 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 105230 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 105230 steps, saw 28186 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-31 21:28:04] [INFO ] Computed 42 invariants in 145 ms
[2024-05-31 21:28:04] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:28:04] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-31 21:28:04] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:28:06] [INFO ] Deduced a trap composed of 68 places in 1463 ms of which 12 ms to minimize.
[2024-05-31 21:28:07] [INFO ] Deduced a trap composed of 48 places in 1397 ms of which 11 ms to minimize.
[2024-05-31 21:28:07] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6559/8402 variables, 1843/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8402 variables, 6393/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8402 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8404 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8404/8404 variables, and 8285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6211 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:28:10] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:28:10] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:28:10] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 21:28:10] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:28:11] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 2 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:28:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:28:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1763 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1763 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1841 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1843 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6559/8402 variables, 1843/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8402 variables, 6393/8320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8402 variables, 1/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8402 variables, 0/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/8404 variables, 2/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8404/8404 variables, and 8323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11750 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 18176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 183 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 181 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-31 21:28:22] [INFO ] Invariant cache hit.
[2024-05-31 21:28:24] [INFO ] Implicit Places using invariants in 1854 ms returned []
[2024-05-31 21:28:24] [INFO ] Invariant cache hit.
[2024-05-31 21:28:25] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-31 21:28:56] [INFO ] Performed 813/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:29:25] [INFO ] Implicit Places using invariants and state equation in 60675 ms returned []
Implicit Place search using SMT with State Equation took 62530 ms to find 0 implicit places.
[2024-05-31 21:29:25] [INFO ] Redundant transitions in 488 ms returned []
Running 6519 sub problems to find dead transitions.
[2024-05-31 21:29:25] [INFO ] Invariant cache hit.
[2024-05-31 21:29:25] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6519 unsolved
SMT process timed out in 36123ms, After SMT, problems are : Problem set: 0 solved, 6519 unsolved
Search for dead transitions found 0 dead transitions in 36173ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99394 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 488 reset in 979 ms.
Product exploration explored 100000 steps with 484 reset in 949 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 167 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-31 21:30:04] [INFO ] Computed 42 invariants in 188 ms
[2024-05-31 21:30:05] [INFO ] Implicit Places using invariants in 1365 ms returned []
[2024-05-31 21:30:05] [INFO ] Invariant cache hit.
[2024-05-31 21:30:07] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-31 21:30:23] [INFO ] Implicit Places using invariants and state equation in 17526 ms returned []
Implicit Place search using SMT with State Equation took 18892 ms to find 0 implicit places.
[2024-05-31 21:30:23] [INFO ] Redundant transitions in 501 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-31 21:30:23] [INFO ] Invariant cache hit.
[2024-05-31 21:30:23] [INFO ] State equation strengthened by 4793 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/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 35082ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 35131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54707 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-10 finished in 437412 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)||G(p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 255 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:30:59] [INFO ] Computed 42 invariants in 389 ms
[2024-05-31 21:31:01] [INFO ] Implicit Places using invariants in 2552 ms returned []
[2024-05-31 21:31:01] [INFO ] Invariant cache hit.
[2024-05-31 21:31:04] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:31:35] [INFO ] Performed 329/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:31:49] [INFO ] Implicit Places using invariants and state equation in 47221 ms returned []
Implicit Place search using SMT with State Equation took 49773 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:31:49] [INFO ] Invariant cache hit.
[2024-05-31 21:31:49] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39292ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39379ms
Finished structural reductions in LTL mode , in 1 iterations and 89418 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-11 finished in 89627 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(p1))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 235 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-31 21:32:28] [INFO ] Invariant cache hit.
[2024-05-31 21:32:31] [INFO ] Implicit Places using invariants in 2134 ms returned []
[2024-05-31 21:32:31] [INFO ] Invariant cache hit.
[2024-05-31 21:32:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:33:03] [INFO ] Performed 321/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:33:19] [INFO ] Implicit Places using invariants and state equation in 48005 ms returned []
Implicit Place search using SMT with State Equation took 50139 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:33:19] [INFO ] Invariant cache hit.
[2024-05-31 21:33:19] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39415ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39485ms
Finished structural reductions in LTL mode , in 1 iterations and 89870 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-12
Stuttering criterion allowed to conclude after 1185 steps with 0 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-12 finished in 89999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 838 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-31 21:33:59] [INFO ] Computed 42 invariants in 116 ms
[2024-05-31 21:34:00] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2024-05-31 21:34:00] [INFO ] Invariant cache hit.
[2024-05-31 21:34:02] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:34:16] [INFO ] Implicit Places using invariants and state equation in 15811 ms returned []
Implicit Place search using SMT with State Equation took 17066 ms to find 0 implicit places.
[2024-05-31 21:34:17] [INFO ] Redundant transitions in 656 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:34:17] [INFO ] Invariant cache hit.
[2024-05-31 21:34:17] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34886ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53511 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-13
Product exploration explored 100000 steps with 493 reset in 916 ms.
Stack based approach found an accepted trace after 79967 steps with 392 reset with depth 212 and stack size 212 in 759 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-13 finished in 55250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 235 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-31 21:34:54] [INFO ] Computed 42 invariants in 373 ms
[2024-05-31 21:34:56] [INFO ] Implicit Places using invariants in 2353 ms returned []
[2024-05-31 21:34:56] [INFO ] Invariant cache hit.
[2024-05-31 21:34:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 21:35:29] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:35:43] [INFO ] Implicit Places using invariants and state equation in 46677 ms returned []
Implicit Place search using SMT with State Equation took 49030 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-31 21:35:43] [INFO ] Invariant cache hit.
[2024-05-31 21:35:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38885ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38957ms
Finished structural reductions in LTL mode , in 1 iterations and 88234 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-14 finished in 88387 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)) U G(p1)))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 2 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 3 with 3120 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 3 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 870 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-31 21:36:23] [INFO ] Computed 42 invariants in 141 ms
[2024-05-31 21:36:24] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2024-05-31 21:36:24] [INFO ] Invariant cache hit.
[2024-05-31 21:36:25] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-31 21:36:41] [INFO ] Implicit Places using invariants and state equation in 17373 ms returned []
Implicit Place search using SMT with State Equation took 18683 ms to find 0 implicit places.
[2024-05-31 21:36:42] [INFO ] Redundant transitions in 718 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:36:42] [INFO ] Invariant cache hit.
[2024-05-31 21:36:42] [INFO ] State equation strengthened by 4758 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34990ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55328 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-15
Product exploration explored 100000 steps with 506 reset in 957 ms.
Product exploration explored 100000 steps with 496 reset in 958 ms.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (195 resets) in 436 ms. (91 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-05-31 21:37:19] [INFO ] Invariant cache hit.
[2024-05-31 21:37:19] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:37:20] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-31 21:37:20] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:37:21] [INFO ] Deduced a trap composed of 54 places in 1461 ms of which 11 ms to minimize.
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 59 places in 1415 ms of which 10 ms to minimize.
[2024-05-31 21:37:24] [INFO ] Deduced a trap composed of 46 places in 1355 ms of which 11 ms to minimize.
[2024-05-31 21:37:26] [INFO ] Deduced a trap composed of 48 places in 1292 ms of which 10 ms to minimize.
SMT process timed out in 6224ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 532 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 1842/1845 places, 6517/6520 transitions.
RANDOM walk for 40000 steps (215 resets) in 613 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107889 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107889 steps, saw 28463 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-31 21:37:30] [INFO ] Computed 42 invariants in 160 ms
[2024-05-31 21:37:30] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:37:30] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:37:32] [INFO ] Deduced a trap composed of 51 places in 1398 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6396/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4290 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6396/6396 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 47 places in 1457 ms of which 12 ms to minimize.
[2024-05-31 21:37:40] [INFO ] Deduced a trap composed of 52 places in 1454 ms of which 11 ms to minimize.
[2024-05-31 21:37:41] [INFO ] Deduced a trap composed of 62 places in 1490 ms of which 11 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 83 places in 1509 ms of which 12 ms to minimize.
[2024-05-31 21:37:44] [INFO ] Deduced a trap composed of 63 places in 1518 ms of which 11 ms to minimize.
[2024-05-31 21:37:46] [INFO ] Deduced a trap composed of 51 places in 1468 ms of which 11 ms to minimize.
[2024-05-31 21:37:47] [INFO ] Deduced a trap composed of 58 places in 1523 ms of which 11 ms to minimize.
[2024-05-31 21:37:49] [INFO ] Deduced a trap composed of 47 places in 1465 ms of which 11 ms to minimize.
[2024-05-31 21:37:50] [INFO ] Deduced a trap composed of 49 places in 1488 ms of which 11 ms to minimize.
[2024-05-31 21:37:52] [INFO ] Deduced a trap composed of 61 places in 1474 ms of which 11 ms to minimize.
[2024-05-31 21:37:53] [INFO ] Deduced a trap composed of 64 places in 1506 ms of which 12 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 48 places in 1464 ms of which 11 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 59 places in 1418 ms of which 11 ms to minimize.
[2024-05-31 21:37:58] [INFO ] Deduced a trap composed of 56 places in 1453 ms of which 12 ms to minimize.
[2024-05-31 21:37:59] [INFO ] Deduced a trap composed of 52 places in 1504 ms of which 11 ms to minimize.
[2024-05-31 21:38:01] [INFO ] Deduced a trap composed of 81 places in 1526 ms of which 12 ms to minimize.
[2024-05-31 21:38:02] [INFO ] Deduced a trap composed of 93 places in 1518 ms of which 10 ms to minimize.
[2024-05-31 21:38:04] [INFO ] Deduced a trap composed of 62 places in 1478 ms of which 11 ms to minimize.
[2024-05-31 21:38:05] [INFO ] Deduced a trap composed of 48 places in 1452 ms of which 11 ms to minimize.
[2024-05-31 21:38:07] [INFO ] Deduced a trap composed of 57 places in 1442 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:38:08] [INFO ] Deduced a trap composed of 59 places in 1432 ms of which 12 ms to minimize.
[2024-05-31 21:38:10] [INFO ] Deduced a trap composed of 67 places in 1460 ms of which 12 ms to minimize.
[2024-05-31 21:38:11] [INFO ] Deduced a trap composed of 49 places in 1461 ms of which 11 ms to minimize.
[2024-05-31 21:38:13] [INFO ] Deduced a trap composed of 64 places in 1491 ms of which 12 ms to minimize.
[2024-05-31 21:38:14] [INFO ] Deduced a trap composed of 49 places in 1481 ms of which 11 ms to minimize.
[2024-05-31 21:38:16] [INFO ] Deduced a trap composed of 64 places in 1472 ms of which 11 ms to minimize.
[2024-05-31 21:38:17] [INFO ] Deduced a trap composed of 45 places in 1454 ms of which 11 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 51 places in 1480 ms of which 11 ms to minimize.
[2024-05-31 21:38:20] [INFO ] Deduced a trap composed of 53 places in 1394 ms of which 10 ms to minimize.
SMT process timed out in 50842ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 186 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 189 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-31 21:38:21] [INFO ] Invariant cache hit.
[2024-05-31 21:38:23] [INFO ] Implicit Places using invariants in 1910 ms returned []
[2024-05-31 21:38:23] [INFO ] Invariant cache hit.
[2024-05-31 21:38:24] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-31 21:38:54] [INFO ] Performed 685/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:39:24] [INFO ] Performed 1575/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:39:32] [INFO ] Implicit Places using invariants and state equation in 69790 ms returned []
Implicit Place search using SMT with State Equation took 71702 ms to find 0 implicit places.
[2024-05-31 21:39:33] [INFO ] Redundant transitions in 497 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-31 21:39:33] [INFO ] Invariant cache hit.
[2024-05-31 21:39:33] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6477 unsolved
SMT process timed out in 35974ms, After SMT, problems are : Problem set: 0 solved, 6477 unsolved
Search for dead transitions found 0 dead transitions in 36026ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108429 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 169 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-31 21:40:10] [INFO ] Computed 42 invariants in 126 ms
[2024-05-31 21:40:11] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2024-05-31 21:40:11] [INFO ] Invariant cache hit.
[2024-05-31 21:40:12] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-31 21:40:27] [INFO ] Implicit Places using invariants and state equation in 16741 ms returned []
Implicit Place search using SMT with State Equation took 18012 ms to find 0 implicit places.
[2024-05-31 21:40:28] [INFO ] Redundant transitions in 477 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:40:28] [INFO ] Invariant cache hit.
[2024-05-31 21:40:28] [INFO ] State equation strengthened by 4758 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 1.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 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 0.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.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 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35023ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35070ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53744 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (196 resets) in 431 ms. (92 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-05-31 21:41:03] [INFO ] Invariant cache hit.
[2024-05-31 21:41:03] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:04] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-31 21:41:04] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:05] [INFO ] Deduced a trap composed of 54 places in 1442 ms of which 11 ms to minimize.
[2024-05-31 21:41:07] [INFO ] Deduced a trap composed of 59 places in 1396 ms of which 11 ms to minimize.
[2024-05-31 21:41:08] [INFO ] Deduced a trap composed of 46 places in 1300 ms of which 10 ms to minimize.
[2024-05-31 21:41:09] [INFO ] Deduced a trap composed of 48 places in 1300 ms of which 11 ms to minimize.
SMT process timed out in 6089ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 517 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 517 ms. Remains : 1842/1845 places, 6517/6520 transitions.
RANDOM walk for 40000 steps (215 resets) in 455 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 108134 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 108134 steps, saw 28490 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-31 21:41:13] [INFO ] Computed 42 invariants in 155 ms
[2024-05-31 21:41:13] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:14] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:15] [INFO ] Deduced a trap composed of 51 places in 1416 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6396/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6396/6396 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:22] [INFO ] Deduced a trap composed of 47 places in 1437 ms of which 12 ms to minimize.
[2024-05-31 21:41:23] [INFO ] Deduced a trap composed of 52 places in 1326 ms of which 11 ms to minimize.
[2024-05-31 21:41:25] [INFO ] Deduced a trap composed of 62 places in 1444 ms of which 11 ms to minimize.
[2024-05-31 21:41:26] [INFO ] Deduced a trap composed of 83 places in 1477 ms of which 11 ms to minimize.
[2024-05-31 21:41:28] [INFO ] Deduced a trap composed of 63 places in 1449 ms of which 11 ms to minimize.
[2024-05-31 21:41:29] [INFO ] Deduced a trap composed of 51 places in 1341 ms of which 11 ms to minimize.
[2024-05-31 21:41:31] [INFO ] Deduced a trap composed of 58 places in 1417 ms of which 11 ms to minimize.
[2024-05-31 21:41:32] [INFO ] Deduced a trap composed of 47 places in 1398 ms of which 11 ms to minimize.
[2024-05-31 21:41:33] [INFO ] Deduced a trap composed of 49 places in 1441 ms of which 10 ms to minimize.
[2024-05-31 21:41:35] [INFO ] Deduced a trap composed of 61 places in 1420 ms of which 11 ms to minimize.
[2024-05-31 21:41:36] [INFO ] Deduced a trap composed of 64 places in 1465 ms of which 11 ms to minimize.
[2024-05-31 21:41:38] [INFO ] Deduced a trap composed of 48 places in 1451 ms of which 11 ms to minimize.
[2024-05-31 21:41:39] [INFO ] Deduced a trap composed of 59 places in 1378 ms of which 11 ms to minimize.
[2024-05-31 21:41:41] [INFO ] Deduced a trap composed of 56 places in 1434 ms of which 11 ms to minimize.
[2024-05-31 21:41:42] [INFO ] Deduced a trap composed of 52 places in 1471 ms of which 11 ms to minimize.
[2024-05-31 21:41:44] [INFO ] Deduced a trap composed of 81 places in 1470 ms of which 11 ms to minimize.
[2024-05-31 21:41:45] [INFO ] Deduced a trap composed of 93 places in 1462 ms of which 11 ms to minimize.
[2024-05-31 21:41:47] [INFO ] Deduced a trap composed of 62 places in 1430 ms of which 11 ms to minimize.
[2024-05-31 21:41:48] [INFO ] Deduced a trap composed of 48 places in 1445 ms of which 11 ms to minimize.
[2024-05-31 21:41:50] [INFO ] Deduced a trap composed of 57 places in 1434 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:41:51] [INFO ] Deduced a trap composed of 59 places in 1438 ms of which 10 ms to minimize.
[2024-05-31 21:41:53] [INFO ] Deduced a trap composed of 67 places in 1462 ms of which 12 ms to minimize.
[2024-05-31 21:41:54] [INFO ] Deduced a trap composed of 49 places in 1434 ms of which 11 ms to minimize.
[2024-05-31 21:41:56] [INFO ] Deduced a trap composed of 64 places in 1454 ms of which 11 ms to minimize.
[2024-05-31 21:41:57] [INFO ] Deduced a trap composed of 49 places in 1442 ms of which 11 ms to minimize.
[2024-05-31 21:41:59] [INFO ] Deduced a trap composed of 64 places in 1479 ms of which 12 ms to minimize.
[2024-05-31 21:42:00] [INFO ] Deduced a trap composed of 45 places in 1422 ms of which 11 ms to minimize.
[2024-05-31 21:42:01] [INFO ] Deduced a trap composed of 51 places in 1430 ms of which 12 ms to minimize.
[2024-05-31 21:42:03] [INFO ] Deduced a trap composed of 53 places in 1488 ms of which 11 ms to minimize.
SMT process timed out in 49852ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 188 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 186 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-31 21:42:03] [INFO ] Invariant cache hit.
[2024-05-31 21:42:05] [INFO ] Implicit Places using invariants in 1820 ms returned []
[2024-05-31 21:42:05] [INFO ] Invariant cache hit.
[2024-05-31 21:42:07] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-31 21:42:37] [INFO ] Performed 730/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:43:07] [INFO ] Performed 1682/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 21:43:11] [INFO ] Implicit Places using invariants and state equation in 66166 ms returned []
Implicit Place search using SMT with State Equation took 67987 ms to find 0 implicit places.
[2024-05-31 21:43:12] [INFO ] Redundant transitions in 486 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-31 21:43:12] [INFO ] Invariant cache hit.
[2024-05-31 21:43:12] [INFO ] State equation strengthened by 6396 read => feed constraints.
(s1822 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 1.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 1.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 1.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 1.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 1.0)
(s1803 1.0)
(s1804 0.0)
(s1805 0.0)
(s1806 1.0)
(s1807 1.0)
(s1808 0.0)
(s1809 0.0)
(s1810 1.0)
(s1811 1.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 0.0)
(s1820 0.0)
(s1821 1.0)
(s1822 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6477 unsolved
SMT process timed out in 35919ms, After SMT, problems are : Problem set: 0 solved, 6477 unsolved
Search for dead transitions found 0 dead transitions in 35968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104645 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 494 reset in 911 ms.
Product exploration explored 100000 steps with 498 reset in 978 ms.
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 165 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-31 21:43:50] [INFO ] Computed 42 invariants in 125 ms
[2024-05-31 21:43:52] [INFO ] Implicit Places using invariants in 1254 ms returned []
[2024-05-31 21:43:52] [INFO ] Invariant cache hit.
[2024-05-31 21:43:53] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-31 21:44:08] [INFO ] Implicit Places using invariants and state equation in 16306 ms returned []
Implicit Place search using SMT with State Equation took 17561 ms to find 0 implicit places.
[2024-05-31 21:44:08] [INFO ] Redundant transitions in 466 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:44:08] [INFO ] Invariant cache hit.
[2024-05-31 21:44:08] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34887ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34934ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53141 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-15 finished in 501649 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))||F((!p0&&X((F(p2)||G(!p0))))))))'
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((G((G(p1) U p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(F(p1)))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-040-LTLCardinality-08
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 786 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-31 21:44:45] [INFO ] Computed 42 invariants in 123 ms
[2024-05-31 21:44:46] [INFO ] Implicit Places using invariants in 1298 ms returned []
[2024-05-31 21:44:46] [INFO ] Invariant cache hit.
[2024-05-31 21:44:48] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:45:01] [INFO ] Implicit Places using invariants and state equation in 15007 ms returned []
Implicit Place search using SMT with State Equation took 16305 ms to find 0 implicit places.
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:45:01] [INFO ] Invariant cache hit.
[2024-05-31 21:45:01] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34809ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34857ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 51956 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08
Product exploration explored 100000 steps with 494 reset in 911 ms.
Product exploration explored 100000 steps with 496 reset in 948 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 32079 steps (157 resets) in 334 ms. (95 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 173 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2024-05-31 21:45:39] [INFO ] Invariant cache hit.
[2024-05-31 21:45:40] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2024-05-31 21:45:40] [INFO ] Invariant cache hit.
[2024-05-31 21:45:41] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-31 21:45:54] [INFO ] Implicit Places using invariants and state equation in 14579 ms returned []
Implicit Place search using SMT with State Equation took 15703 ms to find 0 implicit places.
[2024-05-31 21:45:55] [INFO ] Redundant transitions in 466 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-31 21:45:55] [INFO ] Invariant cache hit.
[2024-05-31 21:45:55] [INFO ] State equation strengthened by 4757 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-040, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505200123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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