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.r492-smll-171636266400196.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 EisenbergMcGuire-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717232049310

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:54:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:54:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:54:11] [INFO ] Load time of PNML (sax parser for PT used): 497 ms
[2024-06-01 08:54:11] [INFO ] Transformed 891 places.
[2024-06-01 08:54:11] [INFO ] Transformed 3888 transitions.
[2024-06-01 08:54:11] [INFO ] Found NUPN structural information;
[2024-06-01 08:54:12] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 755 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 823 transition count 3276
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 823 transition count 3276
Applied a total of 136 rules in 221 ms. Remains 823 /891 variables (removed 68) and now considering 3276/3888 (removed 612) transitions.
[2024-06-01 08:54:12] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
// Phase 1: matrix 1197 rows 823 cols
[2024-06-01 08:54:12] [INFO ] Computed 28 invariants in 52 ms
[2024-06-01 08:54:14] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2024-06-01 08:54:14] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-06-01 08:54:14] [INFO ] Invariant cache hit.
[2024-06-01 08:54:14] [INFO ] State equation strengthened by 388 read => feed constraints.
[2024-06-01 08:54:19] [INFO ] Implicit Places using invariants and state equation in 5727 ms returned []
Implicit Place search using SMT with State Equation took 7262 ms to find 0 implicit places.
Running 3267 sub problems to find dead transitions.
[2024-06-01 08:54:20] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-06-01 08:54:20] [INFO ] Invariant cache hit.
[2024-06-01 08:54:20] [INFO ] State equation strengthened by 388 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3267 unsolved
SMT process timed out in 33279ms, After SMT, problems are : Problem set: 0 solved, 3267 unsolved
Search for dead transitions found 0 dead transitions in 33389ms
Starting structural reductions in LTL mode, iteration 1 : 823/891 places, 3276/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40945 ms. Remains : 823/891 places, 3276/3888 transitions.
Support contains 60 out of 823 places after structural reductions.
[2024-06-01 08:54:54] [INFO ] Flatten gal took : 609 ms
[2024-06-01 08:54:54] [INFO ] Flatten gal took : 187 ms
[2024-06-01 08:54:55] [INFO ] Input system was already deterministic with 3276 transitions.
Support contains 57 out of 823 places (down from 60) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 36 to 34
RANDOM walk for 40000 steps (8 resets) in 3184 ms. (12 steps per ms) remains 26/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
[2024-06-01 08:54:56] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-06-01 08:54:56] [INFO ] Invariant cache hit.
[2024-06-01 08:54:56] [INFO ] State equation strengthened by 388 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 769/816 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/816 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 62 places in 967 ms of which 82 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 62 places in 1079 ms of which 9 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 176 places in 1162 ms of which 21 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 35 places in 897 ms of which 16 ms to minimize.
[2024-06-01 08:55:02] [INFO ] Deduced a trap composed of 176 places in 878 ms of which 8 ms to minimize.
SMT process timed out in 5636ms, After SMT, problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 18 place count 814 transition count 3019
Deduced a syphon composed of 248 places in 4 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 514 place count 566 transition count 3019
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 516 place count 564 transition count 3001
Iterating global reduction 2 with 2 rules applied. Total rules applied 518 place count 564 transition count 3001
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 11 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 492 transition count 2929
Applied a total of 662 rules in 589 ms. Remains 492 /823 variables (removed 331) and now considering 2929/3276 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 492/823 places, 2929/3276 transitions.
RANDOM walk for 40000 steps (8 resets) in 751 ms. (53 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 85480 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :5 out of 26
Probabilistic random walk after 85480 steps, saw 60321 distinct states, run finished after 3007 ms. (steps per millisecond=28 ) properties seen :5
[2024-06-01 08:55:06] [INFO ] Flow matrix only has 850 transitions (discarded 2079 similar events)
// Phase 1: matrix 850 rows 492 cols
[2024-06-01 08:55:06] [INFO ] Computed 28 invariants in 7 ms
[2024-06-01 08:55:06] [INFO ] State equation strengthened by 372 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 340/380 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 90/470 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:07] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 4 ms to minimize.
[2024-06-01 08:55:07] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 4 ms to minimize.
[2024-06-01 08:55:07] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:55:07] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:55:08] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2024-06-01 08:55:08] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2024-06-01 08:55:08] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:55:08] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 2 ms to minimize.
[2024-06-01 08:55:08] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:09] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 2 ms to minimize.
[2024-06-01 08:55:09] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:09] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 22/492 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 850/1342 variables, 492/532 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1342 variables, 372/904 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1342 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/1342 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 904 constraints, problems are : Problem set: 0 solved, 21 unsolved in 6267 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 492/492 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 340/380 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 90/470 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:13] [INFO ] Deduced a trap composed of 26 places in 415 ms of which 8 ms to minimize.
[2024-06-01 08:55:14] [INFO ] Deduced a trap composed of 18 places in 465 ms of which 9 ms to minimize.
[2024-06-01 08:55:14] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-06-01 08:55:14] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:55:14] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 08:55:15] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:55:15] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:55:15] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:55:15] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:55:15] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:55:15] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:55:15] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:16] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 2 ms to minimize.
[2024-06-01 08:55:16] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:55:16] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 22/492 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:17] [INFO ] Deduced a trap composed of 3 places in 579 ms of which 5 ms to minimize.
[2024-06-01 08:55:18] [INFO ] Deduced a trap composed of 98 places in 489 ms of which 4 ms to minimize.
[2024-06-01 08:55:18] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 7 ms to minimize.
[2024-06-01 08:55:19] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:55:19] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-06-01 08:55:20] [INFO ] Deduced a trap composed of 49 places in 451 ms of which 4 ms to minimize.
[2024-06-01 08:55:20] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 4 ms to minimize.
[2024-06-01 08:55:20] [INFO ] Deduced a trap composed of 99 places in 457 ms of which 5 ms to minimize.
[2024-06-01 08:55:21] [INFO ] Deduced a trap composed of 96 places in 381 ms of which 3 ms to minimize.
[2024-06-01 08:55:21] [INFO ] Deduced a trap composed of 88 places in 399 ms of which 4 ms to minimize.
[2024-06-01 08:55:22] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2024-06-01 08:55:22] [INFO ] Deduced a trap composed of 109 places in 427 ms of which 4 ms to minimize.
[2024-06-01 08:55:22] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 4 ms to minimize.
[2024-06-01 08:55:23] [INFO ] Deduced a trap composed of 97 places in 400 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:23] [INFO ] Deduced a trap composed of 19 places in 498 ms of which 4 ms to minimize.
[2024-06-01 08:55:24] [INFO ] Deduced a trap composed of 69 places in 485 ms of which 5 ms to minimize.
[2024-06-01 08:55:24] [INFO ] Deduced a trap composed of 88 places in 438 ms of which 4 ms to minimize.
[2024-06-01 08:55:25] [INFO ] Deduced a trap composed of 134 places in 464 ms of which 4 ms to minimize.
[2024-06-01 08:55:26] [INFO ] Deduced a trap composed of 105 places in 444 ms of which 5 ms to minimize.
[2024-06-01 08:55:26] [INFO ] Deduced a trap composed of 96 places in 439 ms of which 4 ms to minimize.
[2024-06-01 08:55:27] [INFO ] Deduced a trap composed of 109 places in 489 ms of which 4 ms to minimize.
[2024-06-01 08:55:27] [INFO ] Deduced a trap composed of 98 places in 438 ms of which 5 ms to minimize.
[2024-06-01 08:55:28] [INFO ] Deduced a trap composed of 102 places in 511 ms of which 4 ms to minimize.
[2024-06-01 08:55:28] [INFO ] Deduced a trap composed of 100 places in 399 ms of which 16 ms to minimize.
[2024-06-01 08:55:29] [INFO ] Deduced a trap composed of 138 places in 452 ms of which 5 ms to minimize.
[2024-06-01 08:55:29] [INFO ] Deduced a trap composed of 144 places in 478 ms of which 4 ms to minimize.
[2024-06-01 08:55:30] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 4 ms to minimize.
[2024-06-01 08:55:30] [INFO ] Deduced a trap composed of 113 places in 465 ms of which 4 ms to minimize.
[2024-06-01 08:55:31] [INFO ] Deduced a trap composed of 21 places in 487 ms of which 5 ms to minimize.
[2024-06-01 08:55:31] [INFO ] Deduced a trap composed of 85 places in 491 ms of which 5 ms to minimize.
[2024-06-01 08:55:31] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:32] [INFO ] Deduced a trap composed of 114 places in 485 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:33] [INFO ] Deduced a trap composed of 101 places in 412 ms of which 4 ms to minimize.
[2024-06-01 08:55:34] [INFO ] Deduced a trap composed of 100 places in 591 ms of which 5 ms to minimize.
[2024-06-01 08:55:35] [INFO ] Deduced a trap composed of 98 places in 585 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 850/1342 variables, 492/582 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 372/954 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1342 variables, 21/975 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:37] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1342 variables, 1/976 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1342 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:41] [INFO ] Deduced a trap composed of 77 places in 486 ms of which 5 ms to minimize.
[2024-06-01 08:55:42] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:55:42] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:55:43] [INFO ] Deduced a trap composed of 97 places in 432 ms of which 4 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1342 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:45] [INFO ] Deduced a trap composed of 40 places in 520 ms of which 5 ms to minimize.
[2024-06-01 08:55:46] [INFO ] Deduced a trap composed of 104 places in 472 ms of which 5 ms to minimize.
[2024-06-01 08:55:46] [INFO ] Deduced a trap composed of 98 places in 477 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1342 variables, 3/983 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:49] [INFO ] Deduced a trap composed of 101 places in 495 ms of which 5 ms to minimize.
[2024-06-01 08:55:50] [INFO ] Deduced a trap composed of 58 places in 473 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1342 variables, 2/985 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:55:52] [INFO ] Deduced a trap composed of 52 places in 431 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1342 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1342 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1342/1342 variables, and 986 constraints, problems are : Problem set: 0 solved, 21 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 492/492 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 73/73 constraints]
After SMT, in 51374ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 2929/2929 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 492 transition count 2926
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 489 transition count 2926
Applied a total of 6 rules in 198 ms. Remains 489 /492 variables (removed 3) and now considering 2926/2929 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 489/492 places, 2926/2929 transitions.
RANDOM walk for 40000 steps (8 resets) in 698 ms. (57 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 95600 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 21
Probabilistic random walk after 95600 steps, saw 66603 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 08:56:01] [INFO ] Flow matrix only has 847 transitions (discarded 2079 similar events)
// Phase 1: matrix 847 rows 489 cols
[2024-06-01 08:56:01] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 08:56:01] [INFO ] State equation strengthened by 372 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 338/378 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 89/467 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/489 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:02] [INFO ] Deduced a trap composed of 62 places in 438 ms of which 5 ms to minimize.
[2024-06-01 08:56:02] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 4 ms to minimize.
[2024-06-01 08:56:03] [INFO ] Deduced a trap composed of 30 places in 362 ms of which 3 ms to minimize.
[2024-06-01 08:56:03] [INFO ] Deduced a trap composed of 16 places in 350 ms of which 4 ms to minimize.
[2024-06-01 08:56:03] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 2 ms to minimize.
[2024-06-01 08:56:04] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:56:04] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 2 ms to minimize.
[2024-06-01 08:56:04] [INFO ] Deduced a trap composed of 3 places in 475 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 847/1336 variables, 489/525 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1336 variables, 372/897 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1336 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/1336 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 897 constraints, problems are : Problem set: 0 solved, 21 unsolved in 6237 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 489/489 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 338/378 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 89/467 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 3 ms to minimize.
[2024-06-01 08:56:09] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2024-06-01 08:56:09] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 3 ms to minimize.
[2024-06-01 08:56:09] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:56:09] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-06-01 08:56:10] [INFO ] Deduced a trap composed of 20 places in 439 ms of which 4 ms to minimize.
[2024-06-01 08:56:10] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 4 ms to minimize.
[2024-06-01 08:56:10] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2024-06-01 08:56:10] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:56:10] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:56:11] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 2 ms to minimize.
[2024-06-01 08:56:11] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2024-06-01 08:56:11] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:56:11] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-06-01 08:56:11] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:56:11] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:56:11] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:12] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 22/489 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:13] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 4 ms to minimize.
[2024-06-01 08:56:13] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:56:13] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-06-01 08:56:14] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-06-01 08:56:14] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:56:14] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
[2024-06-01 08:56:14] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:56:15] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:15] [INFO ] Deduced a trap composed of 93 places in 452 ms of which 5 ms to minimize.
[2024-06-01 08:56:16] [INFO ] Deduced a trap composed of 29 places in 441 ms of which 4 ms to minimize.
[2024-06-01 08:56:17] [INFO ] Deduced a trap composed of 44 places in 393 ms of which 5 ms to minimize.
[2024-06-01 08:56:17] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 4 ms to minimize.
[2024-06-01 08:56:17] [INFO ] Deduced a trap composed of 94 places in 401 ms of which 4 ms to minimize.
[2024-06-01 08:56:18] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 4 ms to minimize.
[2024-06-01 08:56:18] [INFO ] Deduced a trap composed of 96 places in 429 ms of which 4 ms to minimize.
[2024-06-01 08:56:19] [INFO ] Deduced a trap composed of 101 places in 396 ms of which 4 ms to minimize.
[2024-06-01 08:56:19] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 4 ms to minimize.
[2024-06-01 08:56:19] [INFO ] Deduced a trap composed of 99 places in 388 ms of which 5 ms to minimize.
[2024-06-01 08:56:20] [INFO ] Deduced a trap composed of 88 places in 397 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/489 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:20] [INFO ] Deduced a trap composed of 89 places in 466 ms of which 4 ms to minimize.
[2024-06-01 08:56:21] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:56:21] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:56:21] [INFO ] Deduced a trap composed of 26 places in 411 ms of which 4 ms to minimize.
[2024-06-01 08:56:22] [INFO ] Deduced a trap composed of 31 places in 388 ms of which 4 ms to minimize.
[2024-06-01 08:56:22] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 3 ms to minimize.
[2024-06-01 08:56:23] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/489 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:23] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/489 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:24] [INFO ] Deduced a trap composed of 91 places in 468 ms of which 5 ms to minimize.
[2024-06-01 08:56:24] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/489 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:25] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:26] [INFO ] Deduced a trap composed of 27 places in 433 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:27] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/489 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/489 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (OVERLAPS) 847/1336 variables, 489/576 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1336 variables, 372/948 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1336 variables, 21/969 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:30] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1336 variables, 1/970 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:31] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:56:32] [INFO ] Deduced a trap composed of 89 places in 402 ms of which 4 ms to minimize.
[2024-06-01 08:56:32] [INFO ] Deduced a trap composed of 81 places in 402 ms of which 4 ms to minimize.
[2024-06-01 08:56:33] [INFO ] Deduced a trap composed of 79 places in 360 ms of which 4 ms to minimize.
[2024-06-01 08:56:33] [INFO ] Deduced a trap composed of 80 places in 330 ms of which 5 ms to minimize.
[2024-06-01 08:56:33] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:56:33] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1336 variables, 7/977 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:35] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:56:36] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:56:36] [INFO ] Deduced a trap composed of 50 places in 472 ms of which 4 ms to minimize.
[2024-06-01 08:56:37] [INFO ] Deduced a trap composed of 38 places in 498 ms of which 5 ms to minimize.
[2024-06-01 08:56:38] [INFO ] Deduced a trap composed of 121 places in 501 ms of which 4 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1336 variables, 5/982 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:39] [INFO ] Deduced a trap composed of 70 places in 430 ms of which 4 ms to minimize.
[2024-06-01 08:56:40] [INFO ] Deduced a trap composed of 56 places in 441 ms of which 4 ms to minimize.
[2024-06-01 08:56:41] [INFO ] Deduced a trap composed of 100 places in 434 ms of which 4 ms to minimize.
[2024-06-01 08:56:41] [INFO ] Deduced a trap composed of 107 places in 416 ms of which 4 ms to minimize.
[2024-06-01 08:56:42] [INFO ] Deduced a trap composed of 80 places in 427 ms of which 4 ms to minimize.
[2024-06-01 08:56:42] [INFO ] Deduced a trap composed of 131 places in 422 ms of which 4 ms to minimize.
[2024-06-01 08:56:43] [INFO ] Deduced a trap composed of 88 places in 401 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1336 variables, 7/989 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1336 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:46] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:56:47] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 2 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/1336 variables, 2/991 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1336 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:56:52] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
At refinement iteration 32 (OVERLAPS) 0/1336 variables, 1/992 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1336 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 34 (OVERLAPS) 0/1336 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 992 constraints, problems are : Problem set: 0 solved, 21 unsolved in 50301 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 489/489 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 82/82 constraints]
After SMT, in 56619ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 2 properties in 4165 ms.
Support contains 37 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 2926/2926 transitions.
Applied a total of 0 rules in 116 ms. Remains 489 /489 variables (removed 0) and now considering 2926/2926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 489/489 places, 2926/2926 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 353 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-06-01 08:57:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 08:57:03] [INFO ] Computed 28 invariants in 6 ms
[2024-06-01 08:57:04] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2024-06-01 08:57:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 08:57:04] [INFO ] Invariant cache hit.
[2024-06-01 08:57:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 08:57:08] [INFO ] Implicit Places using invariants and state equation in 3707 ms returned []
Implicit Place search using SMT with State Equation took 4980 ms to find 0 implicit places.
[2024-06-01 08:57:08] [INFO ] Redundant transitions in 216 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 08:57:08] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 08:57:08] [INFO ] Invariant cache hit.
[2024-06-01 08:57:08] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32406ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32447ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38015 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 462 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-00 finished in 38860 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)||G(p1))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 241 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-06-01 08:57:41] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 08:57:41] [INFO ] Computed 28 invariants in 6 ms
[2024-06-01 08:57:42] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-06-01 08:57:42] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:57:42] [INFO ] Invariant cache hit.
[2024-06-01 08:57:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 08:57:45] [INFO ] Implicit Places using invariants and state equation in 3358 ms returned []
Implicit Place search using SMT with State Equation took 4183 ms to find 0 implicit places.
[2024-06-01 08:57:46] [INFO ] Redundant transitions in 257 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 08:57:46] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:57:46] [INFO ] Invariant cache hit.
[2024-06-01 08:57:46] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32541ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37282 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 550 ms.
Product exploration explored 100000 steps with 0 reset in 716 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 184 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 190450 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :3 out of 6
Probabilistic random walk after 190450 steps, saw 125141 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :3
[2024-06-01 08:58:23] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:58:23] [INFO ] Invariant cache hit.
[2024-06-01 08:58:23] [INFO ] State equation strengthened by 356 read => feed constraints.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1316 variables, 252/606 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1316 variables, 265/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 1 solved, 2 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 2/356 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 08:58:25] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 3 ms to minimize.
[2024-06-01 08:58:25] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 2 ms to minimize.
[2024-06-01 08:58:25] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 4 ms to minimize.
[2024-06-01 08:58:26] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 3 ms to minimize.
[2024-06-01 08:58:26] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 3 ms to minimize.
[2024-06-01 08:58:26] [INFO ] Deduced a trap composed of 55 places in 293 ms of which 3 ms to minimize.
[2024-06-01 08:58:27] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 4 ms to minimize.
[2024-06-01 08:58:27] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 3 ms to minimize.
[2024-06-01 08:58:27] [INFO ] Deduced a trap composed of 35 places in 332 ms of which 3 ms to minimize.
[2024-06-01 08:58:28] [INFO ] Deduced a trap composed of 19 places in 354 ms of which 3 ms to minimize.
[2024-06-01 08:58:28] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 3 ms to minimize.
[2024-06-01 08:58:29] [INFO ] Deduced a trap composed of 22 places in 338 ms of which 4 ms to minimize.
[2024-06-01 08:58:29] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 3 ms to minimize.
[2024-06-01 08:58:29] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 2 ms to minimize.
SMT process timed out in 5817ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 123 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 487/487 places, 2908/2908 transitions.
RANDOM walk for 40000 steps (8 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 191080 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 191080 steps, saw 125511 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-06-01 08:58:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:58:32] [INFO ] Invariant cache hit.
[2024-06-01 08:58:32] [INFO ] State equation strengthened by 356 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1316 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1316 variables, 265/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:58:34] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 2 ms to minimize.
[2024-06-01 08:58:34] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 3 ms to minimize.
[2024-06-01 08:58:35] [INFO ] Deduced a trap composed of 7 places in 343 ms of which 3 ms to minimize.
[2024-06-01 08:58:35] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 3 ms to minimize.
[2024-06-01 08:58:35] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 3 ms to minimize.
[2024-06-01 08:58:36] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 3 ms to minimize.
[2024-06-01 08:58:36] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 3 ms to minimize.
[2024-06-01 08:58:36] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 3 ms to minimize.
[2024-06-01 08:58:37] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 4 ms to minimize.
[2024-06-01 08:58:37] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 4 ms to minimize.
[2024-06-01 08:58:37] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 3 ms to minimize.
[2024-06-01 08:58:38] [INFO ] Deduced a trap composed of 22 places in 348 ms of which 3 ms to minimize.
[2024-06-01 08:58:38] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 3 ms to minimize.
[2024-06-01 08:58:38] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 2 ms to minimize.
[2024-06-01 08:58:39] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 2 ms to minimize.
[2024-06-01 08:58:39] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:58:39] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:58:39] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 2 ms to minimize.
[2024-06-01 08:58:39] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:58:39] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/938 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:58:40] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/938 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/938 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1316 variables, 252/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1316 variables, 265/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1316 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1316 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 894 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6902 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints]
After SMT, in 7688ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 477 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 147 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 134 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-06-01 08:58:41] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:58:41] [INFO ] Invariant cache hit.
[2024-06-01 08:58:42] [INFO ] Implicit Places using invariants in 931 ms returned []
[2024-06-01 08:58:42] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:58:42] [INFO ] Invariant cache hit.
[2024-06-01 08:58:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 08:58:45] [INFO ] Implicit Places using invariants and state equation in 3454 ms returned []
Implicit Place search using SMT with State Equation took 4391 ms to find 0 implicit places.
[2024-06-01 08:58:45] [INFO ] Redundant transitions in 103 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 08:58:45] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:58:45] [INFO ] Invariant cache hit.
[2024-06-01 08:58:45] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32508ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32549ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37196 ms. Remains : 487/487 places, 2908/2908 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2699 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 516
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 526 place count 148 transition count 355
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 596 place count 148 transition count 285
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 614 place count 139 transition count 300
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 139 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 139 transition count 283
Free-agglomeration rule applied 65 times.
Iterating global reduction 4 with 65 rules applied. Total rules applied 696 place count 139 transition count 218
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 761 place count 74 transition count 218
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 772 place count 74 transition count 218
Applied a total of 772 rules in 189 ms. Remains 74 /487 variables (removed 413) and now considering 218/2908 (removed 2690) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 74 cols
[2024-06-01 08:59:18] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 08:59:18] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-06-01 08:59:18] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 08:59:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-06-01 08:59:19] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 08:59:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:59:19] [INFO ] After 101ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 08:59:19] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-01 08:59:19] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:59:19] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:59:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
TRAPS : Iteration 1
[2024-06-01 08:59:19] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 08:59:19] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1045 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 284 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 3 out of 487 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 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 129 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-06-01 08:59:19] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 08:59:19] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 08:59:21] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2024-06-01 08:59:21] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:59:21] [INFO ] Invariant cache hit.
[2024-06-01 08:59:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 08:59:24] [INFO ] Implicit Places using invariants and state equation in 3307 ms returned []
Implicit Place search using SMT with State Equation took 4468 ms to find 0 implicit places.
[2024-06-01 08:59:24] [INFO ] Redundant transitions in 98 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 08:59:24] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:59:24] [INFO ] Invariant cache hit.
[2024-06-01 08:59:24] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32579ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32615ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37327 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 339430 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 339430 steps, saw 212293 distinct states, run finished after 3003 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 09:00:00] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:00:00] [INFO ] Invariant cache hit.
[2024-06-01 09:00:00] [INFO ] State equation strengthened by 356 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 296/411 variables, 115/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 32/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 168/579 variables, 77/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 32/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 281/860 variables, 14/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/874 variables, 7/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/874 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 442/1316 variables, 295/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1316 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 3 places in 831 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 281/860 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 124 places in 482 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/860 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/860 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 14/874 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/874 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:04] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 2 ms to minimize.
[2024-06-01 09:00:04] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 2 ms to minimize.
[2024-06-01 09:00:04] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 3 ms to minimize.
[2024-06-01 09:00:04] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 3 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 56 places in 575 ms of which 4 ms to minimize.
[2024-06-01 09:00:06] [INFO ] Deduced a trap composed of 41 places in 713 ms of which 3 ms to minimize.
[2024-06-01 09:00:06] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/1316 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 192/487 constraints, ReadFeed: 64/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 6190ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 240 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 486/487 places, 2907/2908 transitions.
RANDOM walk for 40000 steps (8 resets) in 373 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 342000 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 342000 steps, saw 213621 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 09:00:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:00:10] [INFO ] Computed 28 invariants in 6 ms
[2024-06-01 09:00:10] [INFO ] State equation strengthened by 356 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:10] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:11] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 441/1314 variables, 294/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 292/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:12] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-06-01 09:00:12] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:12] [INFO ] Deduced a trap composed of 60 places in 479 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2043 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2787ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 133 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 123 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:00:13] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:00:13] [INFO ] Invariant cache hit.
[2024-06-01 09:00:14] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-06-01 09:00:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:00:14] [INFO ] Invariant cache hit.
[2024-06-01 09:00:14] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:00:18] [INFO ] Implicit Places using invariants and state equation in 3874 ms returned []
Implicit Place search using SMT with State Equation took 4938 ms to find 0 implicit places.
[2024-06-01 09:00:18] [INFO ] Redundant transitions in 101 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:00:18] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:00:18] [INFO ] Invariant cache hit.
[2024-06-01 09:00:18] [INFO ] State equation strengthened by 356 read => feed constraints.
(s326 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.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 1.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 1.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 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 0.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 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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32349ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37558 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 52 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-06-01 09:00:50] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 09:00:50] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-06-01 09:00:50] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:00:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-06-01 09:00:51] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:00:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:00:51] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:00:51] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:00:51] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 341 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 312 ms.
Product exploration explored 100000 steps with 0 reset in 432 ms.
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 121 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
[2024-06-01 09:00:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:00:52] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 09:00:52] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-06-01 09:00:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:00:52] [INFO ] Invariant cache hit.
[2024-06-01 09:00:53] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:00:56] [INFO ] Implicit Places using invariants and state equation in 3931 ms returned []
Implicit Place search using SMT with State Equation took 4666 ms to find 0 implicit places.
[2024-06-01 09:00:56] [INFO ] Redundant transitions in 98 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:00:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:00:56] [INFO ] Invariant cache hit.
[2024-06-01 09:00:56] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32333ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32364ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/487 places, 2907/2908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37266 ms. Remains : 486/487 places, 2907/2908 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-01 finished in 228158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||(G(p2)&&p1)) U (!p3&&F(p4))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 42 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-06-01 09:01:29] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-06-01 09:01:29] [INFO ] Computed 28 invariants in 6 ms
[2024-06-01 09:01:30] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-06-01 09:01:30] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:01:30] [INFO ] Invariant cache hit.
[2024-06-01 09:01:31] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:01:38] [INFO ] Implicit Places using invariants and state equation in 7653 ms returned []
Implicit Place search using SMT with State Equation took 8436 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-06-01 09:01:38] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:01:38] [INFO ] Invariant cache hit.
[2024-06-01 09:01:38] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.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 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32575ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32611ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41099 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p4) p3), (NOT p0), (NOT p4), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 299 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-02 finished in 41784 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(p1))&&F(p2)&&p0)))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 43 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-06-01 09:02:11] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:02:11] [INFO ] Invariant cache hit.
[2024-06-01 09:02:12] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-06-01 09:02:12] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:02:12] [INFO ] Invariant cache hit.
[2024-06-01 09:02:13] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:02:20] [INFO ] Implicit Places using invariants and state equation in 7964 ms returned []
Implicit Place search using SMT with State Equation took 8971 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-06-01 09:02:20] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:02:20] [INFO ] Invariant cache hit.
[2024-06-01 09:02:20] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32578ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32614ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41641 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-03 finished in 41871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 50 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-06-01 09:02:53] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:02:53] [INFO ] Invariant cache hit.
[2024-06-01 09:02:54] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-06-01 09:02:54] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:02:54] [INFO ] Invariant cache hit.
[2024-06-01 09:02:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:03:01] [INFO ] Implicit Places using invariants and state equation in 7476 ms returned []
Implicit Place search using SMT with State Equation took 8468 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-06-01 09:03:01] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:03:01] [INFO ] Invariant cache hit.
[2024-06-01 09:03:01] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32801ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32843ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41386 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 362 ms.
Stack based approach found an accepted trace after 160 steps with 0 reset with depth 161 and stack size 161 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-04 finished in 41904 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 1 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 223 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-06-01 09:03:35] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 09:03:35] [INFO ] Computed 28 invariants in 19 ms
[2024-06-01 09:03:36] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2024-06-01 09:03:36] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:03:36] [INFO ] Invariant cache hit.
[2024-06-01 09:03:36] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:03:40] [INFO ] Implicit Places using invariants and state equation in 3792 ms returned []
Implicit Place search using SMT with State Equation took 4971 ms to find 0 implicit places.
[2024-06-01 09:03:40] [INFO ] Redundant transitions in 112 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 09:03:40] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:03:40] [INFO ] Invariant cache hit.
[2024-06-01 09:03:40] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32458ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37811 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 483 ms. (steps per millisecond=112 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 494 ms. (steps per millisecond=109 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 130 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-06-01 09:04:15] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:04:15] [INFO ] Invariant cache hit.
[2024-06-01 09:04:15] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-06-01 09:04:15] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:04:15] [INFO ] Invariant cache hit.
[2024-06-01 09:04:16] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:04:19] [INFO ] Implicit Places using invariants and state equation in 3664 ms returned []
Implicit Place search using SMT with State Equation took 4536 ms to find 0 implicit places.
[2024-06-01 09:04:19] [INFO ] Redundant transitions in 99 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 09:04:19] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:04:19] [INFO ] Invariant cache hit.
[2024-06-01 09:04:19] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.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 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 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.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 0.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 0.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 0.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 0.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 0.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 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 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32643ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32684ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37464 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 465 ms. (steps per millisecond=116 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 465 ms. (steps per millisecond=116 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 290 ms.
Product exploration explored 100000 steps with 0 reset in 336 ms.
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 108 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-06-01 09:04:54] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:04:54] [INFO ] Invariant cache hit.
[2024-06-01 09:04:55] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2024-06-01 09:04:55] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:04:55] [INFO ] Invariant cache hit.
[2024-06-01 09:04:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:04:59] [INFO ] Implicit Places using invariants and state equation in 3801 ms returned []
Implicit Place search using SMT with State Equation took 5267 ms to find 0 implicit places.
[2024-06-01 09:04:59] [INFO ] Redundant transitions in 98 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 09:04:59] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:04:59] [INFO ] Invariant cache hit.
[2024-06-01 09:04:59] [INFO ] State equation strengthened by 356 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/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32487ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32519ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38003 ms. Remains : 487/487 places, 2908/2908 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-05 finished in 117274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 42 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-06-01 09:05:32] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-06-01 09:05:32] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:05:33] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2024-06-01 09:05:33] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:05:33] [INFO ] Invariant cache hit.
[2024-06-01 09:05:34] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:05:40] [INFO ] Implicit Places using invariants and state equation in 6874 ms returned []
Implicit Place search using SMT with State Equation took 8085 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-06-01 09:05:40] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:05:40] [INFO ] Invariant cache hit.
[2024-06-01 09:05:40] [INFO ] State equation strengthened by 364 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/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32697ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32731ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40866 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 510 ms.
Product exploration explored 100000 steps with 0 reset in 497 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 151 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 98460 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 98460 steps, saw 77363 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-06-01 09:06:18] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:06:18] [INFO ] Invariant cache hit.
[2024-06-01 09:06:18] [INFO ] State equation strengthened by 364 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) 181/186 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/187 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/190 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 379/569 variables, 190/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 40/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/737 variables, 77/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 26/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 539/1276 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1276 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/1290 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1290 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 700/1990 variables, 553/914 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1990 variables, 298/1212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 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
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 181/186 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/187 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/190 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 379/569 variables, 190/197 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 40/237 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/737 variables, 77/314 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 26/340 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 539/1276 variables, 14/354 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1276 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/1290 variables, 7/361 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1290 variables, 3/364 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:06:20] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 5 ms to minimize.
[2024-06-01 09:06:21] [INFO ] Deduced a trap composed of 6 places in 455 ms of which 5 ms to minimize.
[2024-06-01 09:06:21] [INFO ] Deduced a trap composed of 52 places in 361 ms of which 4 ms to minimize.
[2024-06-01 09:06:21] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 4 ms to minimize.
[2024-06-01 09:06:22] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 3 ms to minimize.
[2024-06-01 09:06:22] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:06:22] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:06:22] [INFO ] Deduced a trap composed of 39 places in 578 ms of which 6 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 144 places in 574 ms of which 6 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 4 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 41 places in 619 ms of which 6 ms to minimize.
SMT process timed out in 6543ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 4 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 209 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 747 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 134250 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 3
Probabilistic random walk after 134250 steps, saw 91360 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 09:06:28] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:06:28] [INFO ] Computed 28 invariants in 7 ms
[2024-06-01 09:06:28] [INFO ] State equation strengthened by 364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 2 ms to minimize.
[2024-06-01 09:06:30] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 3 ms to minimize.
[2024-06-01 09:06:30] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2024-06-01 09:06:30] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:06:30] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-06-01 09:06:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:06:30] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:06:30] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 441/1324 variables, 294/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 292/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 893 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3169 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 3983ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2368 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 106 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 107 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:06:34] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:06:34] [INFO ] Invariant cache hit.
[2024-06-01 09:06:35] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-06-01 09:06:35] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:06:35] [INFO ] Invariant cache hit.
[2024-06-01 09:06:35] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:06:39] [INFO ] Implicit Places using invariants and state equation in 3848 ms returned []
Implicit Place search using SMT with State Equation took 4641 ms to find 0 implicit places.
[2024-06-01 09:06:39] [INFO ] Redundant transitions in 105 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:06:39] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:06:39] [INFO ] Invariant cache hit.
[2024-06-01 09:06:39] [INFO ] State equation strengthened by 364 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/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32679ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32713ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37580 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 37 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-06-01 09:07:12] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 09:07:12] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 09:07:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 09:07:12] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:07:12] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 09:07:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:07:12] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 09:07:12] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 09:07:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:07:12] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:07:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2024-06-01 09:07:12] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 1
[2024-06-01 09:07:12] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 09:07:12] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 525 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 181 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
[2024-06-01 09:07:13] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:07:13] [INFO ] Computed 28 invariants in 8 ms
[2024-06-01 09:07:14] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-06-01 09:07:14] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:07:14] [INFO ] Invariant cache hit.
[2024-06-01 09:07:14] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:07:17] [INFO ] Implicit Places using invariants and state equation in 3729 ms returned []
Implicit Place search using SMT with State Equation took 4531 ms to find 0 implicit places.
[2024-06-01 09:07:17] [INFO ] Redundant transitions in 105 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:07:17] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:07:17] [INFO ] Invariant cache hit.
[2024-06-01 09:07:17] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.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 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 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32089ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/820 places, 2916/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36954 ms. Remains : 487/820 places, 2916/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 368 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 106840 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 4
Probabilistic random walk after 106840 steps, saw 73877 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-01 09:07:53] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:07:53] [INFO ] Invariant cache hit.
[2024-06-01 09:07:53] [INFO ] State equation strengthened by 364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:07:54] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:07:55] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 2 ms to minimize.
[2024-06-01 09:07:55] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 2 ms to minimize.
[2024-06-01 09:07:55] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 3 ms to minimize.
[2024-06-01 09:07:56] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 2 ms to minimize.
[2024-06-01 09:07:56] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
[2024-06-01 09:07:56] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 2 ms to minimize.
[2024-06-01 09:07:56] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 1 ms to minimize.
[2024-06-01 09:07:56] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-06-01 09:07:57] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 09:07:57] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 3 ms to minimize.
[2024-06-01 09:07:57] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-06-01 09:07:57] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 12/309 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:07:57] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 441/1324 variables, 294/604 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 292/896 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 896 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3828 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4798ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1753 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 595 ms. (67 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 150020 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 3
Probabilistic random walk after 150020 steps, saw 99834 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 09:08:03] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:08:03] [INFO ] Invariant cache hit.
[2024-06-01 09:08:03] [INFO ] State equation strengthened by 364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:08:04] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:08:05] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 3 ms to minimize.
[2024-06-01 09:08:05] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 6 ms to minimize.
[2024-06-01 09:08:06] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 7 ms to minimize.
[2024-06-01 09:08:06] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 3 ms to minimize.
[2024-06-01 09:08:06] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 3 ms to minimize.
[2024-06-01 09:08:06] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 3 ms to minimize.
[2024-06-01 09:08:07] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 3 ms to minimize.
[2024-06-01 09:08:07] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 3 ms to minimize.
[2024-06-01 09:08:07] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 3 ms to minimize.
[2024-06-01 09:08:08] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
[2024-06-01 09:08:08] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 2 ms to minimize.
[2024-06-01 09:08:08] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 2 ms to minimize.
[2024-06-01 09:08:08] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2024-06-01 09:08:08] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2024-06-01 09:08:09] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 09:08:09] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:08:09] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-01 09:08:09] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 18/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:08:09] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 2 ms to minimize.
[2024-06-01 09:08:10] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 2 ms to minimize.
[2024-06-01 09:08:10] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 441/1324 variables, 294/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 292/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 904 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6597 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 22/22 constraints]
After SMT, in 7418ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 2550 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 106 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 607 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 186670 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 186670 steps, saw 122417 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 09:08:16] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:08:16] [INFO ] Invariant cache hit.
[2024-06-01 09:08:17] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:08:17] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:08:18] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 4 ms to minimize.
[2024-06-01 09:08:18] [INFO ] Deduced a trap composed of 47 places in 350 ms of which 3 ms to minimize.
[2024-06-01 09:08:19] [INFO ] Deduced a trap composed of 53 places in 358 ms of which 3 ms to minimize.
[2024-06-01 09:08:19] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 3 ms to minimize.
[2024-06-01 09:08:20] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 2 ms to minimize.
[2024-06-01 09:08:20] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 3 ms to minimize.
[2024-06-01 09:08:20] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 2 ms to minimize.
[2024-06-01 09:08:20] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 3 ms to minimize.
[2024-06-01 09:08:21] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 2 ms to minimize.
[2024-06-01 09:08:21] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2024-06-01 09:08:21] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 11/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 441/1324 variables, 294/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 292/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 893 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4375 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 5051ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1235 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 103 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 108 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:08:23] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:08:23] [INFO ] Invariant cache hit.
[2024-06-01 09:08:24] [INFO ] Implicit Places using invariants in 930 ms returned []
[2024-06-01 09:08:24] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:08:24] [INFO ] Invariant cache hit.
[2024-06-01 09:08:24] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:08:28] [INFO ] Implicit Places using invariants and state equation in 3840 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
[2024-06-01 09:08:28] [INFO ] Redundant transitions in 103 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:08:28] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:08:28] [INFO ] Invariant cache hit.
[2024-06-01 09:08:28] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32090ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37118 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 30 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-06-01 09:09:00] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 09:09:00] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:09:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-06-01 09:09:00] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:09:00] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:09:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:09:00] [INFO ] After 26ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:09:00] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:09:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-01 09:09:00] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:09:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2024-06-01 09:09:00] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:09:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-06-01 09:09:00] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:09:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 2
[2024-06-01 09:09:01] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 3
[2024-06-01 09:09:01] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:09:01] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 610 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 160 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 382 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 113 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:09:02] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:09:02] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:09:03] [INFO ] Implicit Places using invariants in 994 ms returned []
[2024-06-01 09:09:03] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:09:03] [INFO ] Invariant cache hit.
[2024-06-01 09:09:03] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:09:07] [INFO ] Implicit Places using invariants and state equation in 3860 ms returned []
Implicit Place search using SMT with State Equation took 4865 ms to find 0 implicit places.
[2024-06-01 09:09:07] [INFO ] Redundant transitions in 99 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:09:07] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:09:07] [INFO ] Invariant cache hit.
[2024-06-01 09:09:07] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 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 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32846ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32885ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37998 ms. Remains : 487/487 places, 2916/2916 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 247911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 40 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-06-01 09:09:40] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-06-01 09:09:40] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:09:41] [INFO ] Implicit Places using invariants in 916 ms returned []
[2024-06-01 09:09:41] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:09:41] [INFO ] Invariant cache hit.
[2024-06-01 09:09:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:09:47] [INFO ] Implicit Places using invariants and state equation in 6461 ms returned []
Implicit Place search using SMT with State Equation took 7415 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-06-01 09:09:47] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:09:47] [INFO ] Invariant cache hit.
[2024-06-01 09:09:47] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32618ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32670ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40134 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 51 reset in 509 ms.
Product exploration explored 100000 steps with 51 reset in 467 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 909 ms. (43 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
[2024-06-01 09:10:22] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:10:22] [INFO ] Invariant cache hit.
[2024-06-01 09:10:22] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/187 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/252 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/280 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 600/1990 variables, 474/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1990 variables, 271/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1245 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/187 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/252 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/280 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:10:25] [INFO ] Deduced a trap composed of 35 places in 429 ms of which 5 ms to minimize.
[2024-06-01 09:10:25] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 4 ms to minimize.
[2024-06-01 09:10:25] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 3 ms to minimize.
[2024-06-01 09:10:26] [INFO ] Deduced a trap composed of 54 places in 343 ms of which 4 ms to minimize.
[2024-06-01 09:10:26] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 4 ms to minimize.
[2024-06-01 09:10:26] [INFO ] Deduced a trap composed of 90 places in 345 ms of which 4 ms to minimize.
[2024-06-01 09:10:27] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 4 ms to minimize.
[2024-06-01 09:10:27] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 4 ms to minimize.
[2024-06-01 09:10:28] [INFO ] Deduced a trap composed of 51 places in 372 ms of which 4 ms to minimize.
[2024-06-01 09:10:28] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 4 ms to minimize.
[2024-06-01 09:10:28] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 4 ms to minimize.
[2024-06-01 09:10:29] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 3 ms to minimize.
SMT process timed out in 6403ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 184 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 488/820 places, 2917/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 762 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 172960 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 172960 steps, saw 113995 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 09:10:32] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-06-01 09:10:32] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:10:32] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:10:34] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 3 ms to minimize.
[2024-06-01 09:10:34] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 2 ms to minimize.
[2024-06-01 09:10:34] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 3 ms to minimize.
[2024-06-01 09:10:34] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 3 ms to minimize.
[2024-06-01 09:10:35] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 3 ms to minimize.
[2024-06-01 09:10:35] [INFO ] Deduced a trap composed of 47 places in 311 ms of which 3 ms to minimize.
[2024-06-01 09:10:35] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 3 ms to minimize.
[2024-06-01 09:10:36] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 2 ms to minimize.
[2024-06-01 09:10:36] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
[2024-06-01 09:10:36] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 2 ms to minimize.
[2024-06-01 09:10:36] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 2 ms to minimize.
[2024-06-01 09:10:36] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:10:37] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-06-01 09:10:37] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:10:37] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:10:37] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 16/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 378/1326 variables, 252/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1326 variables, 266/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:10:37] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1326 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1326 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4953 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 5723ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 414 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 164 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 104 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-06-01 09:10:38] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:10:38] [INFO ] Invariant cache hit.
[2024-06-01 09:10:39] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-06-01 09:10:39] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:10:39] [INFO ] Invariant cache hit.
[2024-06-01 09:10:40] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:10:43] [INFO ] Implicit Places using invariants and state equation in 3719 ms returned []
Implicit Place search using SMT with State Equation took 4685 ms to find 0 implicit places.
[2024-06-01 09:10:43] [INFO ] Redundant transitions in 104 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:10:43] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:10:43] [INFO ] Invariant cache hit.
[2024-06-01 09:10:43] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.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 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32092ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37026 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 27 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-06-01 09:11:15] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 09:11:15] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:11:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 09:11:15] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 09:11:16] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:11:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:11:16] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:11:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:11:16] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:11:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2024-06-01 09:11:16] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:11:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
TRAPS : Iteration 1
[2024-06-01 09:11:16] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:11:16] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 356 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 178 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2024-06-01 09:11:16] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-06-01 09:11:16] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:11:17] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-06-01 09:11:17] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:11:17] [INFO ] Invariant cache hit.
[2024-06-01 09:11:18] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:11:21] [INFO ] Implicit Places using invariants and state equation in 3809 ms returned []
Implicit Place search using SMT with State Equation took 4762 ms to find 0 implicit places.
[2024-06-01 09:11:21] [INFO ] Redundant transitions in 110 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:11:21] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:11:21] [INFO ] Invariant cache hit.
[2024-06-01 09:11:21] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.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 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 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 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 0.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 0.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 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32309ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32346ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/820 places, 2917/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37407 ms. Remains : 488/820 places, 2917/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 483 ms. (82 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2024-06-01 09:11:54] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:11:54] [INFO ] Invariant cache hit.
[2024-06-01 09:11:54] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:11:56] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 3 ms to minimize.
[2024-06-01 09:11:56] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 3 ms to minimize.
[2024-06-01 09:11:56] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 2 ms to minimize.
[2024-06-01 09:11:56] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 3 ms to minimize.
[2024-06-01 09:11:57] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 3 ms to minimize.
[2024-06-01 09:11:57] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 3 ms to minimize.
[2024-06-01 09:11:57] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 2 ms to minimize.
[2024-06-01 09:11:58] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 2 ms to minimize.
[2024-06-01 09:11:58] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 3 ms to minimize.
[2024-06-01 09:11:58] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 2 ms to minimize.
[2024-06-01 09:11:58] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 2 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 2 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-06-01 09:12:00] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 18/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 378/1326 variables, 252/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5738ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 104 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 829 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 201210 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 201210 steps, saw 130895 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 09:12:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:12:03] [INFO ] Invariant cache hit.
[2024-06-01 09:12:03] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 3 ms to minimize.
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 12 places in 363 ms of which 3 ms to minimize.
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 3 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 2 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 2 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 3 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 2 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 2 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 3 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 18/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 378/1326 variables, 252/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1326 variables, 266/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1326 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 900 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4897 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 5617ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 840 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 101 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 123 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-06-01 09:12:10] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:12:10] [INFO ] Invariant cache hit.
[2024-06-01 09:12:11] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-06-01 09:12:11] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:12:11] [INFO ] Invariant cache hit.
[2024-06-01 09:12:11] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:12:15] [INFO ] Implicit Places using invariants and state equation in 3842 ms returned []
Implicit Place search using SMT with State Equation took 4748 ms to find 0 implicit places.
[2024-06-01 09:12:15] [INFO ] Redundant transitions in 98 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:12:15] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:12:15] [INFO ] Invariant cache hit.
[2024-06-01 09:12:15] [INFO ] State equation strengthened by 364 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/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32108ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37117 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 31 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-06-01 09:12:47] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 09:12:47] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:12:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 09:12:47] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 09:12:47] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:12:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:12:47] [INFO ] After 22ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:12:47] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:12:47] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:12:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-06-01 09:12:47] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-06-01 09:12:47] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:12:47] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 522 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 90 reset in 318 ms.
Product exploration explored 100000 steps with 90 reset in 380 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 108 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-06-01 09:12:49] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-06-01 09:12:49] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:12:50] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-06-01 09:12:50] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:12:50] [INFO ] Invariant cache hit.
[2024-06-01 09:12:50] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:12:53] [INFO ] Implicit Places using invariants and state equation in 3708 ms returned []
Implicit Place search using SMT with State Equation took 4554 ms to find 0 implicit places.
[2024-06-01 09:12:53] [INFO ] Redundant transitions in 100 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:12:53] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:12:53] [INFO ] Invariant cache hit.
[2024-06-01 09:12:53] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32150ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32180ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36968 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 225830 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((p0||(!p1 U (p2||G(!p1)))))||(p0&&F(p3))||((!p1 U (p2||G(!p1)))&&F(p3))))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 194 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-06-01 09:13:26] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-06-01 09:13:26] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:13:27] [INFO ] Implicit Places using invariants in 753 ms returned []
[2024-06-01 09:13:27] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:13:27] [INFO ] Invariant cache hit.
[2024-06-01 09:13:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:13:30] [INFO ] Implicit Places using invariants and state equation in 3675 ms returned []
Implicit Place search using SMT with State Equation took 4442 ms to find 0 implicit places.
[2024-06-01 09:13:30] [INFO ] Redundant transitions in 111 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-06-01 09:13:30] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:13:30] [INFO ] Invariant cache hit.
[2024-06-01 09:13:31] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32092ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36881 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 368 ms.
Product exploration explored 100000 steps with 0 reset in 397 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 173 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 904 ms. (44 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 59270 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :2 out of 13
Probabilistic random walk after 59270 steps, saw 42803 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :2
[2024-06-01 09:14:09] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:14:09] [INFO ] Invariant cache hit.
[2024-06-01 09:14:09] [INFO ] State equation strengthened by 356 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, 11 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/329 variables, 6/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 602/931 variables, 329/348 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/931 variables, 166/514 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 0/514 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 72/1003 variables, 33/547 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 27/574 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 0/574 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 120/1123 variables, 6/580 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1123 variables, 0/580 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1129 variables, 3/583 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1129 variables, 0/583 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 189/1318 variables, 126/709 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1318 variables, 163/872 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 7 solved, 4 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-01 09:14:10] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:14:10] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/15 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 33/329 variables, 6/21 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-01 09:14:10] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/22 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 602/931 variables, 329/351 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/931 variables, 166/517 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 0/517 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 72/1003 variables, 33/550 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 27/577 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-01 09:14:11] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1003 variables, 1/578 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1003 variables, 0/578 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 120/1123 variables, 6/584 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1123 variables, 0/584 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 6/1129 variables, 3/587 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1129 variables, 4/591 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-01 09:14:12] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-06-01 09:14:12] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1129 variables, 2/593 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1129 variables, 0/593 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 189/1318 variables, 126/719 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 163/882 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 882 constraints, problems are : Problem set: 7 solved, 4 unsolved in 2962 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/11 constraints, Known Traps: 6/6 constraints]
After SMT, in 4248ms problems are : Problem set: 7 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1076 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 102 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 488/488 places, 2909/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 694 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 103460 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 103460 steps, saw 71200 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 09:14:17] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:14:17] [INFO ] Invariant cache hit.
[2024-06-01 09:14:17] [INFO ] State equation strengthened by 356 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/329 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 602/931 variables, 329/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/931 variables, 166/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 72/1003 variables, 33/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 27/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 120/1123 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1123 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1129 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1129 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 189/1318 variables, 126/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1318 variables, 163/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:19] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:14:19] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 33/329 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:19] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 602/931 variables, 329/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/931 variables, 166/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 72/1003 variables, 33/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 27/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:20] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1003 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1003 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 120/1123 variables, 6/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1123 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 6/1129 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1129 variables, 4/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:14:20] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:14:20] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1129 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1129 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 189/1318 variables, 126/719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 163/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2667 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 3800ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1662 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 124 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 119 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-06-01 09:14:23] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:14:23] [INFO ] Invariant cache hit.
[2024-06-01 09:14:24] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-06-01 09:14:24] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:14:24] [INFO ] Invariant cache hit.
[2024-06-01 09:14:24] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:14:28] [INFO ] Implicit Places using invariants and state equation in 3553 ms returned []
Implicit Place search using SMT with State Equation took 4426 ms to find 0 implicit places.
[2024-06-01 09:14:28] [INFO ] Redundant transitions in 98 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-06-01 09:14:28] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:14:28] [INFO ] Invariant cache hit.
[2024-06-01 09:14:28] [INFO ] State equation strengthened by 356 read => feed constraints.
(s387 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 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 0.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 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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32072ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36754 ms. Remains : 488/488 places, 2909/2909 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2647 edges and 488 vertex of which 81 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 416 transition count 520
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 322 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 321 transition count 519
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 191 place count 321 transition count 500
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 238 place count 293 transition count 500
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 518 place count 153 transition count 360
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 583 place count 153 transition count 295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 595 place count 147 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 601 place count 147 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 610 place count 147 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 685 place count 147 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 760 place count 72 transition count 205
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 769 place count 72 transition count 205
Applied a total of 769 rules in 27 ms. Remains 72 /488 variables (removed 416) and now considering 205/2909 (removed 2704) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 205 rows 72 cols
[2024-06-01 09:15:00] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:15:00] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 09:15:00] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 09:15:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 09:15:00] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 09:15:00] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 09:15:00] [INFO ] After 65ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:15:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
TRAPS : Iteration 1
[2024-06-01 09:15:00] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 09:15:00] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 653 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1))), (G (OR p1 p2 p3 p0)), (G (OR (NOT p1) p2 p3)), (G (OR (NOT p1) p2 p3 p0)), (G (OR p1 p2 p3)), (G (OR p1 p2 p3 (NOT p0))), (G (OR (NOT p1) p2 p0)), (G (OR (NOT p1) p2 p3 (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 34 factoid took 26 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-08 finished in 94780 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 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 193 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-06-01 09:15:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:15:01] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:15:02] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-06-01 09:15:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:15:02] [INFO ] Invariant cache hit.
[2024-06-01 09:15:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:15:05] [INFO ] Implicit Places using invariants and state equation in 3547 ms returned []
Implicit Place search using SMT with State Equation took 4428 ms to find 0 implicit places.
[2024-06-01 09:15:05] [INFO ] Redundant transitions in 111 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:15:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:15:05] [INFO ] Invariant cache hit.
[2024-06-01 09:15:05] [INFO ] State equation strengthened by 356 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/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32075ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36844 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 309 ms.
Product exploration explored 100000 steps with 0 reset in 376 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 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 341050 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 341050 steps, saw 213200 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 09:15:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:15:41] [INFO ] Invariant cache hit.
[2024-06-01 09:15:41] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:42] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:42] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:43] [INFO ] Deduced a trap composed of 43 places in 482 ms of which 4 ms to minimize.
[2024-06-01 09:15:43] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 3 ms to minimize.
[2024-06-01 09:15:44] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 3 ms to minimize.
[2024-06-01 09:15:44] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 3 ms to minimize.
[2024-06-01 09:15:44] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 2 ms to minimize.
[2024-06-01 09:15:44] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 3 ms to minimize.
[2024-06-01 09:15:45] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:45] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:45] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3445 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4095ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 105 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 343780 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 343780 steps, saw 214739 distinct states, run finished after 3002 ms. (steps per millisecond=114 ) properties seen :0
[2024-06-01 09:15:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:15:49] [INFO ] Invariant cache hit.
[2024-06-01 09:15:49] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:49] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:49] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 43 places in 490 ms of which 5 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 3 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 3 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 3 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 3 ms to minimize.
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 3 ms to minimize.
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3401 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4019ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 101 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 101 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:15:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:15:53] [INFO ] Invariant cache hit.
[2024-06-01 09:15:54] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-06-01 09:15:54] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:15:54] [INFO ] Invariant cache hit.
[2024-06-01 09:15:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:15:57] [INFO ] Implicit Places using invariants and state equation in 3506 ms returned []
Implicit Place search using SMT with State Equation took 4442 ms to find 0 implicit places.
[2024-06-01 09:15:57] [INFO ] Redundant transitions in 97 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:15:57] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:15:57] [INFO ] Invariant cache hit.
[2024-06-01 09:15:58] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.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 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 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 0.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 0.0)
(s241 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32083ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36783 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 36 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-06-01 09:16:30] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:16:30] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:16:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 09:16:30] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:16:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 09:16:30] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:16:30] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:16:30] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:16:30] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:16:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 111 ms
TRAPS : Iteration 1
[2024-06-01 09:16:30] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:16:30] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 386 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 107 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:16:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:16:30] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:16:31] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-06-01 09:16:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:16:31] [INFO ] Invariant cache hit.
[2024-06-01 09:16:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:16:35] [INFO ] Implicit Places using invariants and state equation in 3607 ms returned []
Implicit Place search using SMT with State Equation took 4420 ms to find 0 implicit places.
[2024-06-01 09:16:35] [INFO ] Redundant transitions in 98 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:16:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:16:35] [INFO ] Invariant cache hit.
[2024-06-01 09:16:35] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 28 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2024-06-01 09:17:11] [INFO ] Deduced a trap composed of 3 places in 447 ms of which 5 ms to minimize.
[2024-06-01 09:17:11] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 2 ms to minimize.
[2024-06-01 09:17:11] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 2 ms to minimize.
[2024-06-01 09:17:11] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 2 ms to minimize.
[2024-06-01 09:17:12] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-06-01 09:17:12] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:17:12] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:17:12] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 3 ms to minimize.
[2024-06-01 09:17:14] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 3 ms to minimize.
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 74 places in 305 ms of which 3 ms to minimize.
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 49 places in 306 ms of which 4 ms to minimize.
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 3 ms to minimize.
[2024-06-01 09:17:16] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 3 ms to minimize.
[2024-06-01 09:17:16] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 3 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 69 places in 323 ms of which 4 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 4 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 61 places in 293 ms of which 3 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 53 places in 279 ms of which 3 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 49 places in 324 ms of which 3 ms to minimize.
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 50 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2024-06-01 09:17:26] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:17:26] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 3 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 3 ms to minimize.
[2024-06-01 09:17:28] [INFO ] Deduced a trap composed of 55 places in 302 ms of which 3 ms to minimize.
[2024-06-01 09:17:28] [INFO ] Deduced a trap composed of 77 places in 292 ms of which 3 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 79 places in 287 ms of which 4 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 3 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 3 ms to minimize.
[2024-06-01 09:17:34] [INFO ] Deduced a trap composed of 63 places in 346 ms of which 3 ms to minimize.
[2024-06-01 09:17:34] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 3 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 63 places in 352 ms of which 4 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 66 places in 362 ms of which 4 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 19 places in 402 ms of which 4 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 21 places in 392 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 62 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 34/34 constraints]
After SMT, in 62329ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 62358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66991 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 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 342480 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 342480 steps, saw 213938 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-06-01 09:17:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:17:40] [INFO ] Invariant cache hit.
[2024-06-01 09:17:40] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:41] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:41] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:42] [INFO ] Deduced a trap composed of 43 places in 467 ms of which 4 ms to minimize.
[2024-06-01 09:17:42] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 3 ms to minimize.
[2024-06-01 09:17:43] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 2 ms to minimize.
[2024-06-01 09:17:43] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 2 ms to minimize.
[2024-06-01 09:17:43] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 2 ms to minimize.
[2024-06-01 09:17:44] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 3 ms to minimize.
[2024-06-01 09:17:44] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:44] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:44] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3443 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4104ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 104 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346460 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346460 steps, saw 216372 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 09:17:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:17:48] [INFO ] Invariant cache hit.
[2024-06-01 09:17:48] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:49] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:49] [INFO ] Deduced a trap composed of 43 places in 459 ms of which 4 ms to minimize.
[2024-06-01 09:17:50] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 3 ms to minimize.
[2024-06-01 09:17:50] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 3 ms to minimize.
[2024-06-01 09:17:50] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 2 ms to minimize.
[2024-06-01 09:17:51] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 2 ms to minimize.
[2024-06-01 09:17:51] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 2 ms to minimize.
[2024-06-01 09:17:51] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:51] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:51] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3389 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3996ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 101 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 101 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:17:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:17:52] [INFO ] Invariant cache hit.
[2024-06-01 09:17:53] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-06-01 09:17:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:17:53] [INFO ] Invariant cache hit.
[2024-06-01 09:17:53] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:17:56] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 4329 ms to find 0 implicit places.
[2024-06-01 09:17:56] [INFO ] Redundant transitions in 98 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:17:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:17:56] [INFO ] Invariant cache hit.
[2024-06-01 09:17:56] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 28 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2024-06-01 09:18:32] [INFO ] Deduced a trap composed of 3 places in 487 ms of which 4 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 3 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 2 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:18:34] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 3 ms to minimize.
[2024-06-01 09:18:36] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 3 ms to minimize.
[2024-06-01 09:18:36] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 3 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 49 places in 301 ms of which 3 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 61 places in 281 ms of which 7 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 52 places in 282 ms of which 3 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 3 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 69 places in 309 ms of which 4 ms to minimize.
[2024-06-01 09:18:39] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 4 ms to minimize.
[2024-06-01 09:18:39] [INFO ] Deduced a trap composed of 61 places in 294 ms of which 3 ms to minimize.
[2024-06-01 09:18:39] [INFO ] Deduced a trap composed of 53 places in 272 ms of which 4 ms to minimize.
[2024-06-01 09:18:40] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 4 ms to minimize.
[2024-06-01 09:18:40] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2024-06-01 09:18:48] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2024-06-01 09:18:49] [INFO ] Deduced a trap composed of 49 places in 448 ms of which 5 ms to minimize.
[2024-06-01 09:18:49] [INFO ] Deduced a trap composed of 11 places in 463 ms of which 6 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 55 places in 445 ms of which 5 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 77 places in 498 ms of which 6 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 79 places in 471 ms of which 5 ms to minimize.
[2024-06-01 09:18:55] [INFO ] Deduced a trap composed of 30 places in 450 ms of which 5 ms to minimize.
[2024-06-01 09:18:55] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 3 ms to minimize.
[2024-06-01 09:18:59] [INFO ] Deduced a trap composed of 63 places in 304 ms of which 7 ms to minimize.
SMT process timed out in 62178ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 62208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66745 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 34 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-06-01 09:18:59] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:18:59] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:18:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-01 09:18:59] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:18:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 09:18:59] [INFO ] After 22ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:18:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:18:59] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:18:59] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:18:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 102 ms
TRAPS : Iteration 1
[2024-06-01 09:18:59] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:18:59] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 411 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 451 ms.
Product exploration explored 100000 steps with 0 reset in 351 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 101 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:19:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:19:00] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:19:01] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2024-06-01 09:19:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:19:01] [INFO ] Invariant cache hit.
[2024-06-01 09:19:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:19:07] [INFO ] Implicit Places using invariants and state equation in 5333 ms returned []
Implicit Place search using SMT with State Equation took 6545 ms to find 0 implicit places.
[2024-06-01 09:19:07] [INFO ] Redundant transitions in 144 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:19:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:19:07] [INFO ] Invariant cache hit.
[2024-06-01 09:19:07] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32370ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32416ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39222 ms. Remains : 486/486 places, 2907/2907 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-09 finished in 278954 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 3 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 322 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-06-01 09:19:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:19:40] [INFO ] Invariant cache hit.
[2024-06-01 09:19:41] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2024-06-01 09:19:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:19:41] [INFO ] Invariant cache hit.
[2024-06-01 09:19:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:19:46] [INFO ] Implicit Places using invariants and state equation in 4787 ms returned []
Implicit Place search using SMT with State Equation took 6085 ms to find 0 implicit places.
[2024-06-01 09:19:46] [INFO ] Redundant transitions in 109 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:19:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:19:46] [INFO ] Invariant cache hit.
[2024-06-01 09:19:46] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32097ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38655 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 552 ms.
Product exploration explored 100000 steps with 0 reset in 457 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 322460 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 322460 steps, saw 202749 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-06-01 09:20:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:20:22] [INFO ] Invariant cache hit.
[2024-06-01 09:20:22] [INFO ] State equation strengthened by 356 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:20:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:20:24] [INFO ] Deduced a trap composed of 3 places in 551 ms of which 5 ms to minimize.
[2024-06-01 09:20:25] [INFO ] Deduced a trap composed of 3 places in 564 ms of which 5 ms to minimize.
[2024-06-01 09:20:26] [INFO ] Deduced a trap composed of 37 places in 537 ms of which 5 ms to minimize.
[2024-06-01 09:20:26] [INFO ] Deduced a trap composed of 12 places in 562 ms of which 6 ms to minimize.
[2024-06-01 09:20:27] [INFO ] Deduced a trap composed of 25 places in 555 ms of which 5 ms to minimize.
[2024-06-01 09:20:27] [INFO ] Deduced a trap composed of 33 places in 571 ms of which 6 ms to minimize.
[2024-06-01 09:20:28] [INFO ] Deduced a trap composed of 3 places in 518 ms of which 5 ms to minimize.
[2024-06-01 09:20:28] [INFO ] Deduced a trap composed of 29 places in 502 ms of which 4 ms to minimize.
SMT process timed out in 6042ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 172 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 304990 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 304990 steps, saw 192695 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-06-01 09:20:32] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:20:32] [INFO ] Invariant cache hit.
[2024-06-01 09:20:32] [INFO ] State equation strengthened by 356 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:20:32] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:20:34] [INFO ] Deduced a trap composed of 3 places in 556 ms of which 5 ms to minimize.
[2024-06-01 09:20:34] [INFO ] Deduced a trap composed of 3 places in 530 ms of which 5 ms to minimize.
[2024-06-01 09:20:35] [INFO ] Deduced a trap composed of 37 places in 565 ms of which 5 ms to minimize.
[2024-06-01 09:20:35] [INFO ] Deduced a trap composed of 12 places in 467 ms of which 5 ms to minimize.
[2024-06-01 09:20:36] [INFO ] Deduced a trap composed of 25 places in 568 ms of which 5 ms to minimize.
[2024-06-01 09:20:37] [INFO ] Deduced a trap composed of 33 places in 572 ms of which 6 ms to minimize.
[2024-06-01 09:20:37] [INFO ] Deduced a trap composed of 3 places in 536 ms of which 7 ms to minimize.
[2024-06-01 09:20:38] [INFO ] Deduced a trap composed of 29 places in 524 ms of which 5 ms to minimize.
[2024-06-01 09:20:38] [INFO ] Deduced a trap composed of 21 places in 507 ms of which 4 ms to minimize.
[2024-06-01 09:20:39] [INFO ] Deduced a trap composed of 44 places in 529 ms of which 6 ms to minimize.
[2024-06-01 09:20:39] [INFO ] Deduced a trap composed of 42 places in 514 ms of which 5 ms to minimize.
[2024-06-01 09:20:40] [INFO ] Deduced a trap composed of 35 places in 523 ms of which 5 ms to minimize.
[2024-06-01 09:20:40] [INFO ] Deduced a trap composed of 35 places in 437 ms of which 5 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 25 places in 382 ms of which 4 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 24 places in 492 ms of which 5 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 16 places in 406 ms of which 4 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 3 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 19/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 441/1314 variables, 294/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 292/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10542 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 11534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 259 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 170 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 158 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:20:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:20:44] [INFO ] Invariant cache hit.
[2024-06-01 09:20:45] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-06-01 09:20:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:20:45] [INFO ] Invariant cache hit.
[2024-06-01 09:20:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:20:50] [INFO ] Implicit Places using invariants and state equation in 5076 ms returned []
Implicit Place search using SMT with State Equation took 6394 ms to find 0 implicit places.
[2024-06-01 09:20:50] [INFO ] Redundant transitions in 137 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:20:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:20:50] [INFO ] Invariant cache hit.
[2024-06-01 09:20:50] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32200ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32241ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38944 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 32 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-06-01 09:21:23] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 09:21:23] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 09:21:23] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:21:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:21:23] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:21:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:21:23] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:21:23] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:21:23] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 381 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 172 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:21:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:21:23] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 09:21:25] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2024-06-01 09:21:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:21:25] [INFO ] Invariant cache hit.
[2024-06-01 09:21:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:21:29] [INFO ] Implicit Places using invariants and state equation in 4875 ms returned []
Implicit Place search using SMT with State Equation took 6049 ms to find 0 implicit places.
[2024-06-01 09:21:30] [INFO ] Redundant transitions in 157 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:21:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:21:30] [INFO ] Invariant cache hit.
[2024-06-01 09:21:30] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32272ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32320ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38709 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 318850 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 318850 steps, saw 200669 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 09:22:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:22:05] [INFO ] Invariant cache hit.
[2024-06-01 09:22:05] [INFO ] State equation strengthened by 356 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 3 places in 531 ms of which 5 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 3 places in 545 ms of which 5 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 37 places in 569 ms of which 5 ms to minimize.
[2024-06-01 09:22:09] [INFO ] Deduced a trap composed of 12 places in 564 ms of which 6 ms to minimize.
[2024-06-01 09:22:09] [INFO ] Deduced a trap composed of 25 places in 551 ms of which 5 ms to minimize.
[2024-06-01 09:22:10] [INFO ] Deduced a trap composed of 33 places in 554 ms of which 5 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 3 places in 505 ms of which 5 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 29 places in 475 ms of which 5 ms to minimize.
SMT process timed out in 5903ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 323840 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 323840 steps, saw 203681 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-06-01 09:22:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:22:14] [INFO ] Invariant cache hit.
[2024-06-01 09:22:14] [INFO ] State equation strengthened by 356 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 3 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 3 places in 439 ms of which 4 ms to minimize.
[2024-06-01 09:22:17] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 3 ms to minimize.
[2024-06-01 09:22:17] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 3 ms to minimize.
[2024-06-01 09:22:17] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 3 ms to minimize.
[2024-06-01 09:22:18] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 5 ms to minimize.
[2024-06-01 09:22:18] [INFO ] Deduced a trap composed of 3 places in 441 ms of which 3 ms to minimize.
[2024-06-01 09:22:19] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 3 ms to minimize.
[2024-06-01 09:22:19] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 3 ms to minimize.
[2024-06-01 09:22:19] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 3 ms to minimize.
[2024-06-01 09:22:20] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 5 ms to minimize.
[2024-06-01 09:22:20] [INFO ] Deduced a trap composed of 35 places in 470 ms of which 4 ms to minimize.
[2024-06-01 09:22:20] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 3 ms to minimize.
[2024-06-01 09:22:21] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 2 ms to minimize.
[2024-06-01 09:22:21] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 3 ms to minimize.
[2024-06-01 09:22:21] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 4 ms to minimize.
[2024-06-01 09:22:22] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
[2024-06-01 09:22:22] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 2 ms to minimize.
[2024-06-01 09:22:22] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 19/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 441/1314 variables, 294/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 292/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:22:23] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8230 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 8896ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 236 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 164 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:22:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:22:24] [INFO ] Invariant cache hit.
[2024-06-01 09:22:25] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-06-01 09:22:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:22:25] [INFO ] Invariant cache hit.
[2024-06-01 09:22:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:22:29] [INFO ] Implicit Places using invariants and state equation in 3790 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
[2024-06-01 09:22:29] [INFO ] Redundant transitions in 140 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:22:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:22:29] [INFO ] Invariant cache hit.
[2024-06-01 09:22:29] [INFO ] State equation strengthened by 356 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/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32330ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37465 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 52 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-06-01 09:23:01] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:23:01] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:23:01] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:23:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-01 09:23:02] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:23:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:23:02] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:23:02] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:23:02] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 458 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 478 ms.
Product exploration explored 100000 steps with 0 reset in 549 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 181 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-06-01 09:23:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:23:03] [INFO ] Computed 28 invariants in 7 ms
[2024-06-01 09:23:04] [INFO ] Implicit Places using invariants in 1335 ms returned []
[2024-06-01 09:23:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:23:04] [INFO ] Invariant cache hit.
[2024-06-01 09:23:05] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:23:10] [INFO ] Implicit Places using invariants and state equation in 5081 ms returned []
Implicit Place search using SMT with State Equation took 6418 ms to find 0 implicit places.
[2024-06-01 09:23:10] [INFO ] Redundant transitions in 156 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:23:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:23:10] [INFO ] Invariant cache hit.
[2024-06-01 09:23:10] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32421ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32475ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39248 ms. Remains : 486/486 places, 2907/2907 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-10 finished in 242883 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(((!p1 U (G(!p1)||(!p1&&G(!p2))))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 65 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-06-01 09:23:42] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-06-01 09:23:42] [INFO ] Computed 28 invariants in 6 ms
[2024-06-01 09:23:44] [INFO ] Implicit Places using invariants in 1451 ms returned []
[2024-06-01 09:23:44] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:23:44] [INFO ] Invariant cache hit.
[2024-06-01 09:23:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:23:53] [INFO ] Implicit Places using invariants and state equation in 8697 ms returned []
Implicit Place search using SMT with State Equation took 10152 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-06-01 09:23:53] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:23:53] [INFO ] Invariant cache hit.
[2024-06-01 09:23:53] [INFO ] State equation strengthened by 356 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/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32424ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32456ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42677 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 481 ms.
Product exploration explored 100000 steps with 0 reset in 493 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 191 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[true, p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
RANDOM walk for 40000 steps (8 resets) in 666 ms. (59 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
[2024-06-01 09:24:28] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-06-01 09:24:28] [INFO ] Invariant cache hit.
[2024-06-01 09:24:28] [INFO ] State equation strengthened by 356 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 86/90 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 09:24:28] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 56/270 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 387/657 variables, 270/280 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 24/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 105/762 variables, 9/313 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 1/314 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/762 variables, 33/347 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 144/906 variables, 66/413 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/906 variables, 28/441 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/906 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 462/1368 variables, 12/453 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1368 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 12/1380 variables, 6/459 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1380 variables, 0/459 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 600/1980 variables, 474/933 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1980 variables, 271/1204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1980 variables, 0/1204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/1980 variables, 0/1204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 1204 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 819/819 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/90 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem apf4 is UNSAT
At refinement iteration 6 (OVERLAPS) 56/270 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 09:24:30] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 3 ms to minimize.
[2024-06-01 09:24:31] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 387/657 variables, 270/282 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 24/306 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 4/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 105/762 variables, 9/319 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 1/320 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/762 variables, 33/353 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/762 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 144/906 variables, 66/419 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 28/447 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/447 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 462/1368 variables, 12/459 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1368 variables, 0/459 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/1380 variables, 6/465 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 09:24:33] [INFO ] Deduced a trap composed of 147 places in 1367 ms of which 12 ms to minimize.
[2024-06-01 09:24:35] [INFO ] Deduced a trap composed of 165 places in 1299 ms of which 12 ms to minimize.
[2024-06-01 09:24:36] [INFO ] Deduced a trap composed of 141 places in 1145 ms of which 12 ms to minimize.
SMT process timed out in 8300ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 3240/3240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 819 transition count 3231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 810 transition count 3231
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 810 transition count 2981
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 488 transition count 2909
Applied a total of 662 rules in 274 ms. Remains 488 /819 variables (removed 331) and now considering 2909/3240 (removed 331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 488/819 places, 2909/3240 transitions.
RANDOM walk for 40000 steps (8 resets) in 2550 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 72240 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 4
Probabilistic random walk after 72240 steps, saw 52013 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-06-01 09:24:40] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-06-01 09:24:40] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 09:24:40] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 105/544 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 33/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 144/688 variables, 66/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 33/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 240/928 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 12/940 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/940 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 378/1318 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 266/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 278/439 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 24/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 105/544 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 33/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 144/688 variables, 66/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/688 variables, 33/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/688 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 240/928 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/928 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 12/940 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:24:44] [INFO ] Deduced a trap composed of 105 places in 859 ms of which 7 ms to minimize.
[2024-06-01 09:24:45] [INFO ] Deduced a trap composed of 94 places in 879 ms of which 8 ms to minimize.
[2024-06-01 09:24:46] [INFO ] Deduced a trap composed of 92 places in 799 ms of which 8 ms to minimize.
[2024-06-01 09:24:47] [INFO ] Deduced a trap composed of 97 places in 890 ms of which 7 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/940 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/940 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 378/1318 variables, 252/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 266/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:24:48] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 4 ms to minimize.
[2024-06-01 09:24:48] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 3 ms to minimize.
[2024-06-01 09:24:49] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 2 ms to minimize.
[2024-06-01 09:24:49] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:24:49] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 5/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1318 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1318 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 886 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7946 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 9469ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1086 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 165 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 165 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-06-01 09:24:51] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:24:51] [INFO ] Invariant cache hit.
[2024-06-01 09:24:53] [INFO ] Implicit Places using invariants in 1335 ms returned []
[2024-06-01 09:24:53] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:24:53] [INFO ] Invariant cache hit.
[2024-06-01 09:24:53] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:24:57] [INFO ] Implicit Places using invariants and state equation in 4432 ms returned []
Implicit Place search using SMT with State Equation took 5777 ms to find 0 implicit places.
[2024-06-01 09:24:57] [INFO ] Redundant transitions in 157 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-06-01 09:24:57] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:24:57] [INFO ] Invariant cache hit.
[2024-06-01 09:24:57] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32265ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38430 ms. Remains : 488/488 places, 2909/2909 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2721 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 519
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 519
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 319 transition count 501
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 241 place count 293 transition count 501
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 527 place count 150 transition count 358
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 599 place count 150 transition count 286
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 613 place count 143 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 620 place count 143 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 626 place count 143 transition count 274
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 697 place count 143 transition count 203
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 768 place count 72 transition count 203
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 776 place count 72 transition count 203
Applied a total of 776 rules in 44 ms. Remains 72 /488 variables (removed 416) and now considering 203/2909 (removed 2706) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 203 rows 72 cols
[2024-06-01 09:25:30] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 09:25:30] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 09:25:30] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:25:30] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 09:25:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 09:25:30] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:25:30] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 09:25:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:25:30] [INFO ] After 52ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 09:25:30] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 09:25:30] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 545 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (OR p0 (NOT p1))))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 20 factoid took 562 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Support contains 2 out of 819 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 : 819/819 places, 3240/3240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 819 transition count 3231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 810 transition count 3231
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 810 transition count 2981
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 488 transition count 2909
Applied a total of 662 rules in 293 ms. Remains 488 /819 variables (removed 331) and now considering 2909/3240 (removed 331) transitions.
[2024-06-01 09:25:31] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-06-01 09:25:31] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:25:32] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-06-01 09:25:32] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:25:32] [INFO ] Invariant cache hit.
[2024-06-01 09:25:33] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:25:37] [INFO ] Implicit Places using invariants and state equation in 4360 ms returned []
Implicit Place search using SMT with State Equation took 5561 ms to find 0 implicit places.
[2024-06-01 09:25:37] [INFO ] Redundant transitions in 105 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-06-01 09:25:37] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:25:37] [INFO ] Invariant cache hit.
[2024-06-01 09:25:37] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.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 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.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 1.0)
(s114 0.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(timeout
s164 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32646ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32674ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/819 places, 2909/3240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38643 ms. Remains : 488/819 places, 2909/3240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 66 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 343040 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 343040 steps, saw 216615 distinct states, run finished after 3004 ms. (steps per millisecond=114 ) properties seen :0
[2024-06-01 09:26:13] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:26:13] [INFO ] Invariant cache hit.
[2024-06-01 09:26:13] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 186/294 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/415 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/583 variables, 77/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 32/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/863 variables, 14/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/863 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/877 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/877 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1318 variables, 294/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 292/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:26:14] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/294 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/415 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/583 variables, 77/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 32/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/863 variables, 14/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/863 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/877 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/877 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1318 variables, 294/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1318 variables, 292/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 156 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 185 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 487/488 places, 2908/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 358630 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 358630 steps, saw 224980 distinct states, run finished after 3004 ms. (steps per millisecond=119 ) properties seen :0
[2024-06-01 09:26:18] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 09:26:18] [INFO ] Computed 28 invariants in 6 ms
[2024-06-01 09:26:18] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/107 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 185/292 variables, 107/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/413 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/581 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/861 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/861 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/875 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/875 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1316 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1316 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:26:19] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/292 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/413 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/581 variables, 77/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/861 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/861 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/875 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1316 variables, 294/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1316 variables, 292/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:26:20] [INFO ] Deduced a trap composed of 3 places in 475 ms of which 5 ms to minimize.
[2024-06-01 09:26:21] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 3 ms to minimize.
[2024-06-01 09:26:21] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-06-01 09:26:21] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1316 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1316 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1316 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2344 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 3164ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-06-01 09:26:22] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:26:22] [INFO ] Invariant cache hit.
[2024-06-01 09:26:23] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-06-01 09:26:23] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:26:23] [INFO ] Invariant cache hit.
[2024-06-01 09:26:23] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:26:28] [INFO ] Implicit Places using invariants and state equation in 4885 ms returned []
Implicit Place search using SMT with State Equation took 6104 ms to find 0 implicit places.
[2024-06-01 09:26:28] [INFO ] Redundant transitions in 156 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 09:26:28] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:26:28] [INFO ] Invariant cache hit.
[2024-06-01 09:26:28] [INFO ] State equation strengthened by 356 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/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32379ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38867 ms. Remains : 487/487 places, 2908/2908 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2724 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 415 transition count 515
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 146 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 138 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 626 place count 138 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 634 place count 138 transition count 265
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 705 place count 138 transition count 194
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 776 place count 67 transition count 194
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 784 place count 67 transition count 194
Applied a total of 784 rules in 43 ms. Remains 67 /487 variables (removed 420) and now considering 194/2908 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 67 cols
[2024-06-01 09:27:00] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 09:27:00] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:27:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 09:27:01] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:27:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:27:01] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:27:01] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:27:01] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 280 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 68 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 441 ms.
Product exploration explored 100000 steps with 0 reset in 433 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 113 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
[2024-06-01 09:27:02] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 09:27:02] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 09:27:03] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2024-06-01 09:27:03] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:27:03] [INFO ] Invariant cache hit.
[2024-06-01 09:27:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:27:07] [INFO ] Implicit Places using invariants and state equation in 4402 ms returned []
Implicit Place search using SMT with State Equation took 5498 ms to find 0 implicit places.
[2024-06-01 09:27:08] [INFO ] Redundant transitions in 126 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 09:27:08] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:27:08] [INFO ] Invariant cache hit.
[2024-06-01 09:27:08] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32482ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32520ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/488 places, 2908/2909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38274 ms. Remains : 487/488 places, 2908/2909 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 237890 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||X(X(F(p1)))))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 67 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-06-01 09:27:40] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-06-01 09:27:40] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:27:42] [INFO ] Implicit Places using invariants in 1334 ms returned []
[2024-06-01 09:27:42] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:27:42] [INFO ] Invariant cache hit.
[2024-06-01 09:27:43] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:27:51] [INFO ] Implicit Places using invariants and state equation in 8959 ms returned []
Implicit Place search using SMT with State Equation took 10300 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-06-01 09:27:51] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:27:51] [INFO ] Invariant cache hit.
[2024-06-01 09:27:51] [INFO ] State equation strengthened by 364 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/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32272ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32306ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42679 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 746 ms.
Product exploration explored 100000 steps with 25000 reset in 780 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 910 ms. (43 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
[2024-06-01 09:28:25] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:28:25] [INFO ] Invariant cache hit.
[2024-06-01 09:28:25] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1390 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 600/1990 variables, 474/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1990 variables, 271/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:28:27] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 492/772 variables, 280/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 65/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/916 variables, 66/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 28/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 462/1378 variables, 12/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1378 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/1390 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1390 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:28:28] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1390 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 600/1990 variables, 474/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 271/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:28:29] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1990 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1990/1990 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2727 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4260ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 694 ms.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 4 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 240 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 1498 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 168230 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168230 steps, saw 112471 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 09:28:34] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:28:34] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:28:34] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:28:35] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:28:36] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 4 ms to minimize.
[2024-06-01 09:28:36] [INFO ] Deduced a trap composed of 37 places in 422 ms of which 5 ms to minimize.
[2024-06-01 09:28:37] [INFO ] Deduced a trap composed of 3 places in 526 ms of which 4 ms to minimize.
[2024-06-01 09:28:37] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 4 ms to minimize.
[2024-06-01 09:28:38] [INFO ] Deduced a trap composed of 27 places in 444 ms of which 4 ms to minimize.
[2024-06-01 09:28:38] [INFO ] Deduced a trap composed of 3 places in 477 ms of which 5 ms to minimize.
[2024-06-01 09:28:39] [INFO ] Deduced a trap composed of 34 places in 382 ms of which 3 ms to minimize.
[2024-06-01 09:28:39] [INFO ] Deduced a trap composed of 35 places in 403 ms of which 4 ms to minimize.
[2024-06-01 09:28:39] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 4 ms to minimize.
[2024-06-01 09:28:40] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 4 ms to minimize.
[2024-06-01 09:28:40] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 4 ms to minimize.
[2024-06-01 09:28:40] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 894 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6713 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 7426ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 619 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 170 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 108 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:28:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:28:42] [INFO ] Invariant cache hit.
[2024-06-01 09:28:43] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2024-06-01 09:28:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:28:43] [INFO ] Invariant cache hit.
[2024-06-01 09:28:44] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:28:48] [INFO ] Implicit Places using invariants and state equation in 4626 ms returned []
Implicit Place search using SMT with State Equation took 5800 ms to find 0 implicit places.
[2024-06-01 09:28:48] [INFO ] Redundant transitions in 149 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:28:48] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:28:48] [INFO ] Invariant cache hit.
[2024-06-01 09:28:48] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32174ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38291 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 37 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-06-01 09:29:21] [INFO ] Computed 20 invariants in 0 ms
[2024-06-01 09:29:21] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:29:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 09:29:21] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:29:21] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:29:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 09:29:21] [INFO ] After 37ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:29:21] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:29:21] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 392 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Applied a total of 0 rules in 32 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-06-01 09:29:21] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-06-01 09:29:21] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:29:23] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2024-06-01 09:29:23] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:29:23] [INFO ] Invariant cache hit.
[2024-06-01 09:29:24] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:29:32] [INFO ] Implicit Places using invariants and state equation in 9478 ms returned []
Implicit Place search using SMT with State Equation took 10791 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-06-01 09:29:32] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:29:32] [INFO ] Invariant cache hit.
[2024-06-01 09:29:32] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 1.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.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 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32325ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32357ms
Finished structural reductions in LTL mode , in 1 iterations and 43184 ms. Remains : 820/820 places, 3249/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1549 ms. (25 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
[2024-06-01 09:30:06] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:30:06] [INFO ] Invariant cache hit.
[2024-06-01 09:30:06] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1390 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 600/1990 variables, 474/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1990 variables, 271/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:30:08] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 492/772 variables, 280/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 65/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/916 variables, 66/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 28/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 462/1378 variables, 12/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1378 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/1390 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1390 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:30:09] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1390 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 600/1990 variables, 474/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 271/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:30:09] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1990 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1990/1990 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2941 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4580ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 789 ms.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 275 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 976 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 112630 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 2
Probabilistic random walk after 112630 steps, saw 77761 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-01 09:30:15] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:30:15] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:30:15] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:30:16] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:30:17] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 3 ms to minimize.
[2024-06-01 09:30:17] [INFO ] Deduced a trap composed of 37 places in 406 ms of which 3 ms to minimize.
[2024-06-01 09:30:17] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 3 ms to minimize.
[2024-06-01 09:30:18] [INFO ] Deduced a trap composed of 3 places in 377 ms of which 3 ms to minimize.
[2024-06-01 09:30:18] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 3 ms to minimize.
[2024-06-01 09:30:19] [INFO ] Deduced a trap composed of 3 places in 372 ms of which 3 ms to minimize.
[2024-06-01 09:30:19] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 2 ms to minimize.
[2024-06-01 09:30:19] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 2 ms to minimize.
[2024-06-01 09:30:20] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 4 ms to minimize.
[2024-06-01 09:30:20] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 2 ms to minimize.
[2024-06-01 09:30:20] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 2 ms to minimize.
[2024-06-01 09:30:20] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 894 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4899 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 5909ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 574 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 101 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 102 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:30:21] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:30:21] [INFO ] Invariant cache hit.
[2024-06-01 09:30:22] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-06-01 09:30:22] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:30:22] [INFO ] Invariant cache hit.
[2024-06-01 09:30:23] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:30:26] [INFO ] Implicit Places using invariants and state equation in 3362 ms returned []
Implicit Place search using SMT with State Equation took 4250 ms to find 0 implicit places.
[2024-06-01 09:30:26] [INFO ] Redundant transitions in 96 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:30:26] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:30:26] [INFO ] Invariant cache hit.
[2024-06-01 09:30:26] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32321ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32351ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36807 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 40 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-06-01 09:30:58] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 09:30:58] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:30:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 09:30:58] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:30:58] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:30:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 09:30:59] [INFO ] After 37ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:30:59] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:30:59] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 399 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 964 ms.
Product exploration explored 100000 steps with 25000 reset in 758 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3249
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 243 Pre rules applied. Total rules applied 9 place count 820 transition count 3663
Deduced a syphon composed of 252 places in 6 ms
Iterating global reduction 1 with 243 rules applied. Total rules applied 252 place count 820 transition count 3663
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 333 places in 6 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 333 place count 820 transition count 3663
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 342 place count 811 transition count 3654
Deduced a syphon composed of 324 places in 5 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 351 place count 811 transition count 3654
Deduced a syphon composed of 324 places in 6 ms
Applied a total of 351 rules in 523 ms. Remains 811 /820 variables (removed 9) and now considering 3654/3249 (removed -405) transitions.
[2024-06-01 09:31:02] [INFO ] Redundant transitions in 164 ms returned []
Running 3645 sub problems to find dead transitions.
[2024-06-01 09:31:02] [INFO ] Flow matrix only has 1368 transitions (discarded 2286 similar events)
// Phase 1: matrix 1368 rows 811 cols
[2024-06-01 09:31:02] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:31:02] [INFO ] State equation strengthened by 597 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/811 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3645 unsolved
SMT process timed out in 32733ms, After SMT, problems are : Problem set: 0 solved, 3645 unsolved
Search for dead transitions found 0 dead transitions in 32772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 811/820 places, 3654/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33472 ms. Remains : 811/820 places, 3654/3249 transitions.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Applied a total of 0 rules in 44 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-06-01 09:31:35] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-06-01 09:31:35] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:31:36] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2024-06-01 09:31:36] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:31:36] [INFO ] Invariant cache hit.
[2024-06-01 09:31:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:31:45] [INFO ] Implicit Places using invariants and state equation in 8740 ms returned []
Implicit Place search using SMT with State Equation took 10040 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-06-01 09:31:45] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:31:45] [INFO ] Invariant cache hit.
[2024-06-01 09:31:45] [INFO ] State equation strengthened by 364 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/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32273ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32307ms
Finished structural reductions in LTL mode , in 1 iterations and 42395 ms. Remains : 820/820 places, 3249/3249 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 277409 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))||F((F(p2)&&p1))))'
Support contains 7 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 79 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-06-01 09:32:18] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-06-01 09:32:18] [INFO ] Computed 28 invariants in 6 ms
[2024-06-01 09:32:19] [INFO ] Implicit Places using invariants in 1564 ms returned []
[2024-06-01 09:32:19] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:32:19] [INFO ] Invariant cache hit.
[2024-06-01 09:32:20] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:32:28] [INFO ] Implicit Places using invariants and state equation in 8815 ms returned []
Implicit Place search using SMT with State Equation took 10380 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-06-01 09:32:28] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-06-01 09:32:28] [INFO ] Invariant cache hit.
[2024-06-01 09:32:28] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32409ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32443ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42905 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 25 reset in 472 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-14 finished in 43589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(F(X(F(X(F(p1)))))) U p2))))'
Support contains 5 out of 823 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 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 303 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-06-01 09:33:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-06-01 09:33:02] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:33:03] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2024-06-01 09:33:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:33:03] [INFO ] Invariant cache hit.
[2024-06-01 09:33:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:33:07] [INFO ] Implicit Places using invariants and state equation in 4038 ms returned []
Implicit Place search using SMT with State Equation took 5120 ms to find 0 implicit places.
[2024-06-01 09:33:07] [INFO ] Redundant transitions in 101 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 09:33:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-06-01 09:33:07] [INFO ] Invariant cache hit.
[2024-06-01 09:33:07] [INFO ] State equation strengthened by 356 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/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32081ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37650 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 129 reset in 530 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-15 finished in 38299 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)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-06
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 6 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 525 place count 559 transition count 2988
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2916
Applied a total of 672 rules in 213 ms. Remains 487 /823 variables (removed 336) and now considering 2916/3276 (removed 360) transitions.
[2024-06-01 09:33:40] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:33:40] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:33:42] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2024-06-01 09:33:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:33:42] [INFO ] Invariant cache hit.
[2024-06-01 09:33:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:33:46] [INFO ] Implicit Places using invariants and state equation in 4398 ms returned []
Implicit Place search using SMT with State Equation took 5700 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:33:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:33:46] [INFO ] Invariant cache hit.
[2024-06-01 09:33:46] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32735ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32764ms
Starting structural reductions in LI_LTL mode, iteration 1 : 487/823 places, 2916/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38687 ms. Remains : 487/823 places, 2916/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 455 ms.
Product exploration explored 100000 steps with 0 reset in 434 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 1654 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 90240 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 4
Probabilistic random walk after 90240 steps, saw 63542 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2024-06-01 09:34:24] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:34:24] [INFO ] Invariant cache hit.
[2024-06-01 09:34:24] [INFO ] State equation strengthened by 364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 3/296 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:34:26] [INFO ] Deduced a trap composed of 3 places in 506 ms of which 5 ms to minimize.
[2024-06-01 09:34:27] [INFO ] Deduced a trap composed of 3 places in 559 ms of which 6 ms to minimize.
[2024-06-01 09:34:27] [INFO ] Deduced a trap composed of 3 places in 470 ms of which 5 ms to minimize.
[2024-06-01 09:34:28] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 3 ms to minimize.
[2024-06-01 09:34:28] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 3 ms to minimize.
[2024-06-01 09:34:28] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 4 ms to minimize.
[2024-06-01 09:34:29] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 3 ms to minimize.
[2024-06-01 09:34:29] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-06-01 09:34:29] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 2 ms to minimize.
[2024-06-01 09:34:29] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 2 ms to minimize.
[2024-06-01 09:34:30] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-06-01 09:34:30] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 3 ms to minimize.
[2024-06-01 09:34:30] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 2 ms to minimize.
SMT process timed out in 6260ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 144 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 2216 ms. (18 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 95910 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 3
Probabilistic random walk after 95910 steps, saw 66860 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 09:34:34] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:34:34] [INFO ] Invariant cache hit.
[2024-06-01 09:34:34] [INFO ] State equation strengthened by 364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:34:35] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:34:36] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2024-06-01 09:34:36] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 3 ms to minimize.
[2024-06-01 09:34:36] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 4 ms to minimize.
[2024-06-01 09:34:36] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2024-06-01 09:34:37] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-06-01 09:34:37] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-06-01 09:34:37] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:34:37] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 441/1324 variables, 294/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 292/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 891 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3168 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 3996ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2329 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 130 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 111 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:34:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:34:41] [INFO ] Invariant cache hit.
[2024-06-01 09:34:42] [INFO ] Implicit Places using invariants in 980 ms returned []
[2024-06-01 09:34:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:34:42] [INFO ] Invariant cache hit.
[2024-06-01 09:34:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:34:46] [INFO ] Implicit Places using invariants and state equation in 4752 ms returned []
Implicit Place search using SMT with State Equation took 5744 ms to find 0 implicit places.
[2024-06-01 09:34:47] [INFO ] Redundant transitions in 162 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:34:47] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:34:47] [INFO ] Invariant cache hit.
[2024-06-01 09:34:47] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32284ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38366 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 52 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-06-01 09:35:19] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 09:35:19] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 09:35:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 09:35:19] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:35:19] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 09:35:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:35:19] [INFO ] After 37ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 09:35:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:35:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-06-01 09:35:19] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:35:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2024-06-01 09:35:19] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:35:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-06-01 09:35:19] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 09:35:20] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 607 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 126 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:35:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:35:20] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 09:35:21] [INFO ] Implicit Places using invariants in 1221 ms returned []
[2024-06-01 09:35:21] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:35:21] [INFO ] Invariant cache hit.
[2024-06-01 09:35:22] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:35:26] [INFO ] Implicit Places using invariants and state equation in 4701 ms returned []
Implicit Place search using SMT with State Equation took 5929 ms to find 0 implicit places.
[2024-06-01 09:35:26] [INFO ] Redundant transitions in 93 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:35:26] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:35:26] [INFO ] Invariant cache hit.
[2024-06-01 09:35:26] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32104ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38291 ms. Remains : 487/487 places, 2916/2916 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 2025 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 73200 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 4
Probabilistic random walk after 73200 steps, saw 52352 distinct states, run finished after 3006 ms. (steps per millisecond=24 ) properties seen :0
[2024-06-01 09:36:02] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:36:03] [INFO ] Invariant cache hit.
[2024-06-01 09:36:03] [INFO ] State equation strengthened by 364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:36:04] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:36:05] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 4 ms to minimize.
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 4 ms to minimize.
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 3 places in 416 ms of which 4 ms to minimize.
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 5 ms to minimize.
[2024-06-01 09:36:07] [INFO ] Deduced a trap composed of 34 places in 353 ms of which 4 ms to minimize.
[2024-06-01 09:36:07] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 3 ms to minimize.
[2024-06-01 09:36:07] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 3 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 4 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 11/308 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 441/1324 variables, 294/602 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 6438ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1730 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 147410 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 3
Probabilistic random walk after 147410 steps, saw 98685 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 09:36:13] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:36:13] [INFO ] Invariant cache hit.
[2024-06-01 09:36:13] [INFO ] State equation strengthened by 364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:36:14] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:36:15] [INFO ] Deduced a trap composed of 7 places in 499 ms of which 5 ms to minimize.
[2024-06-01 09:36:16] [INFO ] Deduced a trap composed of 3 places in 506 ms of which 5 ms to minimize.
[2024-06-01 09:36:17] [INFO ] Deduced a trap composed of 19 places in 489 ms of which 4 ms to minimize.
[2024-06-01 09:36:17] [INFO ] Deduced a trap composed of 3 places in 521 ms of which 5 ms to minimize.
[2024-06-01 09:36:18] [INFO ] Deduced a trap composed of 26 places in 531 ms of which 4 ms to minimize.
[2024-06-01 09:36:18] [INFO ] Deduced a trap composed of 22 places in 530 ms of which 5 ms to minimize.
[2024-06-01 09:36:19] [INFO ] Deduced a trap composed of 66 places in 530 ms of which 5 ms to minimize.
[2024-06-01 09:36:19] [INFO ] Deduced a trap composed of 3 places in 530 ms of which 4 ms to minimize.
[2024-06-01 09:36:20] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 3 ms to minimize.
[2024-06-01 09:36:20] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 3 ms to minimize.
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 14 places in 489 ms of which 4 ms to minimize.
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 3 places in 410 ms of which 4 ms to minimize.
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 39 places in 329 ms of which 4 ms to minimize.
[2024-06-01 09:36:22] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 3 ms to minimize.
[2024-06-01 09:36:22] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 3 ms to minimize.
[2024-06-01 09:36:22] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2024-06-01 09:36:23] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 2 ms to minimize.
[2024-06-01 09:36:23] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-06-01 09:36:23] [INFO ] Deduced a trap composed of 34 places in 404 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 19/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:36:24] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 441/1324 variables, 294/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 292/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 903 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10624 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 21/21 constraints]
After SMT, in 11810ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1776 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:36:27] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:36:27] [INFO ] Invariant cache hit.
[2024-06-01 09:36:28] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-06-01 09:36:28] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:36:28] [INFO ] Invariant cache hit.
[2024-06-01 09:36:28] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:36:33] [INFO ] Implicit Places using invariants and state equation in 5411 ms returned []
Implicit Place search using SMT with State Equation took 6294 ms to find 0 implicit places.
[2024-06-01 09:36:33] [INFO ] Redundant transitions in 115 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:36:33] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:36:33] [INFO ] Invariant cache hit.
[2024-06-01 09:36:33] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.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 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 1.0)
(s370 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32303ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38859 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 45 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-06-01 09:37:05] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 09:37:06] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 09:37:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:37:06] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:37:06] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 09:37:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:37:06] [INFO ] After 53ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 09:37:06] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:37:06] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:37:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:37:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:37:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:37:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 185 ms
TRAPS : Iteration 1
[2024-06-01 09:37:06] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 09:37:06] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 729 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 178 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 480 ms.
Product exploration explored 100000 steps with 0 reset in 560 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 176 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:37:08] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:37:08] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:37:09] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2024-06-01 09:37:09] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:37:09] [INFO ] Invariant cache hit.
[2024-06-01 09:37:10] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:37:13] [INFO ] Implicit Places using invariants and state equation in 4263 ms returned []
Implicit Place search using SMT with State Equation took 5485 ms to find 0 implicit places.
[2024-06-01 09:37:14] [INFO ] Redundant transitions in 158 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:37:14] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:37:14] [INFO ] Invariant cache hit.
[2024-06-01 09:37:14] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32646ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38525 ms. Remains : 487/487 places, 2916/2916 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 246535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-07
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 523 place count 560 transition count 2989
Iterating global reduction 2 with 3 rules applied. Total rules applied 526 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2917
Applied a total of 670 rules in 174 ms. Remains 488 /823 variables (removed 335) and now considering 2917/3276 (removed 359) transitions.
[2024-06-01 09:37:47] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-06-01 09:37:47] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:37:48] [INFO ] Implicit Places using invariants in 1315 ms returned []
[2024-06-01 09:37:48] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:37:48] [INFO ] Invariant cache hit.
[2024-06-01 09:37:49] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:37:54] [INFO ] Implicit Places using invariants and state equation in 5337 ms returned []
Implicit Place search using SMT with State Equation took 6659 ms to find 0 implicit places.
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:37:54] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:37:54] [INFO ] Invariant cache hit.
[2024-06-01 09:37:54] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32213ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32261ms
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2917/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 39108 ms. Remains : 488/823 places, 2917/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 90 reset in 450 ms.
Product exploration explored 100000 steps with 89 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 915 ms. (43 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
[2024-06-01 09:38:27] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:38:27] [INFO ] Invariant cache hit.
[2024-06-01 09:38:27] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:38:29] [INFO ] Deduced a trap composed of 3 places in 457 ms of which 5 ms to minimize.
[2024-06-01 09:38:30] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 4 ms to minimize.
[2024-06-01 09:38:30] [INFO ] Deduced a trap composed of 3 places in 444 ms of which 4 ms to minimize.
[2024-06-01 09:38:31] [INFO ] Deduced a trap composed of 42 places in 491 ms of which 5 ms to minimize.
[2024-06-01 09:38:31] [INFO ] Deduced a trap composed of 51 places in 435 ms of which 4 ms to minimize.
[2024-06-01 09:38:32] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 5 ms to minimize.
[2024-06-01 09:38:32] [INFO ] Deduced a trap composed of 40 places in 499 ms of which 4 ms to minimize.
[2024-06-01 09:38:33] [INFO ] Deduced a trap composed of 24 places in 488 ms of which 6 ms to minimize.
[2024-06-01 09:38:33] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 3 ms to minimize.
[2024-06-01 09:38:34] [INFO ] Deduced a trap composed of 78 places in 414 ms of which 4 ms to minimize.
SMT process timed out in 6185ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 164 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 1345 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 165890 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 165890 steps, saw 109510 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 09:38:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:38:37] [INFO ] Invariant cache hit.
[2024-06-01 09:38:37] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:38:40] [INFO ] Deduced a trap composed of 3 places in 507 ms of which 5 ms to minimize.
[2024-06-01 09:38:40] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 4 ms to minimize.
[2024-06-01 09:38:41] [INFO ] Deduced a trap composed of 3 places in 449 ms of which 5 ms to minimize.
[2024-06-01 09:38:41] [INFO ] Deduced a trap composed of 42 places in 491 ms of which 5 ms to minimize.
[2024-06-01 09:38:41] [INFO ] Deduced a trap composed of 51 places in 387 ms of which 4 ms to minimize.
[2024-06-01 09:38:42] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 5 ms to minimize.
[2024-06-01 09:38:43] [INFO ] Deduced a trap composed of 40 places in 509 ms of which 5 ms to minimize.
[2024-06-01 09:38:43] [INFO ] Deduced a trap composed of 24 places in 520 ms of which 5 ms to minimize.
[2024-06-01 09:38:43] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 4 ms to minimize.
[2024-06-01 09:38:44] [INFO ] Deduced a trap composed of 78 places in 408 ms of which 4 ms to minimize.
[2024-06-01 09:38:44] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 4 ms to minimize.
[2024-06-01 09:38:45] [INFO ] Deduced a trap composed of 35 places in 406 ms of which 4 ms to minimize.
[2024-06-01 09:38:45] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 2 ms to minimize.
[2024-06-01 09:38:45] [INFO ] Deduced a trap composed of 30 places in 379 ms of which 4 ms to minimize.
[2024-06-01 09:38:46] [INFO ] Deduced a trap composed of 47 places in 480 ms of which 5 ms to minimize.
[2024-06-01 09:38:46] [INFO ] Deduced a trap composed of 45 places in 471 ms of which 4 ms to minimize.
[2024-06-01 09:38:47] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 4 ms to minimize.
[2024-06-01 09:38:47] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 4 ms to minimize.
[2024-06-01 09:38:48] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 3 ms to minimize.
[2024-06-01 09:38:48] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:38:49] [INFO ] Deduced a trap composed of 21 places in 340 ms of which 3 ms to minimize.
[2024-06-01 09:38:49] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 3 ms to minimize.
[2024-06-01 09:38:49] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 3 ms to minimize.
[2024-06-01 09:38:49] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/948 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 378/1326 variables, 252/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 266/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:38:50] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1326 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 907 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12230 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
After SMT, in 13276ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1022 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 165 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 165 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-06-01 09:38:52] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:38:52] [INFO ] Invariant cache hit.
[2024-06-01 09:38:53] [INFO ] Implicit Places using invariants in 1285 ms returned []
[2024-06-01 09:38:53] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:38:53] [INFO ] Invariant cache hit.
[2024-06-01 09:38:54] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:38:58] [INFO ] Implicit Places using invariants and state equation in 4906 ms returned []
Implicit Place search using SMT with State Equation took 6202 ms to find 0 implicit places.
[2024-06-01 09:38:58] [INFO ] Redundant transitions in 92 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:38:58] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:38:58] [INFO ] Invariant cache hit.
[2024-06-01 09:38:58] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32356ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38853 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 48 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-06-01 09:39:31] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 09:39:31] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:39:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:39:31] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 09:39:31] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:39:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:39:31] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:39:31] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:39:31] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:39:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2024-06-01 09:39:31] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:39:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-01 09:39:31] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:39:31] [INFO ] After 437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 541 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 110 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-06-01 09:39:32] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-06-01 09:39:32] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:39:33] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-06-01 09:39:33] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:39:33] [INFO ] Invariant cache hit.
[2024-06-01 09:39:33] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:39:38] [INFO ] Implicit Places using invariants and state equation in 5187 ms returned []
Implicit Place search using SMT with State Equation took 6157 ms to find 0 implicit places.
[2024-06-01 09:39:38] [INFO ] Redundant transitions in 126 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:39:38] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:39:38] [INFO ] Invariant cache hit.
[2024-06-01 09:39:38] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32262ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32323ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38730 ms. Remains : 488/488 places, 2917/2917 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 1498 ms. (26 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
[2024-06-01 09:40:11] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:40:11] [INFO ] Invariant cache hit.
[2024-06-01 09:40:11] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:40:14] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 5 ms to minimize.
[2024-06-01 09:40:14] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 4 ms to minimize.
[2024-06-01 09:40:15] [INFO ] Deduced a trap composed of 3 places in 489 ms of which 4 ms to minimize.
[2024-06-01 09:40:15] [INFO ] Deduced a trap composed of 42 places in 503 ms of which 5 ms to minimize.
[2024-06-01 09:40:16] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 4 ms to minimize.
[2024-06-01 09:40:16] [INFO ] Deduced a trap composed of 23 places in 492 ms of which 5 ms to minimize.
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 40 places in 425 ms of which 4 ms to minimize.
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 24 places in 518 ms of which 5 ms to minimize.
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 4 ms to minimize.
SMT process timed out in 6144ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 167 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 1362 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 107770 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 2
Probabilistic random walk after 107770 steps, saw 73830 distinct states, run finished after 3006 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-01 09:40:21] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:40:21] [INFO ] Invariant cache hit.
[2024-06-01 09:40:21] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:40:23] [INFO ] Deduced a trap composed of 3 places in 451 ms of which 5 ms to minimize.
[2024-06-01 09:40:24] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 4 ms to minimize.
[2024-06-01 09:40:24] [INFO ] Deduced a trap composed of 3 places in 406 ms of which 4 ms to minimize.
[2024-06-01 09:40:25] [INFO ] Deduced a trap composed of 42 places in 443 ms of which 5 ms to minimize.
[2024-06-01 09:40:25] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 4 ms to minimize.
[2024-06-01 09:40:25] [INFO ] Deduced a trap composed of 23 places in 326 ms of which 3 ms to minimize.
[2024-06-01 09:40:26] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 3 ms to minimize.
[2024-06-01 09:40:26] [INFO ] Deduced a trap composed of 24 places in 334 ms of which 4 ms to minimize.
[2024-06-01 09:40:26] [INFO ] Deduced a trap composed of 3 places in 321 ms of which 3 ms to minimize.
[2024-06-01 09:40:27] [INFO ] Deduced a trap composed of 78 places in 420 ms of which 3 ms to minimize.
[2024-06-01 09:40:27] [INFO ] Deduced a trap composed of 53 places in 373 ms of which 4 ms to minimize.
[2024-06-01 09:40:28] [INFO ] Deduced a trap composed of 35 places in 399 ms of which 4 ms to minimize.
[2024-06-01 09:40:28] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 2 ms to minimize.
[2024-06-01 09:40:28] [INFO ] Deduced a trap composed of 30 places in 415 ms of which 4 ms to minimize.
[2024-06-01 09:40:29] [INFO ] Deduced a trap composed of 47 places in 474 ms of which 4 ms to minimize.
[2024-06-01 09:40:29] [INFO ] Deduced a trap composed of 45 places in 464 ms of which 4 ms to minimize.
[2024-06-01 09:40:30] [INFO ] Deduced a trap composed of 13 places in 508 ms of which 4 ms to minimize.
[2024-06-01 09:40:30] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 3 ms to minimize.
[2024-06-01 09:40:31] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 3 ms to minimize.
[2024-06-01 09:40:31] [INFO ] Deduced a trap composed of 34 places in 329 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:40:31] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 09:40:32] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:40:32] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 2 ms to minimize.
[2024-06-01 09:40:32] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/948 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 378/1326 variables, 252/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 266/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:40:32] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1326 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 907 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10778 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
After SMT, in 11879ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 848 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 176 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 164 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-06-01 09:40:34] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:40:34] [INFO ] Invariant cache hit.
[2024-06-01 09:40:35] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2024-06-01 09:40:35] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:40:35] [INFO ] Invariant cache hit.
[2024-06-01 09:40:36] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:40:40] [INFO ] Implicit Places using invariants and state equation in 4329 ms returned []
Implicit Place search using SMT with State Equation took 5389 ms to find 0 implicit places.
[2024-06-01 09:40:40] [INFO ] Redundant transitions in 156 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:40:40] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:40:40] [INFO ] Invariant cache hit.
[2024-06-01 09:40:40] [INFO ] State equation strengthened by 364 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/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32458ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38227 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 52 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-06-01 09:41:12] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 09:41:12] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:41:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:41:12] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 09:41:13] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:41:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:41:13] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:41:13] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:41:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:41:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2024-06-01 09:41:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-01 09:41:13] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:41:13] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 557 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 89 reset in 478 ms.
Product exploration explored 100000 steps with 91 reset in 483 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 173 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-06-01 09:41:15] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-06-01 09:41:15] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 09:41:16] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2024-06-01 09:41:16] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:41:16] [INFO ] Invariant cache hit.
[2024-06-01 09:41:16] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:41:21] [INFO ] Implicit Places using invariants and state equation in 4921 ms returned []
Implicit Place search using SMT with State Equation took 6096 ms to find 0 implicit places.
[2024-06-01 09:41:21] [INFO ] Redundant transitions in 157 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-06-01 09:41:21] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-06-01 09:41:21] [INFO ] Invariant cache hit.
[2024-06-01 09:41:21] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32643ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32691ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39132 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 247260 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)))'
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)))'
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(((!p1 U (G(!p1)||(!p1&&G(!p2))))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-11
Stuttering acceptance computed with spot in 303 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 164 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-06-01 09:41:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-06-01 09:41:55] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:41:56] [INFO ] Implicit Places using invariants in 1240 ms returned []
[2024-06-01 09:41:56] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:41:56] [INFO ] Invariant cache hit.
[2024-06-01 09:41:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:42:01] [INFO ] Implicit Places using invariants and state equation in 4587 ms returned []
Implicit Place search using SMT with State Equation took 5839 ms to find 0 implicit places.
Running 2900 sub problems to find dead transitions.
[2024-06-01 09:42:01] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:42:01] [INFO ] Invariant cache hit.
[2024-06-01 09:42:01] [INFO ] State equation strengthened by 356 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/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32251ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32296ms
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38305 ms. Remains : 488/823 places, 2909/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 489 ms.
Product exploration explored 100000 steps with 0 reset in 463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 237 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[true, p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
RANDOM walk for 40000 steps (8 resets) in 4054 ms. (9 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
[2024-06-01 09:42:36] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:42:36] [INFO ] Invariant cache hit.
[2024-06-01 09:42:36] [INFO ] State equation strengthened by 356 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/194 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 105/544 variables, 9/203 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 33/237 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 144/688 variables, 66/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 33/336 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 0/336 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 240/928 variables, 12/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 12/940 variables, 6/354 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/940 variables, 0/354 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 378/1318 variables, 252/606 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 266/872 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 09:42:38] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem apf4 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/161 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 09:42:39] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2024-06-01 09:42:39] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 278/439 variables, 161/173 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 24/197 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 4/201 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/201 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 105/544 variables, 9/210 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 33/244 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 144/688 variables, 66/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/688 variables, 33/343 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/688 variables, 0/343 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 240/928 variables, 12/355 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/928 variables, 0/355 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/940 variables, 6/361 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/940 variables, 0/361 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 378/1318 variables, 252/613 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 266/879 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 09:42:40] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-06-01 09:42:40] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 2/881 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1318 variables, 0/881 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1318 variables, 0/881 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 881 constraints, problems are : Problem set: 3 solved, 4 unsolved in 3000 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 4822ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1306 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 179 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 488/488 places, 2909/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 2418 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 76760 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 4
Probabilistic random walk after 76760 steps, saw 55069 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-06-01 09:42:47] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:42:47] [INFO ] Invariant cache hit.
[2024-06-01 09:42:47] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 105/544 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 33/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 144/688 variables, 66/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 33/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 240/928 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 12/940 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/940 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 378/1318 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 266/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 105/544 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 33/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 144/688 variables, 66/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 33/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/688 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 240/928 variables, 12/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/928 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/940 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/940 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 378/1318 variables, 252/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 266/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:49] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 09:42:50] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1318 variables, 2/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1318 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 878 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3644ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1279 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 171 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 166 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-06-01 09:42:52] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:42:52] [INFO ] Invariant cache hit.
[2024-06-01 09:42:53] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2024-06-01 09:42:53] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:42:53] [INFO ] Invariant cache hit.
[2024-06-01 09:42:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:42:58] [INFO ] Implicit Places using invariants and state equation in 4612 ms returned []
Implicit Place search using SMT with State Equation took 5949 ms to find 0 implicit places.
[2024-06-01 09:42:58] [INFO ] Redundant transitions in 155 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-06-01 09:42:58] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:42:58] [INFO ] Invariant cache hit.
[2024-06-01 09:42:58] [INFO ] State equation strengthened by 356 read => feed constraints.
(s96 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32203ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38530 ms. Remains : 488/488 places, 2909/2909 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2721 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 519
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 519
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 319 transition count 501
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 241 place count 293 transition count 501
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 527 place count 150 transition count 358
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 599 place count 150 transition count 286
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 613 place count 143 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 620 place count 143 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 626 place count 143 transition count 274
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 697 place count 143 transition count 203
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 768 place count 72 transition count 203
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 776 place count 72 transition count 203
Applied a total of 776 rules in 47 ms. Remains 72 /488 variables (removed 416) and now considering 203/2909 (removed 2706) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 203 rows 72 cols
[2024-06-01 09:43:30] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 09:43:30] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:43:30] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 09:43:31] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 09:43:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:43:31] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:43:31] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 09:43:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:43:31] [INFO ] After 51ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 09:43:31] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 09:43:31] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 538 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (OR p0 (NOT p1))))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 20 factoid took 552 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Support contains 2 out of 488 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 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 174 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-06-01 09:43:32] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-06-01 09:43:32] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:43:33] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-06-01 09:43:33] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:43:33] [INFO ] Invariant cache hit.
[2024-06-01 09:43:34] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:43:37] [INFO ] Implicit Places using invariants and state equation in 4121 ms returned []
Implicit Place search using SMT with State Equation took 5272 ms to find 0 implicit places.
[2024-06-01 09:43:37] [INFO ] Redundant transitions in 105 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-06-01 09:43:37] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:43:37] [INFO ] Invariant cache hit.
[2024-06-01 09:43:37] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32275ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37869 ms. Remains : 488/488 places, 2909/2909 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 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 82 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 297160 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 297160 steps, saw 189530 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-01 09:44:13] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-06-01 09:44:13] [INFO ] Invariant cache hit.
[2024-06-01 09:44:13] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 186/294 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/415 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/583 variables, 77/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 32/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/863 variables, 14/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/863 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/877 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/877 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1318 variables, 294/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 292/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:44:14] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/294 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/415 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/583 variables, 77/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 32/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/863 variables, 14/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/863 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/877 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/877 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1318 variables, 294/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1318 variables, 292/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1917ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 179 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 487/488 places, 2908/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 308320 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 308320 steps, saw 195929 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2024-06-01 09:44:18] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 09:44:18] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:44:18] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/107 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 185/292 variables, 107/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/413 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/581 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/861 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/861 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/875 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/875 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1316 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1316 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:44:19] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/292 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/413 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/581 variables, 77/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/861 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/861 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/875 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1316 variables, 294/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1316 variables, 292/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:44:20] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1316 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1316 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1316 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1990ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 169 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-06-01 09:44:21] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:44:21] [INFO ] Invariant cache hit.
[2024-06-01 09:44:22] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2024-06-01 09:44:22] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:44:22] [INFO ] Invariant cache hit.
[2024-06-01 09:44:23] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:44:27] [INFO ] Implicit Places using invariants and state equation in 4888 ms returned []
Implicit Place search using SMT with State Equation took 6237 ms to find 0 implicit places.
[2024-06-01 09:44:27] [INFO ] Redundant transitions in 155 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 09:44:27] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:44:27] [INFO ] Invariant cache hit.
[2024-06-01 09:44:27] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.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 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.0)
(s185 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32218ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38840 ms. Remains : 487/487 places, 2908/2908 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2724 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 415 transition count 515
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 146 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 138 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 626 place count 138 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 634 place count 138 transition count 265
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 705 place count 138 transition count 194
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 776 place count 67 transition count 194
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 784 place count 67 transition count 194
Applied a total of 784 rules in 37 ms. Remains 67 /487 variables (removed 420) and now considering 194/2908 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 67 cols
[2024-06-01 09:45:00] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:45:00] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:45:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 09:45:00] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:45:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 09:45:00] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:45:00] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:45:00] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 288 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 469 ms.
Product exploration explored 100000 steps with 0 reset in 376 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 118 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
[2024-06-01 09:45:01] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 09:45:01] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:45:02] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2024-06-01 09:45:02] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:45:02] [INFO ] Invariant cache hit.
[2024-06-01 09:45:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 09:45:07] [INFO ] Implicit Places using invariants and state equation in 4263 ms returned []
Implicit Place search using SMT with State Equation took 5543 ms to find 0 implicit places.
[2024-06-01 09:45:07] [INFO ] Redundant transitions in 136 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 09:45:07] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 09:45:07] [INFO ] Invariant cache hit.
[2024-06-01 09:45:07] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32425ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/488 places, 2908/2909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38286 ms. Remains : 487/488 places, 2908/2909 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 225279 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||X(X(F(p1)))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-13
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 525 place count 559 transition count 2988
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2916
Applied a total of 672 rules in 174 ms. Remains 487 /823 variables (removed 336) and now considering 2916/3276 (removed 360) transitions.
[2024-06-01 09:45:40] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:45:40] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:45:41] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2024-06-01 09:45:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:45:41] [INFO ] Invariant cache hit.
[2024-06-01 09:45:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:45:46] [INFO ] Implicit Places using invariants and state equation in 5117 ms returned []
Implicit Place search using SMT with State Equation took 6383 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:45:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:45:46] [INFO ] Invariant cache hit.
[2024-06-01 09:45:46] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32408ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32458ms
Starting structural reductions in LI_LTL mode, iteration 1 : 487/823 places, 2916/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 39019 ms. Remains : 487/823 places, 2916/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 1023 ms.
Product exploration explored 100000 steps with 25000 reset in 815 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1176 ms. (33 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
[2024-06-01 09:46:21] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:46:21] [INFO ] Invariant cache hit.
[2024-06-01 09:46:21] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:46:23] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:46:24] [INFO ] Deduced a trap composed of 3 places in 457 ms of which 5 ms to minimize.
[2024-06-01 09:46:24] [INFO ] Deduced a trap composed of 3 places in 523 ms of which 5 ms to minimize.
[2024-06-01 09:46:25] [INFO ] Deduced a trap composed of 3 places in 451 ms of which 5 ms to minimize.
[2024-06-01 09:46:25] [INFO ] Deduced a trap composed of 39 places in 458 ms of which 4 ms to minimize.
[2024-06-01 09:46:26] [INFO ] Deduced a trap composed of 3 places in 424 ms of which 4 ms to minimize.
[2024-06-01 09:46:26] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 4 ms to minimize.
[2024-06-01 09:46:27] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 4 ms to minimize.
[2024-06-01 09:46:27] [INFO ] Deduced a trap composed of 31 places in 395 ms of which 4 ms to minimize.
[2024-06-01 09:46:28] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/1324 variables, and 373 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 235/487 constraints, ReadFeed: 98/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 6118ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 167 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1333 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 175010 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 175010 steps, saw 116377 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 09:46:31] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:46:31] [INFO ] Invariant cache hit.
[2024-06-01 09:46:31] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:46:32] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:46:34] [INFO ] Deduced a trap composed of 3 places in 461 ms of which 4 ms to minimize.
[2024-06-01 09:46:34] [INFO ] Deduced a trap composed of 3 places in 537 ms of which 4 ms to minimize.
[2024-06-01 09:46:35] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 4 ms to minimize.
[2024-06-01 09:46:35] [INFO ] Deduced a trap composed of 39 places in 481 ms of which 4 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 4 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 29 places in 376 ms of which 5 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 4 ms to minimize.
[2024-06-01 09:46:37] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 4 ms to minimize.
[2024-06-01 09:46:37] [INFO ] Deduced a trap composed of 37 places in 372 ms of which 4 ms to minimize.
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 3 ms to minimize.
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 3 ms to minimize.
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 3 ms to minimize.
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:46:39] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7400 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 8436ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 994 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 166 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:46:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:46:41] [INFO ] Invariant cache hit.
[2024-06-01 09:46:42] [INFO ] Implicit Places using invariants in 1247 ms returned []
[2024-06-01 09:46:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:46:42] [INFO ] Invariant cache hit.
[2024-06-01 09:46:43] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:46:47] [INFO ] Implicit Places using invariants and state equation in 4281 ms returned []
Implicit Place search using SMT with State Equation took 5530 ms to find 0 implicit places.
[2024-06-01 09:46:47] [INFO ] Redundant transitions in 96 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:46:47] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:46:47] [INFO ] Invariant cache hit.
[2024-06-01 09:46:47] [INFO ] State equation strengthened by 364 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/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32028ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32058ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37857 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 34 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-06-01 09:47:19] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 09:47:19] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:47:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 09:47:19] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:47:19] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:47:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 09:47:19] [INFO ] After 33ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:47:19] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:47:19] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 380 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 20 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:47:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:47:20] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 09:47:21] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2024-06-01 09:47:21] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:47:21] [INFO ] Invariant cache hit.
[2024-06-01 09:47:21] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:47:25] [INFO ] Implicit Places using invariants and state equation in 4542 ms returned []
Implicit Place search using SMT with State Equation took 5710 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:47:25] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:47:25] [INFO ] Invariant cache hit.
[2024-06-01 09:47:25] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32317ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32364ms
Finished structural reductions in LTL mode , in 1 iterations and 38098 ms. Remains : 487/487 places, 2916/2916 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1526 ms. (26 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
[2024-06-01 09:47:59] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:47:59] [INFO ] Invariant cache hit.
[2024-06-01 09:47:59] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:48:00] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:48:01] [INFO ] Deduced a trap composed of 3 places in 446 ms of which 4 ms to minimize.
[2024-06-01 09:48:01] [INFO ] Deduced a trap composed of 3 places in 530 ms of which 5 ms to minimize.
[2024-06-01 09:48:02] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 3 ms to minimize.
[2024-06-01 09:48:02] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 3 ms to minimize.
[2024-06-01 09:48:02] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 3 ms to minimize.
[2024-06-01 09:48:03] [INFO ] Deduced a trap composed of 29 places in 331 ms of which 3 ms to minimize.
[2024-06-01 09:48:03] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 3 ms to minimize.
[2024-06-01 09:48:04] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 3 ms to minimize.
[2024-06-01 09:48:04] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-06-01 09:48:04] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 2 ms to minimize.
[2024-06-01 09:48:04] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 3 ms to minimize.
[2024-06-01 09:48:05] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 3 ms to minimize.
SMT process timed out in 6072ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 166 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1547 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 164600 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 164600 steps, saw 110067 distinct states, run finished after 3007 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 09:48:08] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:48:08] [INFO ] Invariant cache hit.
[2024-06-01 09:48:09] [INFO ] State equation strengthened by 364 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:48:10] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:48:11] [INFO ] Deduced a trap composed of 3 places in 439 ms of which 4 ms to minimize.
[2024-06-01 09:48:11] [INFO ] Deduced a trap composed of 3 places in 492 ms of which 3 ms to minimize.
[2024-06-01 09:48:12] [INFO ] Deduced a trap composed of 3 places in 379 ms of which 4 ms to minimize.
[2024-06-01 09:48:12] [INFO ] Deduced a trap composed of 39 places in 423 ms of which 5 ms to minimize.
[2024-06-01 09:48:12] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 4 ms to minimize.
[2024-06-01 09:48:13] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 4 ms to minimize.
[2024-06-01 09:48:13] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 3 ms to minimize.
[2024-06-01 09:48:14] [INFO ] Deduced a trap composed of 31 places in 377 ms of which 3 ms to minimize.
[2024-06-01 09:48:14] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 2 ms to minimize.
[2024-06-01 09:48:14] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 2 ms to minimize.
[2024-06-01 09:48:15] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 4 ms to minimize.
[2024-06-01 09:48:15] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 3 ms to minimize.
[2024-06-01 09:48:15] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:48:16] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7008 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 7965ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1151 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 166 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 166 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:48:18] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:48:18] [INFO ] Invariant cache hit.
[2024-06-01 09:48:19] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2024-06-01 09:48:19] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:48:19] [INFO ] Invariant cache hit.
[2024-06-01 09:48:20] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:48:24] [INFO ] Implicit Places using invariants and state equation in 5170 ms returned []
Implicit Place search using SMT with State Equation took 6423 ms to find 0 implicit places.
[2024-06-01 09:48:25] [INFO ] Redundant transitions in 162 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:48:25] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:48:25] [INFO ] Invariant cache hit.
[2024-06-01 09:48:25] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.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 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32686ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32735ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39499 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 44 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-06-01 09:48:57] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 09:48:57] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:48:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 09:48:57] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:48:58] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:48:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 09:48:58] [INFO ] After 26ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:48:58] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:48:58] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 322 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 720 ms.
Product exploration explored 100000 steps with 25000 reset in 679 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 105 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:49:00] [INFO ] Redundant transitions in 94 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:49:00] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-06-01 09:49:00] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 09:49:00] [INFO ] State equation strengthened by 364 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/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32584ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32614ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32830 ms. Remains : 487/487 places, 2916/2916 transitions.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 20 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-06-01 09:49:33] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:49:33] [INFO ] Invariant cache hit.
[2024-06-01 09:49:34] [INFO ] Implicit Places using invariants in 1279 ms returned []
[2024-06-01 09:49:34] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:49:34] [INFO ] Invariant cache hit.
[2024-06-01 09:49:35] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 09:49:39] [INFO ] Implicit Places using invariants and state equation in 4427 ms returned []
Implicit Place search using SMT with State Equation took 5713 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-06-01 09:49:39] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-06-01 09:49:39] [INFO ] Invariant cache hit.
[2024-06-01 09:49:39] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32382ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32416ms
Finished structural reductions in LTL mode , in 1 iterations and 38153 ms. Remains : 487/487 places, 2916/2916 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 271728 ms.
[2024-06-01 09:50:11] [INFO ] Flatten gal took : 252 ms
[2024-06-01 09:50:11] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2024-06-01 09:50:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 823 places, 3276 transitions and 16344 arcs took 38 ms.
Total runtime 3360736 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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