About the Execution of ITS-Tools for EisenbergMcGuire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8292.575 | 3600000.00 | 4213669.00 | 12295.10 | F?FFF???T???F?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r158-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 itstools
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 r158-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 1716556858049
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 13:21:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:21:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:21:01] [INFO ] Load time of PNML (sax parser for PT used): 866 ms
[2024-05-24 13:21:01] [INFO ] Transformed 891 places.
[2024-05-24 13:21:01] [INFO ] Transformed 3888 transitions.
[2024-05-24 13:21:01] [INFO ] Found NUPN structural information;
[2024-05-24 13:21:01] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 1164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 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 286 ms. Remains 823 /891 variables (removed 68) and now considering 3276/3888 (removed 612) transitions.
[2024-05-24 13:21:02] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
// Phase 1: matrix 1197 rows 823 cols
[2024-05-24 13:21:02] [INFO ] Computed 28 invariants in 43 ms
[2024-05-24 13:21:04] [INFO ] Implicit Places using invariants in 1684 ms returned []
[2024-05-24 13:21:04] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 13:21:04] [INFO ] Invariant cache hit.
[2024-05-24 13:21:05] [INFO ] State equation strengthened by 388 read => feed constraints.
[2024-05-24 13:21:10] [INFO ] Implicit Places using invariants and state equation in 6248 ms returned []
Implicit Place search using SMT with State Equation took 7993 ms to find 0 implicit places.
Running 3267 sub problems to find dead transitions.
[2024-05-24 13:21:10] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 13:21:10] [INFO ] Invariant cache hit.
[2024-05-24 13:21:10] [INFO ] State equation strengthened by 388 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/823 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3267 unsolved
SMT process timed out in 33199ms, After SMT, problems are : Problem set: 0 solved, 3267 unsolved
Search for dead transitions found 0 dead transitions in 33286ms
Starting structural reductions in LTL mode, iteration 1 : 823/891 places, 3276/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41629 ms. Remains : 823/891 places, 3276/3888 transitions.
Support contains 60 out of 823 places after structural reductions.
[2024-05-24 13:21:44] [INFO ] Flatten gal took : 392 ms
[2024-05-24 13:21:45] [INFO ] Flatten gal took : 247 ms
[2024-05-24 13:21:45] [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 3266 ms. (12 steps per ms) remains 26/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 26/26 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 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 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 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 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 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 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 27 ms. (143 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 27 ms. (143 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 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 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 21 ms. (182 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 23 ms. (166 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
[2024-05-24 13:21:46] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 13:21:46] [INFO ] Invariant cache hit.
[2024-05-24 13:21:46] [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-05-24 13:21:48] [INFO ] Deduced a trap composed of 62 places in 1129 ms of which 136 ms to minimize.
[2024-05-24 13:21:49] [INFO ] Deduced a trap composed of 62 places in 990 ms of which 13 ms to minimize.
[2024-05-24 13:21:50] [INFO ] Deduced a trap composed of 176 places in 1120 ms of which 13 ms to minimize.
[2024-05-24 13:21:51] [INFO ] Deduced a trap composed of 35 places in 1003 ms of which 13 ms to minimize.
[2024-05-24 13:21:53] [INFO ] Deduced a trap composed of 176 places in 1291 ms of which 12 ms to minimize.
SMT process timed out in 6283ms, 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 6 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 5 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 664 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 665 ms. Remains : 492/823 places, 2929/3276 transitions.
RANDOM walk for 40000 steps (8 resets) in 830 ms. (48 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 27 ms. (143 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 23 ms. (166 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 21 ms. (182 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 21 ms. (182 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 14 ms. (266 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 23 ms. (166 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 21 ms. (182 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 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 19 ms. (200 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 20 ms. (190 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 22 ms. (174 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 13 ms. (286 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 15 ms. (250 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 119220 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :5 out of 26
Probabilistic random walk after 119220 steps, saw 81689 distinct states, run finished after 3007 ms. (steps per millisecond=39 ) properties seen :5
[2024-05-24 13:21:57] [INFO ] Flow matrix only has 850 transitions (discarded 2079 similar events)
// Phase 1: matrix 850 rows 492 cols
[2024-05-24 13:21:57] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 13:21:57] [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-05-24 13:21:58] [INFO ] Deduced a trap composed of 3 places in 498 ms of which 6 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 27 places in 501 ms of which 6 ms to minimize.
[2024-05-24 13:21:59] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 4 ms to minimize.
[2024-05-24 13:21:59] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-24 13:21:59] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 2 ms to minimize.
[2024-05-24 13:22:00] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 2 ms to minimize.
[2024-05-24 13:22:00] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2024-05-24 13:22:00] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 3 ms to minimize.
[2024-05-24 13:22:00] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:01] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 4 ms to minimize.
[2024-05-24 13:22:01] [INFO ] Deduced a trap composed of 3 places in 101 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-05-24 13:22:02] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 2 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 8283 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-05-24 13:22:07] [INFO ] Deduced a trap composed of 26 places in 522 ms of which 6 ms to minimize.
[2024-05-24 13:22:07] [INFO ] Deduced a trap composed of 18 places in 552 ms of which 6 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 3 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 3 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 3 ms to minimize.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 4 ms to minimize.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 2 ms to minimize.
[2024-05-24 13:22:11] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:12] [INFO ] Deduced a trap composed of 85 places in 494 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 22/492 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:14] [INFO ] Deduced a trap composed of 19 places in 822 ms of which 8 ms to minimize.
[2024-05-24 13:22:15] [INFO ] Deduced a trap composed of 3 places in 727 ms of which 11 ms to minimize.
[2024-05-24 13:22:15] [INFO ] Deduced a trap composed of 25 places in 340 ms of which 4 ms to minimize.
[2024-05-24 13:22:16] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 4 ms to minimize.
[2024-05-24 13:22:16] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 4 ms to minimize.
[2024-05-24 13:22:17] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 3 ms to minimize.
[2024-05-24 13:22:18] [INFO ] Deduced a trap composed of 27 places in 695 ms of which 7 ms to minimize.
[2024-05-24 13:22:18] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:19] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 3 ms to minimize.
[2024-05-24 13:22:19] [INFO ] Deduced a trap composed of 17 places in 392 ms of which 4 ms to minimize.
[2024-05-24 13:22:20] [INFO ] Deduced a trap composed of 121 places in 510 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 850/1342 variables, 492/559 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 372/931 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 21/952 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 3 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 91 places in 600 ms of which 6 ms to minimize.
[2024-05-24 13:22:25] [INFO ] Deduced a trap composed of 79 places in 394 ms of which 4 ms to minimize.
[2024-05-24 13:22:25] [INFO ] Deduced a trap composed of 77 places in 549 ms of which 6 ms to minimize.
[2024-05-24 13:22:26] [INFO ] Deduced a trap composed of 42 places in 662 ms of which 7 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 87 places in 646 ms of which 7 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 81 places in 652 ms of which 7 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 92 places in 647 ms of which 6 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 88 places in 663 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1342 variables, 9/961 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:32] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1342 variables, 1/962 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:35] [INFO ] Deduced a trap composed of 74 places in 545 ms of which 7 ms to minimize.
[2024-05-24 13:22:37] [INFO ] Deduced a trap composed of 82 places in 691 ms of which 9 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1342 variables, 2/964 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:40] [INFO ] Deduced a trap composed of 103 places in 648 ms of which 7 ms to minimize.
[2024-05-24 13:22:41] [INFO ] Deduced a trap composed of 80 places in 716 ms of which 7 ms to minimize.
[2024-05-24 13:22:43] [INFO ] Deduced a trap composed of 110 places in 845 ms of which 8 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1342 variables, 3/967 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:22:46] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 65 places in 741 ms of which 7 ms to minimize.
[2024-05-24 13:22:48] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1342 variables, 3/970 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 970 constraints, problems are : Problem set: 0 solved, 21 unsolved in 45011 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: 57/57 constraints]
After SMT, in 53390ms 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 6 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 241 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 241 ms. Remains : 489/492 places, 2926/2929 transitions.
RANDOM walk for 40000 steps (8 resets) in 1093 ms. (36 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 12 ms. (308 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 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 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 10 ms. (364 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 13 ms. (286 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 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 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 12 ms. (308 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 114480 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 21
Probabilistic random walk after 114480 steps, saw 78705 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-24 13:22:54] [INFO ] Flow matrix only has 847 transitions (discarded 2079 similar events)
// Phase 1: matrix 847 rows 489 cols
[2024-05-24 13:22:54] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 13:22:54] [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-05-24 13:22:55] [INFO ] Deduced a trap composed of 62 places in 728 ms of which 7 ms to minimize.
[2024-05-24 13:22:56] [INFO ] Deduced a trap composed of 3 places in 633 ms of which 6 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 30 places in 448 ms of which 4 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 16 places in 417 ms of which 4 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 3 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 2 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 2 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 3 places in 606 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 7381 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-05-24 13:23:02] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 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-05-24 13:23:03] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 4 ms to minimize.
[2024-05-24 13:23:03] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 4 ms to minimize.
[2024-05-24 13:23:04] [INFO ] Deduced a trap composed of 18 places in 345 ms of which 6 ms to minimize.
[2024-05-24 13:23:04] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-24 13:23:04] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
[2024-05-24 13:23:05] [INFO ] Deduced a trap composed of 20 places in 654 ms of which 7 ms to minimize.
[2024-05-24 13:23:06] [INFO ] Deduced a trap composed of 12 places in 616 ms of which 7 ms to minimize.
[2024-05-24 13:23:06] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 2 ms to minimize.
[2024-05-24 13:23:06] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 2 ms to minimize.
[2024-05-24 13:23:06] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-05-24 13:23:07] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 11 ms to minimize.
[2024-05-24 13:23:07] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 2 ms to minimize.
[2024-05-24 13:23:07] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
[2024-05-24 13:23:07] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-05-24 13:23:08] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 2 ms to minimize.
[2024-05-24 13:23:08] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2024-05-24 13:23:08] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:09] [INFO ] Deduced a trap composed of 25 places in 183 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
[2024-05-24 13:23:09] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:10] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 3 ms to minimize.
[2024-05-24 13:23:11] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 22/489 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/489 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:13] [INFO ] Deduced a trap composed of 52 places in 770 ms of which 7 ms to minimize.
[2024-05-24 13:23:13] [INFO ] Deduced a trap composed of 21 places in 709 ms of which 7 ms to minimize.
[2024-05-24 13:23:14] [INFO ] Deduced a trap composed of 97 places in 625 ms of which 6 ms to minimize.
[2024-05-24 13:23:15] [INFO ] Deduced a trap composed of 3 places in 765 ms of which 7 ms to minimize.
[2024-05-24 13:23:16] [INFO ] Deduced a trap composed of 103 places in 694 ms of which 7 ms to minimize.
[2024-05-24 13:23:16] [INFO ] Deduced a trap composed of 83 places in 651 ms of which 6 ms to minimize.
[2024-05-24 13:23:17] [INFO ] Deduced a trap composed of 86 places in 685 ms of which 7 ms to minimize.
[2024-05-24 13:23:18] [INFO ] Deduced a trap composed of 102 places in 693 ms of which 7 ms to minimize.
[2024-05-24 13:23:18] [INFO ] Deduced a trap composed of 34 places in 688 ms of which 7 ms to minimize.
[2024-05-24 13:23:19] [INFO ] Deduced a trap composed of 13 places in 736 ms of which 7 ms to minimize.
[2024-05-24 13:23:20] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 3 ms to minimize.
[2024-05-24 13:23:20] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 2 ms to minimize.
[2024-05-24 13:23:21] [INFO ] Deduced a trap composed of 125 places in 691 ms of which 6 ms to minimize.
[2024-05-24 13:23:22] [INFO ] Deduced a trap composed of 98 places in 738 ms of which 6 ms to minimize.
[2024-05-24 13:23:22] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
[2024-05-24 13:23:22] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/489 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:23] [INFO ] Deduced a trap composed of 88 places in 713 ms of which 6 ms to minimize.
[2024-05-24 13:23:24] [INFO ] Deduced a trap composed of 87 places in 655 ms of which 6 ms to minimize.
[2024-05-24 13:23:24] [INFO ] Deduced a trap composed of 78 places in 657 ms of which 7 ms to minimize.
[2024-05-24 13:23:25] [INFO ] Deduced a trap composed of 116 places in 641 ms of which 6 ms to minimize.
[2024-05-24 13:23:26] [INFO ] Deduced a trap composed of 100 places in 705 ms of which 7 ms to minimize.
[2024-05-24 13:23:26] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 3 ms to minimize.
[2024-05-24 13:23:27] [INFO ] Deduced a trap composed of 106 places in 788 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/489 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:29] [INFO ] Deduced a trap composed of 30 places in 780 ms of which 7 ms to minimize.
[2024-05-24 13:23:29] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 3 ms to minimize.
[2024-05-24 13:23:29] [INFO ] Deduced a trap composed of 97 places in 646 ms of which 6 ms to minimize.
[2024-05-24 13:23:30] [INFO ] Deduced a trap composed of 90 places in 752 ms of which 7 ms to minimize.
[2024-05-24 13:23:31] [INFO ] Deduced a trap composed of 21 places in 809 ms of which 7 ms to minimize.
[2024-05-24 13:23:32] [INFO ] Deduced a trap composed of 84 places in 727 ms of which 7 ms to minimize.
[2024-05-24 13:23:33] [INFO ] Deduced a trap composed of 95 places in 777 ms of which 7 ms to minimize.
[2024-05-24 13:23:33] [INFO ] Deduced a trap composed of 86 places in 733 ms of which 7 ms to minimize.
[2024-05-24 13:23:34] [INFO ] Deduced a trap composed of 88 places in 735 ms of which 6 ms to minimize.
[2024-05-24 13:23:35] [INFO ] Deduced a trap composed of 127 places in 801 ms of which 7 ms to minimize.
[2024-05-24 13:23:36] [INFO ] Deduced a trap composed of 116 places in 762 ms of which 7 ms to minimize.
[2024-05-24 13:23:37] [INFO ] Deduced a trap composed of 99 places in 698 ms of which 7 ms to minimize.
[2024-05-24 13:23:37] [INFO ] Deduced a trap composed of 92 places in 767 ms of which 7 ms to minimize.
[2024-05-24 13:23:38] [INFO ] Deduced a trap composed of 108 places in 688 ms of which 6 ms to minimize.
[2024-05-24 13:23:39] [INFO ] Deduced a trap composed of 97 places in 783 ms of which 7 ms to minimize.
[2024-05-24 13:23:40] [INFO ] Deduced a trap composed of 93 places in 615 ms of which 6 ms to minimize.
[2024-05-24 13:23:40] [INFO ] Deduced a trap composed of 99 places in 619 ms of which 6 ms to minimize.
[2024-05-24 13:23:41] [INFO ] Deduced a trap composed of 89 places in 608 ms of which 6 ms to minimize.
[2024-05-24 13:23:42] [INFO ] Deduced a trap composed of 84 places in 686 ms of which 6 ms to minimize.
[2024-05-24 13:23:42] [INFO ] Deduced a trap composed of 81 places in 412 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/489 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:42] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 4 ms to minimize.
[2024-05-24 13:23:43] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 3 ms to minimize.
[2024-05-24 13:23:43] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:45] [INFO ] Deduced a trap composed of 84 places in 479 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/489 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 847/1336 variables, 489/594 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1336 variables, 372/966 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1336 variables, 21/987 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:47] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 3 ms to minimize.
[2024-05-24 13:23:48] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1336 variables, 2/989 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:51] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1336 variables, 1/990 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:54] [INFO ] Deduced a trap composed of 86 places in 522 ms of which 9 ms to minimize.
[2024-05-24 13:23:55] [INFO ] Deduced a trap composed of 92 places in 686 ms of which 7 ms to minimize.
[2024-05-24 13:23:56] [INFO ] Deduced a trap composed of 99 places in 676 ms of which 6 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1336 variables, 3/993 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:23:59] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2024-05-24 13:23:59] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1336 variables, 2/995 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1336 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 13:24:05] [INFO ] Deduced a trap composed of 89 places in 467 ms of which 4 ms to minimize.
[2024-05-24 13:24:06] [INFO ] Deduced a trap composed of 77 places in 475 ms of which 5 ms to minimize.
[2024-05-24 13:24:06] [INFO ] Deduced a trap composed of 52 places in 507 ms of which 5 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/1336 variables, 3/998 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1336 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 31 (OVERLAPS) 0/1336 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 998 constraints, problems are : Problem set: 0 solved, 21 unsolved in 72810 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: 88/88 constraints]
After SMT, in 80252ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 2 properties in 7307 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 141 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 142 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 4 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 7 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 626 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 13:24:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:24:23] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 13:24:24] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-05-24 13:24:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:24:24] [INFO ] Invariant cache hit.
[2024-05-24 13:24:24] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:24:29] [INFO ] Implicit Places using invariants and state equation in 5324 ms returned []
Implicit Place search using SMT with State Equation took 6380 ms to find 0 implicit places.
[2024-05-24 13:24:30] [INFO ] Redundant transitions in 346 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:24:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:24:30] [INFO ] Invariant cache hit.
[2024-05-24 13:24: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 32455ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32511ms
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 39896 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 386 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 530 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-00 finished in 40974 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 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 2908
Applied a total of 672 rules in 404 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-05-24 13:25:03] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 13:25:03] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 13:25:04] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-24 13:25:04] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:25:04] [INFO ] Invariant cache hit.
[2024-05-24 13:25:05] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:25:09] [INFO ] Implicit Places using invariants and state equation in 4392 ms returned []
Implicit Place search using SMT with State Equation took 5207 ms to find 0 implicit places.
[2024-05-24 13:25:09] [INFO ] Redundant transitions in 233 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:25:09] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:25:09] [INFO ] Invariant cache hit.
[2024-05-24 13:25:09] [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 32447ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32487ms
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 38352 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 51 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 620 ms.
Product exploration explored 100000 steps with 0 reset in 681 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 147 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 51 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 887 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 172280 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :3 out of 6
Probabilistic random walk after 172280 steps, saw 114125 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :3
[2024-05-24 13:25:47] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:25:47] [INFO ] Invariant cache hit.
[2024-05-24 13:25:47] [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 810 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-05-24 13:25:48] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 3 ms to minimize.
[2024-05-24 13:25:49] [INFO ] Deduced a trap composed of 38 places in 395 ms of which 4 ms to minimize.
[2024-05-24 13:25:49] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 3 ms to minimize.
[2024-05-24 13:25:50] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 4 ms to minimize.
[2024-05-24 13:25:50] [INFO ] Deduced a trap composed of 31 places in 475 ms of which 4 ms to minimize.
[2024-05-24 13:25:51] [INFO ] Deduced a trap composed of 55 places in 485 ms of which 5 ms to minimize.
[2024-05-24 13:25:51] [INFO ] Deduced a trap composed of 3 places in 507 ms of which 5 ms to minimize.
[2024-05-24 13:25:52] [INFO ] Deduced a trap composed of 26 places in 518 ms of which 5 ms to minimize.
[2024-05-24 13:25:52] [INFO ] Deduced a trap composed of 35 places in 545 ms of which 6 ms to minimize.
[2024-05-24 13:25:53] [INFO ] Deduced a trap composed of 19 places in 572 ms of which 5 ms to minimize.
SMT process timed out in 6323ms, 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 185 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 188 ms. Remains : 487/487 places, 2908/2908 transitions.
RANDOM walk for 40000 steps (8 resets) in 845 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 189670 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 189670 steps, saw 124563 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-24 13:25:57] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:25:57] [INFO ] Invariant cache hit.
[2024-05-24 13:25:57] [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 938 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-05-24 13:25:59] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 4 ms to minimize.
[2024-05-24 13:25:59] [INFO ] Deduced a trap composed of 38 places in 345 ms of which 4 ms to minimize.
[2024-05-24 13:26:00] [INFO ] Deduced a trap composed of 7 places in 491 ms of which 4 ms to minimize.
[2024-05-24 13:26:00] [INFO ] Deduced a trap composed of 21 places in 466 ms of which 4 ms to minimize.
[2024-05-24 13:26:01] [INFO ] Deduced a trap composed of 31 places in 472 ms of which 4 ms to minimize.
[2024-05-24 13:26:01] [INFO ] Deduced a trap composed of 55 places in 495 ms of which 5 ms to minimize.
[2024-05-24 13:26:02] [INFO ] Deduced a trap composed of 3 places in 484 ms of which 5 ms to minimize.
[2024-05-24 13:26:02] [INFO ] Deduced a trap composed of 26 places in 501 ms of which 4 ms to minimize.
[2024-05-24 13:26:03] [INFO ] Deduced a trap composed of 35 places in 541 ms of which 6 ms to minimize.
[2024-05-24 13:26:03] [INFO ] Deduced a trap composed of 19 places in 547 ms of which 6 ms to minimize.
[2024-05-24 13:26:04] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 4 ms to minimize.
[2024-05-24 13:26:04] [INFO ] Deduced a trap composed of 22 places in 551 ms of which 5 ms to minimize.
[2024-05-24 13:26:05] [INFO ] Deduced a trap composed of 31 places in 462 ms of which 4 ms to minimize.
[2024-05-24 13:26:05] [INFO ] Deduced a trap composed of 3 places in 453 ms of which 5 ms to minimize.
[2024-05-24 13:26:06] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 4 ms to minimize.
[2024-05-24 13:26:06] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 3 ms to minimize.
[2024-05-24 13:26:06] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-24 13:26:06] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 3 ms to minimize.
[2024-05-24 13:26:07] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 2 ms to minimize.
[2024-05-24 13:26:07] [INFO ] Deduced a trap composed of 15 places in 121 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-05-24 13:26:07] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 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 10283 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 11261ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 687 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 207 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 209 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 200 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 13:26:09] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:26:09] [INFO ] Invariant cache hit.
[2024-05-24 13:26:10] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-05-24 13:26:10] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:26:10] [INFO ] Invariant cache hit.
[2024-05-24 13:26:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:26:14] [INFO ] Implicit Places using invariants and state equation in 3972 ms returned []
Implicit Place search using SMT with State Equation took 4828 ms to find 0 implicit places.
[2024-05-24 13:26:14] [INFO ] Redundant transitions in 102 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:26:14] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:26:14] [INFO ] Invariant cache hit.
[2024-05-24 13:26:14] [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 32472ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37665 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 9 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 1 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 123 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-05-24 13:26:47] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 13:26:47] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 13:26:47] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:26:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:26:47] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:26:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:26:47] [INFO ] After 41ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 13:26:47] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-24 13:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-24 13:26:47] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-24 13:26:47] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-24 13:26:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
TRAPS : Iteration 1
[2024-05-24 13:26:48] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:26:48] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 922 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 301 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 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 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 132 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 13:26:48] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 13:26:48] [INFO ] Computed 28 invariants in 8 ms
[2024-05-24 13:26:49] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2024-05-24 13:26:49] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:26:49] [INFO ] Invariant cache hit.
[2024-05-24 13:26:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:26:53] [INFO ] Implicit Places using invariants and state equation in 4143 ms returned []
Implicit Place search using SMT with State Equation took 5245 ms to find 0 implicit places.
[2024-05-24 13:26:54] [INFO ] Redundant transitions in 161 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:26:54] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:26:54] [INFO ] Invariant cache hit.
[2024-05-24 13:26:54] [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 0.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 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 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 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 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 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 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.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 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 32421ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32461ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38014 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 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 38 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 291 ms. (136 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 337900 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337900 steps, saw 211558 distinct states, run finished after 3006 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 13:27:29] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:27:29] [INFO ] Invariant cache hit.
[2024-05-24 13:27:29] [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 612 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-05-24 13:27:30] [INFO ] Deduced a trap composed of 3 places in 83 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
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-05-24 13:27:31] [INFO ] Deduced a trap composed of 124 places in 564 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-05-24 13:27:31] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 3 ms to minimize.
[2024-05-24 13:27:32] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 3 ms to minimize.
[2024-05-24 13:27:32] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 3 ms to minimize.
[2024-05-24 13:27:32] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 4 ms to minimize.
[2024-05-24 13:27:33] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 3 ms to minimize.
[2024-05-24 13:27:33] [INFO ] Deduced a trap composed of 41 places in 399 ms of which 3 ms to minimize.
[2024-05-24 13:27:34] [INFO ] Deduced a trap composed of 27 places in 358 ms of which 3 ms to minimize.
[2024-05-24 13:27:34] [INFO ] Deduced a trap composed of 35 places in 337 ms of which 3 ms to minimize.
[2024-05-24 13:27:34] [INFO ] Deduced a trap composed of 26 places in 439 ms of which 5 ms to minimize.
[2024-05-24 13:27:35] [INFO ] Deduced a trap composed of 46 places in 339 ms of which 4 ms to minimize.
[2024-05-24 13:27:35] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 4 ms to minimize.
SMT process timed out in 5790ms, After SMT, 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 4 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 227 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 229 ms. Remains : 486/487 places, 2907/2908 transitions.
RANDOM walk for 40000 steps (8 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 336890 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 336890 steps, saw 210779 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 13:27:38] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:27:38] [INFO ] Computed 28 invariants in 8 ms
[2024-05-24 13:27:38] [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-05-24 13:27:39] [INFO ] Deduced a trap composed of 3 places in 55 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 636 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-05-24 13:27:40] [INFO ] Deduced a trap composed of 42 places in 351 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-05-24 13:27:40] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-24 13:27:40] [INFO ] Deduced a trap composed of 3 places in 80 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-05-24 13:27:41] [INFO ] Deduced a trap composed of 60 places in 572 ms of which 5 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 2096 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 2762ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 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 111 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 111 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 109 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:27:42] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:42] [INFO ] Invariant cache hit.
[2024-05-24 13:27:43] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-24 13:27:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:43] [INFO ] Invariant cache hit.
[2024-05-24 13:27:43] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:27:47] [INFO ] Implicit Places using invariants and state equation in 4241 ms returned []
Implicit Place search using SMT with State Equation took 5191 ms to find 0 implicit places.
[2024-05-24 13:27:47] [INFO ] Redundant transitions in 107 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:27:47] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:47] [INFO ] Invariant cache hit.
[2024-05-24 13:27:47] [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 32287ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37742 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 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 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 44 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-05-24 13:28:19] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 13:28:19] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 13:28:19] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:28:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 13:28:19] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:28:19] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 13:28:20] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:20] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 303 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 451 ms.
Product exploration explored 100000 steps with 0 reset in 536 ms.
Built C files in :
/tmp/ltsmin1472422953431128381
[2024-05-24 13:28:21] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:28:21] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1472422953431128381
Running compilation step : cd /tmp/ltsmin1472422953431128381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1472422953431128381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1472422953431128381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 115 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
[2024-05-24 13:28:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:28:24] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 13:28:25] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2024-05-24 13:28:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:28:25] [INFO ] Invariant cache hit.
[2024-05-24 13:28:26] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:28:30] [INFO ] Implicit Places using invariants and state equation in 4625 ms returned []
Implicit Place search using SMT with State Equation took 5671 ms to find 0 implicit places.
[2024-05-24 13:28:30] [INFO ] Redundant transitions in 128 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:28:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:28:30] [INFO ] Invariant cache hit.
[2024-05-24 13:28:30] [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 32489ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32531ms
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 38460 ms. Remains : 486/487 places, 2907/2908 transitions.
Built C files in :
/tmp/ltsmin9195581972854578756
[2024-05-24 13:29:02] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:29:03] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9195581972854578756
Running compilation step : cd /tmp/ltsmin9195581972854578756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9195581972854578756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9195581972854578756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 13:29:06] [INFO ] Flatten gal took : 182 ms
[2024-05-24 13:29:06] [INFO ] Flatten gal took : 141 ms
[2024-05-24 13:29:06] [INFO ] Time to serialize gal into /tmp/LTL2376408321353207912.gal : 40 ms
[2024-05-24 13:29:06] [INFO ] Time to serialize properties into /tmp/LTL17199326916654765491.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2376408321353207912.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3568167094380800966.hoa' '-atoms' '/tmp/LTL17199326916654765491.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17199326916654765491.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3568167094380800966.hoa
Detected timeout of ITS tools.
[2024-05-24 13:29:21] [INFO ] Flatten gal took : 107 ms
[2024-05-24 13:29:22] [INFO ] Flatten gal took : 113 ms
[2024-05-24 13:29:22] [INFO ] Time to serialize gal into /tmp/LTL6674917777399258670.gal : 27 ms
[2024-05-24 13:29:22] [INFO ] Time to serialize properties into /tmp/LTL11455474892317184137.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6674917777399258670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11455474892317184137.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((turn_6==0)||(flag_6_waiting==0))||(p25_3_7==0))&&(flag_3_idle==1))&&(p33_0_3==1))"))||(G("(((turn_6!=1)||(flag_6_waiting...181
Formula 0 simplified : G(F!"(((((turn_6==0)||(flag_6_waiting==0))||(p25_3_7==0))&&(flag_3_idle==1))&&(p33_0_3==1))" & F!"(((turn_6!=1)||(flag_6_waiting!=1)...173
Detected timeout of ITS tools.
[2024-05-24 13:29:37] [INFO ] Flatten gal took : 97 ms
[2024-05-24 13:29:37] [INFO ] Applying decomposition
[2024-05-24 13:29:37] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7743790945731243475.txt' '-o' '/tmp/graph7743790945731243475.bin' '-w' '/tmp/graph7743790945731243475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7743790945731243475.bin' '-l' '-1' '-v' '-w' '/tmp/graph7743790945731243475.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:29:37] [INFO ] Decomposing Gal with order
[2024-05-24 13:29:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:29:38] [INFO ] Removed a total of 6329 redundant transitions.
[2024-05-24 13:29:38] [INFO ] Flatten gal took : 779 ms
[2024-05-24 13:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 173 ms.
[2024-05-24 13:29:39] [INFO ] Time to serialize gal into /tmp/LTL13377363292351294704.gal : 29 ms
[2024-05-24 13:29:39] [INFO ] Time to serialize properties into /tmp/LTL14835436726111882229.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13377363292351294704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14835436726111882229.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((i17.u8.turn_6==0)||(i1.u3.flag_6_waiting==0))||(i2.u4.p25_3_7==0))&&(i0.u1.flag_3_idle==1))&&(i0.u73.p33_0_3==1))"))||(G...232
Formula 0 simplified : G(F!"(((((i17.u8.turn_6==0)||(i1.u3.flag_6_waiting==0))||(i2.u4.p25_3_7==0))&&(i0.u1.flag_3_idle==1))&&(i0.u73.p33_0_3==1))" & F!"((...224
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-01 finished in 290585 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 40 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 13:29:54] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-05-24 13:29:54] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 13:29:55] [INFO ] Implicit Places using invariants in 986 ms returned []
[2024-05-24 13:29:55] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:29:55] [INFO ] Invariant cache hit.
[2024-05-24 13:29:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:30:02] [INFO ] Implicit Places using invariants and state equation in 7750 ms returned []
Implicit Place search using SMT with State Equation took 8745 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 13:30:02] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:30:02] [INFO ] Invariant cache hit.
[2024-05-24 13:30:02] [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 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 1.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 1.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)timeout
(s439 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 32594ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32630ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41422 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 362 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 451 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-02 finished in 42282 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 66 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 13:30:36] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:30:36] [INFO ] Invariant cache hit.
[2024-05-24 13:30:37] [INFO ] Implicit Places using invariants in 1286 ms returned []
[2024-05-24 13:30:37] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:30:37] [INFO ] Invariant cache hit.
[2024-05-24 13:30:38] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:30:46] [INFO ] Implicit Places using invariants and state equation in 9069 ms returned []
Implicit Place search using SMT with State Equation took 10362 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 13:30:46] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:30:46] [INFO ] Invariant cache hit.
[2024-05-24 13:30:46] [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 32396ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32431ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42867 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 275 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 43182 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 66 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 13:31:19] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:31:19] [INFO ] Invariant cache hit.
[2024-05-24 13:31:21] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2024-05-24 13:31:21] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:31:21] [INFO ] Invariant cache hit.
[2024-05-24 13:31:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:31:29] [INFO ] Implicit Places using invariants and state equation in 8281 ms returned []
Implicit Place search using SMT with State Equation took 9699 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 13:31:29] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:31:29] [INFO ] Invariant cache hit.
[2024-05-24 13:31:29] [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 32254ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32289ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42063 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 169 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 696 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-04 finished in 42962 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 4 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 276 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-05-24 13:32:02] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 13:32:02] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 13:32:03] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-05-24 13:32:03] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:32:03] [INFO ] Invariant cache hit.
[2024-05-24 13:32:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:32:07] [INFO ] Implicit Places using invariants and state equation in 4152 ms returned []
Implicit Place search using SMT with State Equation took 4922 ms to find 0 implicit places.
[2024-05-24 13:32:07] [INFO ] Redundant transitions in 162 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:32:07] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:32:07] [INFO ] Invariant cache hit.
[2024-05-24 13:32:07] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 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 32542ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32600ms
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 37977 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 348 ms.
Product exploration explored 100000 steps with 0 reset in 478 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 77 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)]
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 423 ms. (steps per millisecond=128 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 430 ms. (steps per millisecond=126 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 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)]
Stuttering acceptance computed with spot in 33 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 108 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 13:32:42] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:32:42] [INFO ] Invariant cache hit.
[2024-05-24 13:32:43] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2024-05-24 13:32:43] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:32:43] [INFO ] Invariant cache hit.
[2024-05-24 13:32:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:32:48] [INFO ] Implicit Places using invariants and state equation in 5365 ms returned []
Implicit Place search using SMT with State Equation took 6423 ms to find 0 implicit places.
[2024-05-24 13:32:48] [INFO ] Redundant transitions in 158 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:32:49] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:32:49] [INFO ] Invariant cache hit.
[2024-05-24 13:32:49] [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 32750ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39524 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 109 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 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 472 ms. (steps per millisecond=115 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 472 ms. (steps per millisecond=115 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 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)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 337 ms.
Built C files in :
/tmp/ltsmin15665659611204796571
[2024-05-24 13:33:23] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:33:23] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15665659611204796571
Running compilation step : cd /tmp/ltsmin15665659611204796571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15665659611204796571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15665659611204796571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 174 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 13:33:26] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:33:26] [INFO ] Invariant cache hit.
[2024-05-24 13:33:27] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2024-05-24 13:33:27] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:33:27] [INFO ] Invariant cache hit.
[2024-05-24 13:33:28] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:33:32] [INFO ] Implicit Places using invariants and state equation in 4542 ms returned []
Implicit Place search using SMT with State Equation took 5630 ms to find 0 implicit places.
[2024-05-24 13:33:32] [INFO ] Redundant transitions in 95 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:33:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:33:32] [INFO ] Invariant cache hit.
[2024-05-24 13:33:32] [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 32571ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32603ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38515 ms. Remains : 487/487 places, 2908/2908 transitions.
Built C files in :
/tmp/ltsmin6888815431904499398
[2024-05-24 13:34:05] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:34:05] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6888815431904499398
Running compilation step : cd /tmp/ltsmin6888815431904499398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6888815431904499398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6888815431904499398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 13:34:08] [INFO ] Flatten gal took : 82 ms
[2024-05-24 13:34:08] [INFO ] Flatten gal took : 83 ms
[2024-05-24 13:34:08] [INFO ] Time to serialize gal into /tmp/LTL5717292221141043906.gal : 13 ms
[2024-05-24 13:34:08] [INFO ] Time to serialize properties into /tmp/LTL10538289399357996974.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5717292221141043906.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12322118676049616672.hoa' '-atoms' '/tmp/LTL10538289399357996974.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10538289399357996974.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12322118676049616672.hoa
Detected timeout of ITS tools.
[2024-05-24 13:34:23] [INFO ] Flatten gal took : 75 ms
[2024-05-24 13:34:23] [INFO ] Flatten gal took : 76 ms
[2024-05-24 13:34:23] [INFO ] Time to serialize gal into /tmp/LTL8017981560542844157.gal : 14 ms
[2024-05-24 13:34:23] [INFO ] Time to serialize properties into /tmp/LTL1265047764039808006.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8017981560542844157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1265047764039808006.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(p34_2_6!=1)"))))
Formula 0 simplified : GF!"(p34_2_6!=1)"
Detected timeout of ITS tools.
[2024-05-24 13:34:38] [INFO ] Flatten gal took : 74 ms
[2024-05-24 13:34:38] [INFO ] Applying decomposition
[2024-05-24 13:34:38] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10011225764285474819.txt' '-o' '/tmp/graph10011225764285474819.bin' '-w' '/tmp/graph10011225764285474819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10011225764285474819.bin' '-l' '-1' '-v' '-w' '/tmp/graph10011225764285474819.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:34:39] [INFO ] Decomposing Gal with order
[2024-05-24 13:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:34:39] [INFO ] Removed a total of 6353 redundant transitions.
[2024-05-24 13:34:39] [INFO ] Flatten gal took : 391 ms
[2024-05-24 13:34:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 665 labels/synchronizations in 117 ms.
[2024-05-24 13:34:39] [INFO ] Time to serialize gal into /tmp/LTL1783933424659236017.gal : 21 ms
[2024-05-24 13:34:39] [INFO ] Time to serialize properties into /tmp/LTL3658834875448290281.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1783933424659236017.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3658834875448290281.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i18.u72.p34_2_6!=1)"))))
Formula 0 simplified : GF!"(i18.u72.p34_2_6!=1)"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-05 finished in 172420 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 40 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 13:34:54] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 13:34:54] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 13:34:56] [INFO ] Implicit Places using invariants in 1451 ms returned []
[2024-05-24 13:34:56] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 13:34:56] [INFO ] Invariant cache hit.
[2024-05-24 13:34:57] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:35:04] [INFO ] Implicit Places using invariants and state equation in 7830 ms returned []
Implicit Place search using SMT with State Equation took 9283 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 13:35:04] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 13:35:04] [INFO ] Invariant cache hit.
[2024-05-24 13:35:04] [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/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32477ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32511ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41841 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 192 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 635 ms.
Product exploration explored 100000 steps with 0 reset in 666 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 150 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 105 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 72560 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 4
Probabilistic random walk after 72560 steps, saw 57571 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 13:35:41] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 13:35:41] [INFO ] Invariant cache hit.
[2024-05-24 13:35:41] [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 1437 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-05-24 13:35:45] [INFO ] Deduced a trap composed of 32 places in 548 ms of which 8 ms to minimize.
[2024-05-24 13:35:45] [INFO ] Deduced a trap composed of 6 places in 545 ms of which 5 ms to minimize.
[2024-05-24 13:35:46] [INFO ] Deduced a trap composed of 52 places in 422 ms of which 4 ms to minimize.
[2024-05-24 13:35:46] [INFO ] Deduced a trap composed of 27 places in 418 ms of which 5 ms to minimize.
[2024-05-24 13:35:47] [INFO ] Deduced a trap composed of 17 places in 364 ms of which 5 ms to minimize.
[2024-05-24 13:35:47] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-24 13:35:47] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-24 13:35:48] [INFO ] Deduced a trap composed of 39 places in 904 ms of which 9 ms to minimize.
[2024-05-24 13:35:49] [INFO ] Deduced a trap composed of 144 places in 723 ms of which 6 ms to minimize.
SMT process timed out in 7194ms, 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 3 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 172 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 172 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 1009 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 88400 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 3
Probabilistic random walk after 88400 steps, saw 62433 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-24 13:35:52] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 13:35:52] [INFO ] Computed 28 invariants in 8 ms
[2024-05-24 13:35:52] [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 1177 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-05-24 13:35:54] [INFO ] Deduced a trap composed of 3 places in 89 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-05-24 13:35:55] [INFO ] Deduced a trap composed of 51 places in 390 ms of which 4 ms to minimize.
[2024-05-24 13:35:55] [INFO ] Deduced a trap composed of 38 places in 417 ms of which 4 ms to minimize.
[2024-05-24 13:35:55] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-05-24 13:35:55] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 3 ms to minimize.
[2024-05-24 13:35:56] [INFO ] Deduced a trap composed of 38 places in 261 ms of which 3 ms to minimize.
[2024-05-24 13:35:56] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 13:35:56] [INFO ] Deduced a trap composed of 33 places in 164 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-05-24 13:35:56] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
[2024-05-24 13:35:56] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2024-05-24 13:35:57] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 3 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 4473 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 5693ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2889 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 98 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 98 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 98 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 13:36:01] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:36:01] [INFO ] Invariant cache hit.
[2024-05-24 13:36:02] [INFO ] Implicit Places using invariants in 992 ms returned []
[2024-05-24 13:36:02] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:36:02] [INFO ] Invariant cache hit.
[2024-05-24 13:36:03] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:36:07] [INFO ] Implicit Places using invariants and state equation in 4621 ms returned []
Implicit Place search using SMT with State Equation took 5615 ms to find 0 implicit places.
[2024-05-24 13:36:07] [INFO ] Redundant transitions in 98 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 13:36:07] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:36:07] [INFO ] Invariant cache hit.
[2024-05-24 13:36:07] [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 32154ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38009 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 47 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-05-24 13:36:39] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 13:36:39] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:36:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:36:39] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 13:36:39] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:36:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:36:39] [INFO ] After 40ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 13:36:39] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-24 13:36:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-24 13:36:39] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 13:36:39] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 13:36:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2024-05-24 13:36:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 13:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-05-24 13:36:40] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:36:40] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 649 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 161 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 95 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 3 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 2 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 216 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
[2024-05-24 13:36:40] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 13:36:40] [INFO ] Computed 28 invariants in 9 ms
[2024-05-24 13:36:41] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2024-05-24 13:36:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:36:41] [INFO ] Invariant cache hit.
[2024-05-24 13:36:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:36:45] [INFO ] Implicit Places using invariants and state equation in 3869 ms returned []
Implicit Place search using SMT with State Equation took 5017 ms to find 0 implicit places.
[2024-05-24 13:36:45] [INFO ] Redundant transitions in 178 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 13:36:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:36:46] [INFO ] Invariant cache hit.
[2024-05-24 13:36:46] [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 32497ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32550ms
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 37980 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 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 1574 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 98640 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 98640 steps, saw 68625 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-24 13:37:22] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:37:22] [INFO ] Invariant cache hit.
[2024-05-24 13:37:22] [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 1108 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-05-24 13:37:23] [INFO ] Deduced a trap composed of 3 places in 83 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-05-24 13:37:24] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 4 ms to minimize.
[2024-05-24 13:37:25] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 3 ms to minimize.
[2024-05-24 13:37:25] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 4 ms to minimize.
[2024-05-24 13:37:26] [INFO ] Deduced a trap composed of 19 places in 336 ms of which 3 ms to minimize.
[2024-05-24 13:37:26] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 3 ms to minimize.
[2024-05-24 13:37:26] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 3 ms to minimize.
[2024-05-24 13:37:26] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 3 ms to minimize.
[2024-05-24 13:37:27] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2024-05-24 13:37:27] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 3 ms to minimize.
[2024-05-24 13:37:27] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-24 13:37:27] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 3 ms to minimize.
[2024-05-24 13:37:28] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 12/309 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 13:37:28] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 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
SMT process timed out in 6148ms, 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 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 168 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1542 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 85510 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 3
Probabilistic random walk after 85510 steps, saw 60545 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-24 13:37:32] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:37:32] [INFO ] Invariant cache hit.
[2024-05-24 13:37:32] [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 1204 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-05-24 13:37:33] [INFO ] Deduced a trap composed of 3 places in 70 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-05-24 13:37:35] [INFO ] Deduced a trap composed of 7 places in 409 ms of which 3 ms to minimize.
[2024-05-24 13:37:35] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 3 ms to minimize.
[2024-05-24 13:37:35] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 3 ms to minimize.
[2024-05-24 13:37:36] [INFO ] Deduced a trap composed of 3 places in 474 ms of which 5 ms to minimize.
[2024-05-24 13:37:36] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 3 ms to minimize.
[2024-05-24 13:37:37] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 5 ms to minimize.
[2024-05-24 13:37:37] [INFO ] Deduced a trap composed of 29 places in 392 ms of which 4 ms to minimize.
[2024-05-24 13:37:37] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 3 ms to minimize.
[2024-05-24 13:37:38] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 3 ms to minimize.
[2024-05-24 13:37:38] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 3 ms to minimize.
[2024-05-24 13:37:38] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 2 ms to minimize.
[2024-05-24 13:37:39] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 2 ms to minimize.
[2024-05-24 13:37:39] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 2 ms to minimize.
[2024-05-24 13:37:39] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-05-24 13:37:39] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 24 ms to minimize.
[2024-05-24 13:37:39] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-24 13:37:40] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-05-24 13:37:40] [INFO ] Deduced a trap composed of 27 places in 120 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-05-24 13:37:40] [INFO ] Deduced a trap composed of 40 places in 349 ms of which 4 ms to minimize.
[2024-05-24 13:37:41] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 4 ms to minimize.
[2024-05-24 13:37:41] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 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 8772 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 10011ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 3986 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 100 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 100 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1162 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 167320 steps, run timeout after 3003 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 167320 steps, saw 110717 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-24 13:37:50] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:37:50] [INFO ] Invariant cache hit.
[2024-05-24 13:37:50] [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 662 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-05-24 13:37:50] [INFO ] Deduced a trap composed of 3 places in 62 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, 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-05-24 13:37:51] [INFO ] Deduced a trap composed of 3 places in 656 ms of which 7 ms to minimize.
[2024-05-24 13:37:52] [INFO ] Deduced a trap composed of 47 places in 452 ms of which 3 ms to minimize.
[2024-05-24 13:37:52] [INFO ] Deduced a trap composed of 53 places in 447 ms of which 3 ms to minimize.
[2024-05-24 13:37:53] [INFO ] Deduced a trap composed of 3 places in 406 ms of which 3 ms to minimize.
[2024-05-24 13:37:53] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 2 ms to minimize.
[2024-05-24 13:37:54] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 2 ms to minimize.
[2024-05-24 13:37:54] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 4 ms to minimize.
[2024-05-24 13:37:54] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 3 ms to minimize.
[2024-05-24 13:37:55] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 3 ms to minimize.
[2024-05-24 13:37:55] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 3 ms to minimize.
[2024-05-24 13:37:55] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 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 5732 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 6414ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1393 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 184 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 184 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 116 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 13:37:58] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:37:58] [INFO ] Invariant cache hit.
[2024-05-24 13:37:59] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-24 13:37:59] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:37:59] [INFO ] Invariant cache hit.
[2024-05-24 13:37:59] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:38:03] [INFO ] Implicit Places using invariants and state equation in 4855 ms returned []
Implicit Place search using SMT with State Equation took 5725 ms to find 0 implicit places.
[2024-05-24 13:38:04] [INFO ] Redundant transitions in 149 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 13:38:04] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:38:04] [INFO ] Invariant cache hit.
[2024-05-24 13:38:04] [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)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 32418ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38474 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 41 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-05-24 13:38:36] [INFO ] Computed 20 invariants in 2 ms
[2024-05-24 13:38:36] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:38:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 13:38:36] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 13:38:36] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:38:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:38:36] [INFO ] After 38ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 13:38:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 13:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-24 13:38:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 13:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-05-24 13:38:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 13:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-24 13:38:37] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 13:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 2
[2024-05-24 13:38:37] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 13:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 3
[2024-05-24 13:38:37] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:38:37] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 711 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 196 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 125 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 616 ms.
Product exploration explored 100000 steps with 0 reset in 581 ms.
Built C files in :
/tmp/ltsmin17703000857318522533
[2024-05-24 13:38:39] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:38:39] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17703000857318522533
Running compilation step : cd /tmp/ltsmin17703000857318522533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17703000857318522533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17703000857318522533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 109 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 13:38:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 13:38:42] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 13:38:43] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-24 13:38:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:38:43] [INFO ] Invariant cache hit.
[2024-05-24 13:38:43] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:38:47] [INFO ] Implicit Places using invariants and state equation in 4174 ms returned []
Implicit Place search using SMT with State Equation took 5063 ms to find 0 implicit places.
[2024-05-24 13:38:47] [INFO ] Redundant transitions in 161 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 13:38:47] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 13:38:47] [INFO ] Invariant cache hit.
[2024-05-24 13:38: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 32549ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32603ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37952 ms. Remains : 487/487 places, 2916/2916 transitions.
Built C files in :
/tmp/ltsmin14976487333325528836
[2024-05-24 13:39:20] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:39:20] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14976487333325528836
Running compilation step : cd /tmp/ltsmin14976487333325528836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14976487333325528836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14976487333325528836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 13:39:23] [INFO ] Flatten gal took : 126 ms
[2024-05-24 13:39:23] [INFO ] Flatten gal took : 131 ms
[2024-05-24 13:39:23] [INFO ] Time to serialize gal into /tmp/LTL16556451150272472371.gal : 19 ms
[2024-05-24 13:39:23] [INFO ] Time to serialize properties into /tmp/LTL8124307703590933696.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16556451150272472371.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16023722117216190532.hoa' '-atoms' '/tmp/LTL8124307703590933696.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8124307703590933696.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16023722117216190532.hoa
Detected timeout of ITS tools.
[2024-05-24 13:39:38] [INFO ] Flatten gal took : 125 ms
[2024-05-24 13:39:38] [INFO ] Flatten gal took : 127 ms
[2024-05-24 13:39:38] [INFO ] Time to serialize gal into /tmp/LTL16819651550993468833.gal : 18 ms
[2024-05-24 13:39:38] [INFO ] Time to serialize properties into /tmp/LTL17136261354354066922.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16819651550993468833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17136261354354066922.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((turn_5==0)||(flag_5_active==0))")||(("(p25_8_4==0)")||(G("((turn_6==0)||(p10_5_0==0))")))))))
Formula 0 simplified : XF(!"((turn_5==0)||(flag_5_active==0))" & !"(p25_8_4==0)" & F!"((turn_6==0)||(p10_5_0==0))")
Detected timeout of ITS tools.
[2024-05-24 13:39:54] [INFO ] Flatten gal took : 77 ms
[2024-05-24 13:39:54] [INFO ] Applying decomposition
[2024-05-24 13:39:54] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15311487766082499757.txt' '-o' '/tmp/graph15311487766082499757.bin' '-w' '/tmp/graph15311487766082499757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15311487766082499757.bin' '-l' '-1' '-v' '-w' '/tmp/graph15311487766082499757.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:39:54] [INFO ] Decomposing Gal with order
[2024-05-24 13:39:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:39:54] [INFO ] Removed a total of 6347 redundant transitions.
[2024-05-24 13:39:54] [INFO ] Flatten gal took : 272 ms
[2024-05-24 13:39:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 698 labels/synchronizations in 141 ms.
[2024-05-24 13:39:54] [INFO ] Time to serialize gal into /tmp/LTL18052800335442385880.gal : 22 ms
[2024-05-24 13:39:54] [INFO ] Time to serialize properties into /tmp/LTL11523643630234661860.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18052800335442385880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11523643630234661860.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i15.i1.u66.turn_5==0)||(i16.u6.flag_5_active==0))")||(("(i3.u7.p25_8_4==0)")||(G("((i18.u0.turn_6==0)||(u13.p10_5_0==0))"))...160
Formula 0 simplified : XF(!"((i15.i1.u66.turn_5==0)||(i16.u6.flag_5_active==0))" & !"(i3.u7.p25_8_4==0)" & F!"((i18.u0.turn_6==0)||(u13.p10_5_0==0))")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 315084 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 47 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 13:40:10] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 13:40:10] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 13:40:11] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-24 13:40:11] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 13:40:11] [INFO ] Invariant cache hit.
[2024-05-24 13:40:11] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:40:17] [INFO ] Implicit Places using invariants and state equation in 6714 ms returned []
Implicit Place search using SMT with State Equation took 7802 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 13:40:17] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 13:40:17] [INFO ] Invariant cache hit.
[2024-05-24 13:40: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 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 0.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 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 32684ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32729ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40583 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 248 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 50 reset in 428 ms.
Product exploration explored 100000 steps with 51 reset in 686 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 130 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 1171 ms. (34 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 207 ms. (192 steps per ms) remains 2/2 properties
[2024-05-24 13:40:52] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 13:40:52] [INFO ] Invariant cache hit.
[2024-05-24 13:40:52] [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 1599 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-05-24 13:40:55] [INFO ] Deduced a trap composed of 35 places in 419 ms of which 4 ms to minimize.
[2024-05-24 13:40:55] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 6 ms to minimize.
[2024-05-24 13:40:56] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 6 ms to minimize.
[2024-05-24 13:40:56] [INFO ] Deduced a trap composed of 54 places in 457 ms of which 6 ms to minimize.
[2024-05-24 13:40:57] [INFO ] Deduced a trap composed of 44 places in 394 ms of which 6 ms to minimize.
[2024-05-24 13:40:57] [INFO ] Deduced a trap composed of 90 places in 479 ms of which 7 ms to minimize.
[2024-05-24 13:40:58] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 6 ms to minimize.
[2024-05-24 13:40:58] [INFO ] Deduced a trap composed of 38 places in 490 ms of which 7 ms to minimize.
[2024-05-24 13:40:59] [INFO ] Deduced a trap composed of 51 places in 509 ms of which 6 ms to minimize.
[2024-05-24 13:40:59] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 6 ms to minimize.
SMT process timed out in 6997ms, 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 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 179 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 180 ms. Remains : 488/820 places, 2917/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 672 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 168220 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168220 steps, saw 111027 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-24 13:41:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 13:41:03] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 13:41: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 716 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-05-24 13:41:04] [INFO ] Deduced a trap composed of 3 places in 421 ms of which 3 ms to minimize.
[2024-05-24 13:41:05] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 2 ms to minimize.
[2024-05-24 13:41:05] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 3 ms to minimize.
[2024-05-24 13:41:06] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 3 ms to minimize.
[2024-05-24 13:41:06] [INFO ] Deduced a trap composed of 15 places in 386 ms of which 4 ms to minimize.
[2024-05-24 13:41:06] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 3 ms to minimize.
[2024-05-24 13:41:07] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 3 ms to minimize.
[2024-05-24 13:41:07] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 4 ms to minimize.
[2024-05-24 13:41:07] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 3 ms to minimize.
[2024-05-24 13:41:07] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2024-05-24 13:41:08] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2024-05-24 13:41:08] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 3 ms to minimize.
[2024-05-24 13:41:08] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-05-24 13:41:08] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-24 13:41:08] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-05-24 13:41:08] [INFO ] Deduced a trap composed of 3 places in 58 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-05-24 13:41:09] [INFO ] Deduced a trap composed of 33 places in 104 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 5650 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 6388ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 362 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 134 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 135 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 98 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 13:41:10] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:41:10] [INFO ] Invariant cache hit.
[2024-05-24 13:41:11] [INFO ] Implicit Places using invariants in 849 ms returned []
[2024-05-24 13:41:11] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:41:11] [INFO ] Invariant cache hit.
[2024-05-24 13:41:11] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:41:15] [INFO ] Implicit Places using invariants and state equation in 4451 ms returned []
Implicit Place search using SMT with State Equation took 5304 ms to find 0 implicit places.
[2024-05-24 13:41:15] [INFO ] Redundant transitions in 95 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 13:41:15] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:41:15] [INFO ] Invariant cache hit.
[2024-05-24 13:41:15] [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 32086ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37637 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 34 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-05-24 13:41:47] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 13:41:47] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:41:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:41:47] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 13:41:47] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:41:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 13:41:48] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 13:41:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-24 13:41:48] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-24 13:41:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2024-05-24 13:41:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 13:41:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
TRAPS : Iteration 1
[2024-05-24 13:41:48] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:41:48] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 401 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 250 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 97 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 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 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 174 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2024-05-24 13:41:48] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 13:41:48] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 13:41:49] [INFO ] Implicit Places using invariants in 1097 ms returned []
[2024-05-24 13:41:49] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:41:49] [INFO ] Invariant cache hit.
[2024-05-24 13:41:50] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:41:53] [INFO ] Implicit Places using invariants and state equation in 3662 ms returned []
Implicit Place search using SMT with State Equation took 4761 ms to find 0 implicit places.
[2024-05-24 13:41:53] [INFO ] Redundant transitions in 108 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 13:41:53] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:41:53] [INFO ] Invariant cache hit.
[2024-05-24 13:41: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
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1326 variables, and 28 constraints, problems are : Problem set: 0 solved, 2908 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/488 constraints, ReadFeed: 0/364 constraints, PredecessorRefiner: 2908/2908 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2908 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
[2024-05-24 13:42:31] [INFO ] Deduced a trap composed of 3 places in 496 ms of which 4 ms to minimize.
[2024-05-24 13:42:31] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 3 ms to minimize.
[2024-05-24 13:42:32] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 3 ms to minimize.
[2024-05-24 13:42:32] [INFO ] Deduced a trap composed of 3 places in 292 ms of which 4 ms to minimize.
[2024-05-24 13:42:32] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2024-05-24 13:42:32] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2024-05-24 13:42:32] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-24 13:42:33] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-24 13:42:33] [INFO ] Deduced a trap composed of 49 places in 348 ms of which 5 ms to minimize.
[2024-05-24 13:42:33] [INFO ] Deduced a trap composed of 76 places in 370 ms of which 5 ms to minimize.
[2024-05-24 13:42:36] [INFO ] Deduced a trap composed of 51 places in 381 ms of which 5 ms to minimize.
[2024-05-24 13:42:36] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 5 ms to minimize.
[2024-05-24 13:42:37] [INFO ] Deduced a trap composed of 75 places in 412 ms of which 5 ms to minimize.
[2024-05-24 13:42:37] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 3 ms to minimize.
[2024-05-24 13:42:38] [INFO ] Deduced a trap composed of 49 places in 312 ms of which 4 ms to minimize.
[2024-05-24 13:42:38] [INFO ] Deduced a trap composed of 79 places in 335 ms of which 6 ms to minimize.
[2024-05-24 13:42:38] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 3 ms to minimize.
[2024-05-24 13:42:39] [INFO ] Deduced a trap composed of 47 places in 367 ms of which 5 ms to minimize.
[2024-05-24 13:42:39] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2024-05-24 13:42:39] [INFO ] Deduced a trap composed of 81 places in 414 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
[2024-05-24 13:42:42] [INFO ] Deduced a trap composed of 80 places in 436 ms of which 5 ms to minimize.
[2024-05-24 13:42:42] [INFO ] Deduced a trap composed of 67 places in 340 ms of which 4 ms to minimize.
[2024-05-24 13:42:42] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 4 ms to minimize.
[2024-05-24 13:42:43] [INFO ] Deduced a trap composed of 26 places in 473 ms of which 6 ms to minimize.
[2024-05-24 13:42:43] [INFO ] Deduced a trap composed of 47 places in 440 ms of which 4 ms to minimize.
[2024-05-24 13:42:44] [INFO ] Deduced a trap composed of 33 places in 423 ms of which 5 ms to minimize.
[2024-05-24 13:42:44] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 4 ms to minimize.
[2024-05-24 13:42:44] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-24 13:42:47] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 4 ms to minimize.
[2024-05-24 13:42:48] [INFO ] Deduced a trap composed of 71 places in 342 ms of which 3 ms to minimize.
[2024-05-24 13:42:48] [INFO ] Deduced a trap composed of 25 places in 395 ms of which 3 ms to minimize.
[2024-05-24 13:42:49] [INFO ] Deduced a trap composed of 31 places in 463 ms of which 4 ms to minimize.
[2024-05-24 13:42:49] [INFO ] Deduced a trap composed of 65 places in 438 ms of which 4 ms to minimize.
[2024-05-24 13:42:50] [INFO ] Deduced a trap composed of 63 places in 485 ms of which 4 ms to minimize.
[2024-05-24 13:42:51] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 4 ms to minimize.
[2024-05-24 13:42:51] [INFO ] Deduced a trap composed of 86 places in 365 ms of which 4 ms to minimize.
[2024-05-24 13:42:52] [INFO ] Deduced a trap composed of 63 places in 338 ms of which 3 ms to minimize.
[2024-05-24 13:42:52] [INFO ] Deduced a trap composed of 83 places in 443 ms of which 4 ms to minimize.
[2024-05-24 13:42:53] [INFO ] Deduced a trap composed of 75 places in 366 ms of which 4 ms to minimize.
[2024-05-24 13:42:53] [INFO ] Deduced a trap composed of 86 places in 396 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1326 variables, and 68 constraints, problems are : Problem set: 0 solved, 2908 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/488 constraints, ReadFeed: 0/364 constraints, PredecessorRefiner: 0/2908 constraints, Known Traps: 40/40 constraints]
After SMT, in 62180ms problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 62211ms
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 67263 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 109 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 114 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 1120 ms. (35 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
[2024-05-24 13:42:56] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:42:56] [INFO ] Invariant cache hit.
[2024-05-24 13:42:56] [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 673 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-05-24 13:42:58] [INFO ] Deduced a trap composed of 5 places in 666 ms of which 3 ms to minimize.
[2024-05-24 13:42:59] [INFO ] Deduced a trap composed of 12 places in 552 ms of which 6 ms to minimize.
[2024-05-24 13:42:59] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 3 ms to minimize.
[2024-05-24 13:43:00] [INFO ] Deduced a trap composed of 3 places in 604 ms of which 4 ms to minimize.
[2024-05-24 13:43:00] [INFO ] Deduced a trap composed of 47 places in 611 ms of which 4 ms to minimize.
[2024-05-24 13:43:01] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 3 ms to minimize.
[2024-05-24 13:43:01] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 2 ms to minimize.
[2024-05-24 13:43:01] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 3 ms to minimize.
[2024-05-24 13:43:02] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 2 ms to minimize.
[2024-05-24 13:43:02] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 2 ms to minimize.
[2024-05-24 13:43:02] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 2 ms to minimize.
SMT process timed out in 5956ms, 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 230 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 230 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 1083 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 176300 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 176300 steps, saw 115958 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-24 13:43:06] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:43:06] [INFO ] Invariant cache hit.
[2024-05-24 13:43:06] [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 734 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-05-24 13:43:08] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 4 ms to minimize.
[2024-05-24 13:43:08] [INFO ] Deduced a trap composed of 12 places in 443 ms of which 3 ms to minimize.
[2024-05-24 13:43:08] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 3 ms to minimize.
[2024-05-24 13:43:09] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-05-24 13:43:09] [INFO ] Deduced a trap composed of 47 places in 352 ms of which 4 ms to minimize.
[2024-05-24 13:43:09] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 2 ms to minimize.
[2024-05-24 13:43:09] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 2 ms to minimize.
[2024-05-24 13:43:10] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 3 ms to minimize.
[2024-05-24 13:43:10] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 4 ms to minimize.
[2024-05-24 13:43:10] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 2 ms to minimize.
[2024-05-24 13:43:10] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 2 ms to minimize.
[2024-05-24 13:43:11] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-05-24 13:43:11] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 2 ms to minimize.
[2024-05-24 13:43:11] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2024-05-24 13:43:11] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-24 13:43:11] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2024-05-24 13:43:11] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 13:43:11] [INFO ] Deduced a trap composed of 3 places in 56 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 5443 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 6205ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 809 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 172 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 173 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 105 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 13:43:13] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:43:13] [INFO ] Invariant cache hit.
[2024-05-24 13:43:14] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-05-24 13:43:14] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:43:14] [INFO ] Invariant cache hit.
[2024-05-24 13:43:15] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:43:19] [INFO ] Implicit Places using invariants and state equation in 4496 ms returned []
Implicit Place search using SMT with State Equation took 5556 ms to find 0 implicit places.
[2024-05-24 13:43:19] [INFO ] Redundant transitions in 101 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 13:43:19] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:43:19] [INFO ] Invariant cache hit.
[2024-05-24 13:43:19] [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 32266ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32296ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38075 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 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-05-24 13:43:51] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 13:43:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:43:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:43:51] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 13:43:51] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:43:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 13:43:51] [INFO ] After 31ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 13:43:51] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-24 13:43:51] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-24 13:43:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2024-05-24 13:43:51] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-24 13:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 1
[2024-05-24 13:43:52] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:43:52] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 447 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 277 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 84 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 90 reset in 321 ms.
Product exploration explored 100000 steps with 91 reset in 443 ms.
Built C files in :
/tmp/ltsmin6012504154732549958
[2024-05-24 13:43:53] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:43:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6012504154732549958
Running compilation step : cd /tmp/ltsmin6012504154732549958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6012504154732549958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6012504154732549958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 106 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 13:43:56] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 13:43:56] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 13:43:57] [INFO ] Implicit Places using invariants in 831 ms returned []
[2024-05-24 13:43:57] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:43:57] [INFO ] Invariant cache hit.
[2024-05-24 13:43:57] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 13:44:01] [INFO ] Implicit Places using invariants and state equation in 3917 ms returned []
Implicit Place search using SMT with State Equation took 4750 ms to find 0 implicit places.
[2024-05-24 13:44:01] [INFO ] Redundant transitions in 162 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 13:44:01] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 13:44:01] [INFO ] Invariant cache hit.
[2024-05-24 13:44:01] [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 32431ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32481ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37508 ms. Remains : 488/488 places, 2917/2917 transitions.
Built C files in :
/tmp/ltsmin14960343563753713936
[2024-05-24 13:44:33] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:44:33] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14960343563753713936
Running compilation step : cd /tmp/ltsmin14960343563753713936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14960343563753713936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14960343563753713936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 13:44:37] [INFO ] Flatten gal took : 94 ms
[2024-05-24 13:44:37] [INFO ] Flatten gal took : 124 ms
[2024-05-24 13:44:37] [INFO ] Time to serialize gal into /tmp/LTL13313461382148964177.gal : 17 ms
[2024-05-24 13:44:37] [INFO ] Time to serialize properties into /tmp/LTL1419854454961592139.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13313461382148964177.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6038758741265923913.hoa' '-atoms' '/tmp/LTL1419854454961592139.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1419854454961592139.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6038758741265923913.hoa
Detected timeout of ITS tools.
[2024-05-24 13:44:52] [INFO ] Flatten gal took : 74 ms
[2024-05-24 13:44:52] [INFO ] Flatten gal took : 79 ms
[2024-05-24 13:44:52] [INFO ] Time to serialize gal into /tmp/LTL14474630097619562132.gal : 15 ms
[2024-05-24 13:44:52] [INFO ] Time to serialize properties into /tmp/LTL8877208746474003872.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14474630097619562132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8877208746474003872.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_7_active==0)||(p09_3_7==0))")||(F((X("((flag_7_active==0)||(p09_3_7==0))"))||(G("((turn_6==0)||(p10_1_2==0))"))))))))
Formula 0 simplified : XF(!"((flag_7_active==0)||(p09_3_7==0))" & G(X!"((flag_7_active==0)||(p09_3_7==0))" & F!"((turn_6==0)||(p10_1_2==0))"))
Detected timeout of ITS tools.
[2024-05-24 13:45:07] [INFO ] Flatten gal took : 76 ms
[2024-05-24 13:45:07] [INFO ] Applying decomposition
[2024-05-24 13:45:07] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16103585244043036957.txt' '-o' '/tmp/graph16103585244043036957.bin' '-w' '/tmp/graph16103585244043036957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16103585244043036957.bin' '-l' '-1' '-v' '-w' '/tmp/graph16103585244043036957.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:45:07] [INFO ] Decomposing Gal with order
[2024-05-24 13:45:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:45:08] [INFO ] Removed a total of 6301 redundant transitions.
[2024-05-24 13:45:08] [INFO ] Flatten gal took : 358 ms
[2024-05-24 13:45:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 681 labels/synchronizations in 122 ms.
[2024-05-24 13:45:08] [INFO ] Time to serialize gal into /tmp/LTL5426092039159280558.gal : 20 ms
[2024-05-24 13:45:08] [INFO ] Time to serialize properties into /tmp/LTL18242553871879627276.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5426092039159280558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18242553871879627276.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i4.u7.flag_7_active==0)||(i7.u13.p09_3_7==0))")||(F((X("((i4.u7.flag_7_active==0)||(i7.u13.p09_3_7==0))"))||(G("((i17.u2.tu...191
Formula 0 simplified : XF(!"((i4.u7.flag_7_active==0)||(i7.u13.p09_3_7==0))" & G(X!"((i4.u7.flag_7_active==0)||(i7.u13.p09_3_7==0))" & F!"((i17.u2.turn_6==...179
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 313676 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 192 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-05-24 13:45:23] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 13:45:23] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 13:45:24] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-24 13:45:24] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:45:24] [INFO ] Invariant cache hit.
[2024-05-24 13:45:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:45:28] [INFO ] Implicit Places using invariants and state equation in 3585 ms returned []
Implicit Place search using SMT with State Equation took 4428 ms to find 0 implicit places.
[2024-05-24 13:45:28] [INFO ] Redundant transitions in 106 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 13:45:28] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:45:28] [INFO ] Invariant cache hit.
[2024-05-24 13:45:28] [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 32176ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32206ms
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 36944 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 267 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 357 ms.
Product exploration explored 100000 steps with 0 reset in 424 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 218 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 373 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 1405 ms. (28 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 67340 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :2 out of 13
Probabilistic random walk after 67340 steps, saw 48054 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :2
[2024-05-24 13:46:07] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:46:07] [INFO ] Invariant cache hit.
[2024-05-24 13:46:07] [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 1231 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-05-24 13:46:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-24 13:46:08] [INFO ] Deduced a trap composed of 3 places in 57 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-05-24 13:46:08] [INFO ] Deduced a trap composed of 3 places in 58 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-05-24 13:46:09] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 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-05-24 13:46:09] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-24 13:46:09] [INFO ] Deduced a trap composed of 3 places in 55 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 2696 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 3976ms problems are : Problem set: 7 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1819 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 95 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 96 ms. Remains : 488/488 places, 2909/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 1270 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 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 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 106730 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 4
Probabilistic random walk after 106730 steps, saw 73363 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-24 13:46:16] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:46:16] [INFO ] Invariant cache hit.
[2024-05-24 13:46:16] [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 1087 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-05-24 13:46:18] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 13:46:18] [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-05-24 13:46:18] [INFO ] Deduced a trap composed of 3 places in 56 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-05-24 13:46:18] [INFO ] Deduced a trap composed of 25 places in 77 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-05-24 13:46:19] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2024-05-24 13:46:19] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 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 3127 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 4240ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2545 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 167 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 168 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 164 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 13:46:23] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:46:23] [INFO ] Invariant cache hit.
[2024-05-24 13:46:24] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-24 13:46:24] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:46:24] [INFO ] Invariant cache hit.
[2024-05-24 13:46:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:46:30] [INFO ] Implicit Places using invariants and state equation in 5501 ms returned []
Implicit Place search using SMT with State Equation took 6589 ms to find 0 implicit places.
[2024-05-24 13:46:30] [INFO ] Redundant transitions in 163 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 13:46:30] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:46:30] [INFO ] Invariant cache hit.
[2024-05-24 13:46:30] [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 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 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 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 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 1.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 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 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, 2900 unsolved
SMT process timed out in 32370ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32415ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39344 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 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 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 0 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-05-24 13:47:03] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 13:47:03] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:47:03] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 13:47:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 13:47:03] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 13:47:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 13:47:03] [INFO ] After 65ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 13:47:03] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 13:47:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-24 13:47:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-24 13:47:03] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 13:47:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
TRAPS : Iteration 1
[2024-05-24 13:47:03] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 13:47:03] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 727 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 25 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 100107 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 3 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 187 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 13:47:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:47:03] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 13:47:05] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-24 13:47:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:47:05] [INFO ] Invariant cache hit.
[2024-05-24 13:47:05] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:47:09] [INFO ] Implicit Places using invariants and state equation in 4015 ms returned []
Implicit Place search using SMT with State Equation took 5102 ms to find 0 implicit places.
[2024-05-24 13:47:09] [INFO ] Redundant transitions in 107 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:47:09] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:47:09] [INFO ] Invariant cache hit.
[2024-05-24 13:47:09] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 32056ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32085ms
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 37489 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-09
Product exploration explored 100000 steps with 0 reset in 491 ms.
Product exploration explored 100000 steps with 0 reset in 453 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 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 316410 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 316410 steps, saw 199274 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-05-24 13:47:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:47:45] [INFO ] Invariant cache hit.
[2024-05-24 13:47:45] [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 721 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-05-24 13:47:46] [INFO ] Deduced a trap composed of 3 places in 63 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-05-24 13:47:46] [INFO ] Deduced a trap composed of 3 places in 72 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-05-24 13:47:47] [INFO ] Deduced a trap composed of 43 places in 621 ms of which 7 ms to minimize.
[2024-05-24 13:47:47] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 5 ms to minimize.
[2024-05-24 13:47:48] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 4 ms to minimize.
[2024-05-24 13:47:48] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 4 ms to minimize.
[2024-05-24 13:47:48] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 4 ms to minimize.
[2024-05-24 13:47:49] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 3 ms to minimize.
[2024-05-24 13:47:49] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 13:47:49] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 13:47:49] [INFO ] Deduced a trap composed of 19 places in 191 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 3873 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 4615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 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 167 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 167 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332160 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332160 steps, saw 208133 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-24 13:47:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:47:53] [INFO ] Invariant cache hit.
[2024-05-24 13:47:53] [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 680 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-05-24 13:47:54] [INFO ] Deduced a trap composed of 3 places in 93 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-05-24 13:47:54] [INFO ] Deduced a trap composed of 3 places in 98 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-05-24 13:47:55] [INFO ] Deduced a trap composed of 43 places in 607 ms of which 5 ms to minimize.
[2024-05-24 13:47:55] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 3 ms to minimize.
[2024-05-24 13:47:56] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
[2024-05-24 13:47:56] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 3 ms to minimize.
[2024-05-24 13:47:56] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 3 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 22 places in 299 ms of which 3 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 3 places in 261 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-05-24 13:47:57] [INFO ] Deduced a trap composed of 3 places in 71 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-05-24 13:47:57] [INFO ] Deduced a trap composed of 19 places in 177 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 4081 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 4780ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 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 164 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 164 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 165 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:47:58] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:47:58] [INFO ] Invariant cache hit.
[2024-05-24 13:47:59] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-24 13:47:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:47:59] [INFO ] Invariant cache hit.
[2024-05-24 13:48:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:48:03] [INFO ] Implicit Places using invariants and state equation in 3719 ms returned []
Implicit Place search using SMT with State Equation took 4662 ms to find 0 implicit places.
[2024-05-24 13:48:03] [INFO ] Redundant transitions in 159 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:48:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:48:03] [INFO ] Invariant cache hit.
[2024-05-24 13:48:03] [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 32315ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37361 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 24 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-05-24 13:48:35] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 13:48:35] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:48:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 13:48:35] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:48:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 13:48:35] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 13:48:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 13:48:36] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 13:48:36] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 13:48:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 87 ms
TRAPS : Iteration 1
[2024-05-24 13:48:36] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:48:36] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 307 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 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 102 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:48:36] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:48:36] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 13:48:37] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-24 13:48:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:48:37] [INFO ] Invariant cache hit.
[2024-05-24 13:48:37] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:48:40] [INFO ] Implicit Places using invariants and state equation in 3429 ms returned []
Implicit Place search using SMT with State Equation took 4251 ms to find 0 implicit places.
[2024-05-24 13:48:40] [INFO ] Redundant transitions in 95 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:48:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:48:40] [INFO ] Invariant cache hit.
[2024-05-24 13:48: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 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)timeout
(s19 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 32432ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36917 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 79 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 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 366940 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 366940 steps, saw 227772 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-24 13:49:16] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:49:16] [INFO ] Invariant cache hit.
[2024-05-24 13:49:16] [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 539 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-05-24 13:49:17] [INFO ] Deduced a trap composed of 3 places in 53 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-05-24 13:49:17] [INFO ] Deduced a trap composed of 3 places in 59 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-05-24 13:49:18] [INFO ] Deduced a trap composed of 43 places in 464 ms of which 4 ms to minimize.
[2024-05-24 13:49:18] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 3 ms to minimize.
[2024-05-24 13:49:18] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-05-24 13:49:18] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 2 ms to minimize.
[2024-05-24 13:49:19] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 3 ms to minimize.
[2024-05-24 13:49:19] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 2 ms to minimize.
[2024-05-24 13:49:19] [INFO ] Deduced a trap composed of 3 places in 185 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-05-24 13:49:19] [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-05-24 13:49:19] [INFO ] Deduced a trap composed of 19 places in 138 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 3162 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 3724ms 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 97 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 98 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 358450 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 358450 steps, saw 223157 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2024-05-24 13:49:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:49:23] [INFO ] Invariant cache hit.
[2024-05-24 13:49:23] [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 534 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-05-24 13:49:24] [INFO ] Deduced a trap composed of 3 places in 49 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-05-24 13:49:24] [INFO ] Deduced a trap composed of 3 places in 59 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-05-24 13:49:24] [INFO ] Deduced a trap composed of 43 places in 468 ms of which 5 ms to minimize.
[2024-05-24 13:49:25] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 3 ms to minimize.
[2024-05-24 13:49:25] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
[2024-05-24 13:49:25] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 2 ms to minimize.
[2024-05-24 13:49:26] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 2 ms to minimize.
[2024-05-24 13:49:26] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 2 ms to minimize.
[2024-05-24 13:49:26] [INFO ] Deduced a trap composed of 3 places in 187 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-05-24 13:49:26] [INFO ] Deduced a trap composed of 3 places in 61 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-05-24 13:49:26] [INFO ] Deduced a trap composed of 19 places in 140 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 3168 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 3721ms 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 103 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 103 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 99 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:49:27] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:49:27] [INFO ] Invariant cache hit.
[2024-05-24 13:49:28] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-05-24 13:49:28] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:49:28] [INFO ] Invariant cache hit.
[2024-05-24 13:49:28] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:49:31] [INFO ] Implicit Places using invariants and state equation in 3373 ms returned []
Implicit Place search using SMT with State Equation took 4215 ms to find 0 implicit places.
[2024-05-24 13:49:31] [INFO ] Redundant transitions in 99 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:49:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:49:31] [INFO ] Invariant cache hit.
[2024-05-24 13:49:31] [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 32467ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32496ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36918 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 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 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 30 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-05-24 13:50:04] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 13:50:04] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:50:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 13:50:04] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:50:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 13:50:04] [INFO ] After 16ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 13:50:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 13:50:04] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 13:50:04] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 13:50:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 82 ms
TRAPS : Iteration 1
[2024-05-24 13:50:04] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:50:04] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 315 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 318 ms.
Product exploration explored 100000 steps with 0 reset in 385 ms.
Built C files in :
/tmp/ltsmin1838623193676783573
[2024-05-24 13:50:05] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:50:05] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1838623193676783573
Running compilation step : cd /tmp/ltsmin1838623193676783573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1838623193676783573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1838623193676783573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:50:08] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:50:08] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 13:50:09] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-05-24 13:50:09] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:50:09] [INFO ] Invariant cache hit.
[2024-05-24 13:50:09] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:50:12] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4280 ms to find 0 implicit places.
[2024-05-24 13:50:12] [INFO ] Redundant transitions in 95 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:50:13] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:50:13] [INFO ] Invariant cache hit.
[2024-05-24 13:50:13] [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 32210ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36730 ms. Remains : 486/486 places, 2907/2907 transitions.
Built C files in :
/tmp/ltsmin16437253536345185161
[2024-05-24 13:50:45] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:50:45] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16437253536345185161
Running compilation step : cd /tmp/ltsmin16437253536345185161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16437253536345185161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16437253536345185161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 13:50:48] [INFO ] Flatten gal took : 75 ms
[2024-05-24 13:50:48] [INFO ] Flatten gal took : 82 ms
[2024-05-24 13:50:48] [INFO ] Time to serialize gal into /tmp/LTL15972237021002851602.gal : 12 ms
[2024-05-24 13:50:48] [INFO ] Time to serialize properties into /tmp/LTL7259477809061842331.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15972237021002851602.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15272183616680398073.hoa' '-atoms' '/tmp/LTL7259477809061842331.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7259477809061842331.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15272183616680398073.hoa
Detected timeout of ITS tools.
[2024-05-24 13:51:03] [INFO ] Flatten gal took : 81 ms
[2024-05-24 13:51:03] [INFO ] Flatten gal took : 86 ms
[2024-05-24 13:51:03] [INFO ] Time to serialize gal into /tmp/LTL14818472023353755706.gal : 12 ms
[2024-05-24 13:51:03] [INFO ] Time to serialize properties into /tmp/LTL3745798938498503877.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14818472023353755706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3745798938498503877.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((turn_7==0)||(flag_7_idle==0))||(p25_0_8==0))&&(((turn_1!=1)||(flag_1_idle!=1))||(p25_5_3!=1)))"))))
Formula 0 simplified : GF!"((((turn_7==0)||(flag_7_idle==0))||(p25_0_8==0))&&(((turn_1!=1)||(flag_1_idle!=1))||(p25_5_3!=1)))"
Detected timeout of ITS tools.
[2024-05-24 13:51:18] [INFO ] Flatten gal took : 76 ms
[2024-05-24 13:51:18] [INFO ] Applying decomposition
[2024-05-24 13:51:18] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1063351351885807415.txt' '-o' '/tmp/graph1063351351885807415.bin' '-w' '/tmp/graph1063351351885807415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1063351351885807415.bin' '-l' '-1' '-v' '-w' '/tmp/graph1063351351885807415.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:51:19] [INFO ] Decomposing Gal with order
[2024-05-24 13:51:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:51:19] [INFO ] Removed a total of 6325 redundant transitions.
[2024-05-24 13:51:19] [INFO ] Flatten gal took : 217 ms
[2024-05-24 13:51:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 618 labels/synchronizations in 62 ms.
[2024-05-24 13:51:19] [INFO ] Time to serialize gal into /tmp/LTL17474286472990560984.gal : 14 ms
[2024-05-24 13:51:19] [INFO ] Time to serialize properties into /tmp/LTL13426665995500050167.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17474286472990560984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13426665995500050167.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i4.u5.turn_7==0)||(i17.u49.flag_7_idle==0))||(i15.u0.p25_0_8==0))&&(((i15.u0.turn_1!=1)||(i2.u26.flag_1_idle!=1))||(i4.u5....173
Formula 0 simplified : GF!"((((i4.u5.turn_7==0)||(i17.u49.flag_7_idle==0))||(i15.u0.p25_0_8==0))&&(((i15.u0.turn_1!=1)||(i2.u26.flag_1_idle!=1))||(i4.u5.p2...167
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-09 finished in 270770 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 2 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 3 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-05-24 13:51:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:51:34] [INFO ] Invariant cache hit.
[2024-05-24 13:51:35] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-24 13:51:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:51:35] [INFO ] Invariant cache hit.
[2024-05-24 13:51:35] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:51:39] [INFO ] Implicit Places using invariants and state equation in 3486 ms returned []
Implicit Place search using SMT with State Equation took 4287 ms to find 0 implicit places.
[2024-05-24 13:51:39] [INFO ] Redundant transitions in 98 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:51:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:51:39] [INFO ] Invariant cache hit.
[2024-05-24 13:51:39] [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 32072ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32102ms
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 36695 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-10
Product exploration explored 100000 steps with 0 reset in 293 ms.
Product exploration explored 100000 steps with 0 reset in 366 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 96 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 153 ms. (259 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 365670 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 365670 steps, saw 227150 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-24 13:52:15] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:52:15] [INFO ] Invariant cache hit.
[2024-05-24 13:52:15] [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-05-24 13:52:15] [INFO ] Deduced a trap composed of 3 places in 74 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 643 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-05-24 13:52:16] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 5 ms to minimize.
[2024-05-24 13:52:17] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 5 ms to minimize.
[2024-05-24 13:52:17] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 5 ms to minimize.
[2024-05-24 13:52:17] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 4 ms to minimize.
[2024-05-24 13:52:18] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 2 ms to minimize.
[2024-05-24 13:52:18] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 5 ms to minimize.
[2024-05-24 13:52:19] [INFO ] Deduced a trap composed of 3 places in 387 ms of which 5 ms to minimize.
[2024-05-24 13:52:19] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 4 ms to minimize.
[2024-05-24 13:52:19] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 3 ms to minimize.
[2024-05-24 13:52:20] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 3 ms to minimize.
[2024-05-24 13:52:20] [INFO ] Deduced a trap composed of 42 places in 434 ms of which 4 ms to minimize.
[2024-05-24 13:52:21] [INFO ] Deduced a trap composed of 35 places in 393 ms of which 3 ms to minimize.
SMT process timed out in 5917ms, 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 167 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 167 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 369740 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 369740 steps, saw 229419 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-24 13:52:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:52:24] [INFO ] Invariant cache hit.
[2024-05-24 13:52:24] [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-05-24 13:52:24] [INFO ] Deduced a trap composed of 3 places in 64 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 847 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-05-24 13:52:25] [INFO ] Deduced a trap composed of 3 places in 446 ms of which 5 ms to minimize.
[2024-05-24 13:52:26] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 3 ms to minimize.
[2024-05-24 13:52:26] [INFO ] Deduced a trap composed of 37 places in 395 ms of which 3 ms to minimize.
[2024-05-24 13:52:27] [INFO ] Deduced a trap composed of 12 places in 440 ms of which 4 ms to minimize.
[2024-05-24 13:52:27] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 3 ms to minimize.
[2024-05-24 13:52:27] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 5 ms to minimize.
[2024-05-24 13:52:28] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 3 ms to minimize.
[2024-05-24 13:52:28] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 4 ms to minimize.
[2024-05-24 13:52:29] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 3 ms to minimize.
[2024-05-24 13:52:29] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-05-24 13:52:29] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 5 ms to minimize.
[2024-05-24 13:52:30] [INFO ] Deduced a trap composed of 35 places in 307 ms of which 3 ms to minimize.
[2024-05-24 13:52:30] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-05-24 13:52:30] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 4 ms to minimize.
[2024-05-24 13:52:30] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-05-24 13:52:31] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 4 ms to minimize.
[2024-05-24 13:52:31] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 3 ms to minimize.
[2024-05-24 13:52:31] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-24 13:52:31] [INFO ] Deduced a trap composed of 54 places in 133 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-05-24 13:52:32] [INFO ] Deduced a trap composed of 37 places in 238 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 7391 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 8259ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 156 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 99 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 100 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 98 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:52:32] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:52:32] [INFO ] Invariant cache hit.
[2024-05-24 13:52:34] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2024-05-24 13:52:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:52:34] [INFO ] Invariant cache hit.
[2024-05-24 13:52:34] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:52:37] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 4583 ms to find 0 implicit places.
[2024-05-24 13:52:37] [INFO ] Redundant transitions in 95 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:52:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:52:37] [INFO ] Invariant cache hit.
[2024-05-24 13:52:37] [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 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 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 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 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 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 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.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 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 32112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36900 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 27 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-05-24 13:53:09] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 13:53:09] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 13:53:09] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:53:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 13:53:10] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:53:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:53:10] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 13:53:10] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:53:10] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 305 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 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 102 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:53:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:53:10] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 13:53:11] [INFO ] Implicit Places using invariants in 964 ms returned []
[2024-05-24 13:53:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:53:11] [INFO ] Invariant cache hit.
[2024-05-24 13:53:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:53:14] [INFO ] Implicit Places using invariants and state equation in 3520 ms returned []
Implicit Place search using SMT with State Equation took 4487 ms to find 0 implicit places.
[2024-05-24 13:53:14] [INFO ] Redundant transitions in 95 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:53:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:53:14] [INFO ] Invariant cache hit.
[2024-05-24 13:53:15] [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 32161ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36884 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 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 363880 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 363880 steps, saw 226067 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-24 13:53:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:53:50] [INFO ] Invariant cache hit.
[2024-05-24 13:53:50] [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-05-24 13:53:50] [INFO ] Deduced a trap composed of 3 places in 73 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 626 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-05-24 13:53:51] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 3 ms to minimize.
[2024-05-24 13:53:51] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 4 ms to minimize.
[2024-05-24 13:53:52] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 4 ms to minimize.
[2024-05-24 13:53:52] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 3 ms to minimize.
[2024-05-24 13:53:53] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 3 ms to minimize.
[2024-05-24 13:53:53] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 4 ms to minimize.
[2024-05-24 13:53:53] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 3 ms to minimize.
[2024-05-24 13:53:53] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 3 ms to minimize.
[2024-05-24 13:53:54] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 3 ms to minimize.
[2024-05-24 13:53:54] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 3 ms to minimize.
[2024-05-24 13:53:54] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 3 ms to minimize.
[2024-05-24 13:53:55] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 4 ms to minimize.
[2024-05-24 13:53:55] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 3 ms to minimize.
[2024-05-24 13:53:55] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2024-05-24 13:53:56] [INFO ] Deduced a trap composed of 24 places in 378 ms of which 5 ms to minimize.
SMT process timed out in 5756ms, 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 99 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 99 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 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 372530 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 372530 steps, saw 230991 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-24 13:53:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:53:59] [INFO ] Invariant cache hit.
[2024-05-24 13:53:59] [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-05-24 13:53:59] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 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 799 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-05-24 13:54:00] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 3 ms to minimize.
[2024-05-24 13:54:01] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 3 ms to minimize.
[2024-05-24 13:54:01] [INFO ] Deduced a trap composed of 37 places in 305 ms of which 4 ms to minimize.
[2024-05-24 13:54:01] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 3 ms to minimize.
[2024-05-24 13:54:02] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 3 ms to minimize.
[2024-05-24 13:54:02] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 3 ms to minimize.
[2024-05-24 13:54:02] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 2 ms to minimize.
[2024-05-24 13:54:03] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 3 ms to minimize.
[2024-05-24 13:54:03] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 3 ms to minimize.
[2024-05-24 13:54:03] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 3 ms to minimize.
[2024-05-24 13:54:04] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-05-24 13:54:04] [INFO ] Deduced a trap composed of 35 places in 285 ms of which 3 ms to minimize.
[2024-05-24 13:54:04] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2024-05-24 13:54:04] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 2 ms to minimize.
[2024-05-24 13:54:05] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 6 ms to minimize.
[2024-05-24 13:54:05] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 4 ms to minimize.
[2024-05-24 13:54:05] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-05-24 13:54:05] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-24 13:54:05] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 1 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-05-24 13:54:06] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 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 6702 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 7519ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 150 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 99 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 99 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 107 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:54:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:54:07] [INFO ] Invariant cache hit.
[2024-05-24 13:54:08] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-05-24 13:54:08] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:54:08] [INFO ] Invariant cache hit.
[2024-05-24 13:54:08] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:54:11] [INFO ] Implicit Places using invariants and state equation in 3774 ms returned []
Implicit Place search using SMT with State Equation took 4619 ms to find 0 implicit places.
[2024-05-24 13:54:11] [INFO ] Redundant transitions in 100 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:54:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:54:11] [INFO ] Invariant cache hit.
[2024-05-24 13:54:11] [INFO ] State equation strengthened by 356 read => feed constraints.
(s132 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 0.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 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 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.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 32067ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32098ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36931 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 1 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 29 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-05-24 13:54:44] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 13:54:44] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 13:54:44] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:54:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:54:44] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:54:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:54:44] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 13:54:44] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:54:44] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 539 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 462 ms.
Product exploration explored 100000 steps with 0 reset in 439 ms.
Built C files in :
/tmp/ltsmin12588479434647901565
[2024-05-24 13:54:45] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:54:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12588479434647901565
Running compilation step : cd /tmp/ltsmin12588479434647901565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12588479434647901565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12588479434647901565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 101 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:54:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:54:48] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 13:54:49] [INFO ] Implicit Places using invariants in 804 ms returned []
[2024-05-24 13:54:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:54:49] [INFO ] Invariant cache hit.
[2024-05-24 13:54:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:54:53] [INFO ] Implicit Places using invariants and state equation in 3640 ms returned []
Implicit Place search using SMT with State Equation took 4446 ms to find 0 implicit places.
[2024-05-24 13:54:53] [INFO ] Redundant transitions in 96 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:54:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:54:53] [INFO ] Invariant cache hit.
[2024-05-24 13:54:53] [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 32073ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36762 ms. Remains : 486/486 places, 2907/2907 transitions.
Built C files in :
/tmp/ltsmin9635393669563408052
[2024-05-24 13:55:25] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:55:25] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9635393669563408052
Running compilation step : cd /tmp/ltsmin9635393669563408052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9635393669563408052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9635393669563408052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 13:55:28] [INFO ] Flatten gal took : 71 ms
[2024-05-24 13:55:28] [INFO ] Flatten gal took : 76 ms
[2024-05-24 13:55:28] [INFO ] Time to serialize gal into /tmp/LTL10502475446915427396.gal : 15 ms
[2024-05-24 13:55:28] [INFO ] Time to serialize properties into /tmp/LTL1480846607659500414.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10502475446915427396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12682339147116664987.hoa' '-atoms' '/tmp/LTL1480846607659500414.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1480846607659500414.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12682339147116664987.hoa
Detected timeout of ITS tools.
[2024-05-24 13:55:43] [INFO ] Flatten gal took : 74 ms
[2024-05-24 13:55:44] [INFO ] Flatten gal took : 77 ms
[2024-05-24 13:55:44] [INFO ] Time to serialize gal into /tmp/LTL6596112462511481923.gal : 11 ms
[2024-05-24 13:55:44] [INFO ] Time to serialize properties into /tmp/LTL3142813347791581951.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6596112462511481923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3142813347791581951.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((turn_1!=1)||(flag_1_waiting!=1))||(p25_4_7!=1))"))))
Formula 0 simplified : GF!"(((turn_1!=1)||(flag_1_waiting!=1))||(p25_4_7!=1))"
Detected timeout of ITS tools.
[2024-05-24 13:55:59] [INFO ] Flatten gal took : 76 ms
[2024-05-24 13:55:59] [INFO ] Applying decomposition
[2024-05-24 13:55:59] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1719600609446261330.txt' '-o' '/tmp/graph1719600609446261330.bin' '-w' '/tmp/graph1719600609446261330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1719600609446261330.bin' '-l' '-1' '-v' '-w' '/tmp/graph1719600609446261330.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:55:59] [INFO ] Decomposing Gal with order
[2024-05-24 13:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:55:59] [INFO ] Removed a total of 6307 redundant transitions.
[2024-05-24 13:55:59] [INFO ] Flatten gal took : 206 ms
[2024-05-24 13:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 618 labels/synchronizations in 62 ms.
[2024-05-24 13:55:59] [INFO ] Time to serialize gal into /tmp/LTL1527976762437671493.gal : 18 ms
[2024-05-24 13:55:59] [INFO ] Time to serialize properties into /tmp/LTL6253018826672693619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1527976762437671493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6253018826672693619.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i3.u5.turn_1!=1)||(i1.u3.flag_1_waiting!=1))||(i2.u4.p25_4_7!=1))"))))
Formula 0 simplified : GF!"(((i3.u5.turn_1!=1)||(i1.u3.flag_1_waiting!=1))||(i2.u4.p25_4_7!=1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-10 finished in 280275 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 39 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 13:56:14] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-05-24 13:56:14] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 13:56:15] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-24 13:56:15] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:56:15] [INFO ] Invariant cache hit.
[2024-05-24 13:56:16] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:56:22] [INFO ] Implicit Places using invariants and state equation in 6561 ms returned []
Implicit Place search using SMT with State Equation took 7523 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 13:56:22] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:56:22] [INFO ] Invariant cache hit.
[2024-05-24 13:56:22] [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 32275ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32308ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39873 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 261 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 324 ms.
Product exploration explored 100000 steps with 0 reset in 369 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 198 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 212 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 350 ms. (113 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 7/7 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 363 ms. (109 steps per ms) remains 7/7 properties
[2024-05-24 13:56:57] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 13:56:57] [INFO ] Invariant cache hit.
[2024-05-24 13:56:57] [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-05-24 13:56:57] [INFO ] Deduced a trap composed of 3 places in 61 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 1853 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-05-24 13:56:59] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 3 ms to minimize.
[2024-05-24 13:56:59] [INFO ] Deduced a trap composed of 29 places in 168 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-05-24 13:57:01] [INFO ] Deduced a trap composed of 147 places in 882 ms of which 7 ms to minimize.
[2024-05-24 13:57:02] [INFO ] Deduced a trap composed of 165 places in 761 ms of which 7 ms to minimize.
[2024-05-24 13:57:02] [INFO ] Deduced a trap composed of 141 places in 769 ms of which 8 ms to minimize.
[2024-05-24 13:57:03] [INFO ] Deduced a trap composed of 110 places in 717 ms of which 8 ms to minimize.
[2024-05-24 13:57:04] [INFO ] Deduced a trap composed of 116 places in 944 ms of which 8 ms to minimize.
SMT process timed out in 7625ms, 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 4 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 272 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 273 ms. Remains : 488/819 places, 2909/3240 transitions.
RANDOM walk for 40000 steps (8 resets) in 1804 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 103940 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 103940 steps, saw 72168 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-24 13:57:08] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 13:57:08] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 13:57:08] [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 1141 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-05-24 13:57:10] [INFO ] Deduced a trap composed of 21 places in 104 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-05-24 13:57:11] [INFO ] Deduced a trap composed of 105 places in 662 ms of which 5 ms to minimize.
[2024-05-24 13:57:12] [INFO ] Deduced a trap composed of 94 places in 682 ms of which 5 ms to minimize.
[2024-05-24 13:57:13] [INFO ] Deduced a trap composed of 92 places in 508 ms of which 5 ms to minimize.
[2024-05-24 13:57:13] [INFO ] Deduced a trap composed of 97 places in 460 ms of which 5 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-05-24 13:57:14] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2024-05-24 13:57:14] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2024-05-24 13:57:14] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-24 13:57:14] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 13:57:14] [INFO ] Deduced a trap composed of 23 places in 78 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 5322 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 6496ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 835 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 100 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 100 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 99 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 13:57:16] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:57:16] [INFO ] Invariant cache hit.
[2024-05-24 13:57:17] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-24 13:57:17] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:57:17] [INFO ] Invariant cache hit.
[2024-05-24 13:57:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:57:21] [INFO ] Implicit Places using invariants and state equation in 4304 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
[2024-05-24 13:57:21] [INFO ] Redundant transitions in 94 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 13:57:21] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:57:21] [INFO ] Invariant cache hit.
[2024-05-24 13:57:21] [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 32127ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37482 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 29 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-05-24 13:57:53] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 13:57:53] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 13:57:53] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 13:57:53] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 13:57:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:57:53] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 13:57:54] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 13:57:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 13:57:54] [INFO ] After 35ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 13:57:54] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 13:57:54] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 393 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 550 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 55 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 66 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 4 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 279 ms. Remains 488 /819 variables (removed 331) and now considering 2909/3240 (removed 331) transitions.
[2024-05-24 13:57:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 13:57:55] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 13:57:56] [INFO ] Implicit Places using invariants in 980 ms returned []
[2024-05-24 13:57:56] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:57:56] [INFO ] Invariant cache hit.
[2024-05-24 13:57:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:58:00] [INFO ] Implicit Places using invariants and state equation in 4363 ms returned []
Implicit Place search using SMT with State Equation took 5348 ms to find 0 implicit places.
[2024-05-24 13:58:00] [INFO ] Redundant transitions in 116 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 13:58:00] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:58:00] [INFO ] Invariant cache hit.
[2024-05-24 13:58:00] [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 32287ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32318ms
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 38069 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 108 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)]
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 322640 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 322640 steps, saw 204986 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-24 13:58:36] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 13:58:36] [INFO ] Invariant cache hit.
[2024-05-24 13:58:36] [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 545 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-05-24 13:58:36] [INFO ] Deduced a trap composed of 3 places in 54 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 896 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 1459ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 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 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 105 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 105 ms. Remains : 487/488 places, 2908/2909 transitions.
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 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 336080 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 336080 steps, saw 212320 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-24 13:58:41] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 13:58:41] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 13:58:41] [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 768 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-05-24 13:58:41] [INFO ] Deduced a trap composed of 3 places in 70 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-05-24 13:58:43] [INFO ] Deduced a trap composed of 3 places in 484 ms of which 5 ms to minimize.
[2024-05-24 13:58:43] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 3 ms to minimize.
[2024-05-24 13:58:43] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 3 ms to minimize.
[2024-05-24 13:58:43] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 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 2357 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 3148ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 127 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 171 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 171 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 162 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 13:58:44] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:58:44] [INFO ] Invariant cache hit.
[2024-05-24 13:58:45] [INFO ] Implicit Places using invariants in 1285 ms returned []
[2024-05-24 13:58:45] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:58:45] [INFO ] Invariant cache hit.
[2024-05-24 13:58:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:58:50] [INFO ] Implicit Places using invariants and state equation in 4857 ms returned []
Implicit Place search using SMT with State Equation took 6150 ms to find 0 implicit places.
[2024-05-24 13:58:50] [INFO ] Redundant transitions in 152 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:58:50] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:58:50] [INFO ] Invariant cache hit.
[2024-05-24 13:58:50] [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 32178ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38698 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 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 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 42 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-05-24 13:59:23] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 13:59:23] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:59:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 13:59:23] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:59:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:59:23] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 13:59:23] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:59:23] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 455 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Built C files in :
/tmp/ltsmin5887395284710895791
[2024-05-24 13:59:24] [INFO ] Too many transitions (2909) to apply POR reductions. Disabling POR matrices.
[2024-05-24 13:59:24] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5887395284710895791
Running compilation step : cd /tmp/ltsmin5887395284710895791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5887395284710895791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5887395284710895791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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-05-24 13:59:27] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 13:59:27] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 13:59:28] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-24 13:59:28] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:59:28] [INFO ] Invariant cache hit.
[2024-05-24 13:59:29] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:59:33] [INFO ] Implicit Places using invariants and state equation in 4345 ms returned []
Implicit Place search using SMT with State Equation took 5313 ms to find 0 implicit places.
[2024-05-24 13:59:33] [INFO ] Redundant transitions in 98 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 13:59:33] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:59:33] [INFO ] Invariant cache hit.
[2024-05-24 13:59:33] [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 32295ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32325ms
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 37863 ms. Remains : 487/488 places, 2908/2909 transitions.
Built C files in :
/tmp/ltsmin16667795856959524582
[2024-05-24 14:00:05] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2024-05-24 14:00:05] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16667795856959524582
Running compilation step : cd /tmp/ltsmin16667795856959524582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16667795856959524582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16667795856959524582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 14:00:08] [INFO ] Flatten gal took : 78 ms
[2024-05-24 14:00:08] [INFO ] Flatten gal took : 78 ms
[2024-05-24 14:00:08] [INFO ] Time to serialize gal into /tmp/LTL1649562882629383365.gal : 12 ms
[2024-05-24 14:00:08] [INFO ] Time to serialize properties into /tmp/LTL4574849772806934834.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1649562882629383365.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14075086950233983604.hoa' '-atoms' '/tmp/LTL4574849772806934834.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4574849772806934834.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14075086950233983604.hoa
Detected timeout of ITS tools.
[2024-05-24 14:00:24] [INFO ] Flatten gal took : 75 ms
[2024-05-24 14:00:24] [INFO ] Flatten gal took : 79 ms
[2024-05-24 14:00:24] [INFO ] Time to serialize gal into /tmp/LTL12730367011658063365.gal : 15 ms
[2024-05-24 14:00:24] [INFO ] Time to serialize properties into /tmp/LTL8090633207032519768.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12730367011658063365.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8090633207032519768.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_2_active==0)||(p33_4_2==0))")||((!("((flag_2_active==1)&&(p33_4_2==1))"))U((G(!("((flag_2_active==1)&&(p33_4_2==1))"))...253
Formula 0 simplified : XF(!"((flag_2_active==0)||(p33_4_2==0))" & (F"((flag_3_active==1)&&(p09_4_3==1))" U "((flag_2_active==1)&&(p33_4_2==1))"))
Detected timeout of ITS tools.
[2024-05-24 14:00:39] [INFO ] Flatten gal took : 76 ms
[2024-05-24 14:00:39] [INFO ] Applying decomposition
[2024-05-24 14:00:39] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8019001903224083954.txt' '-o' '/tmp/graph8019001903224083954.bin' '-w' '/tmp/graph8019001903224083954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8019001903224083954.bin' '-l' '-1' '-v' '-w' '/tmp/graph8019001903224083954.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:00:39] [INFO ] Decomposing Gal with order
[2024-05-24 14:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:00:39] [INFO ] Removed a total of 6118 redundant transitions.
[2024-05-24 14:00:39] [INFO ] Flatten gal took : 299 ms
[2024-05-24 14:00:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 567 labels/synchronizations in 94 ms.
[2024-05-24 14:00:40] [INFO ] Time to serialize gal into /tmp/LTL5789226299623960871.gal : 20 ms
[2024-05-24 14:00:40] [INFO ] Time to serialize properties into /tmp/LTL2248783858052093457.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5789226299623960871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2248783858052093457.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i13.u1.flag_2_active==0)||(i13.u33.p33_4_2==0))")||((!("((i13.u1.flag_2_active==1)&&(i13.u33.p33_4_2==1))"))U((G(!("((i13.u...326
Formula 0 simplified : XF(!"((i13.u1.flag_2_active==0)||(i13.u33.p33_4_2==0))" & (F"((i1.u3.flag_3_active==1)&&(i6.u16.p09_4_3==1))" U "((i13.u1.flag_2_act...188
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 280201 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 41 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 14:00:55] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 14:00:55] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 14:00:56] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-05-24 14:00:56] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:00:56] [INFO ] Invariant cache hit.
[2024-05-24 14:00:56] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:01:05] [INFO ] Implicit Places using invariants and state equation in 9065 ms returned []
Implicit Place search using SMT with State Equation took 10066 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 14:01:05] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:01:05] [INFO ] Invariant cache hit.
[2024-05-24 14:01:05] [INFO ] State equation strengthened by 364 read => feed constraints.
(s350 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.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.0timeout
) 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 32379ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32412ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42522 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 218 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 810 ms.
Product exploration explored 100000 steps with 25000 reset in 799 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 111 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 181 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 1261 ms. (31 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
[2024-05-24 14:01:40] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:01:40] [INFO ] Invariant cache hit.
[2024-05-24 14:01:40] [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 1536 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-05-24 14:01:42] [INFO ] Deduced a trap composed of 3 places in 112 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-05-24 14:01:43] [INFO ] Deduced a trap composed of 3 places in 118 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-05-24 14:01:44] [INFO ] Deduced a trap composed of 3 places in 233 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 2992 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 4559ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 721 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 1543 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 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
Interrupted probabilistic random walk after 146350 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 146350 steps, saw 98665 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-24 14:01:49] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 14:01:49] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:01:49] [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 760 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-05-24 14:01:50] [INFO ] Deduced a trap composed of 3 places in 68 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-05-24 14:01:51] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 3 ms to minimize.
[2024-05-24 14:01:51] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 4 ms to minimize.
[2024-05-24 14:01:52] [INFO ] Deduced a trap composed of 3 places in 524 ms of which 5 ms to minimize.
[2024-05-24 14:01:52] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 3 ms to minimize.
[2024-05-24 14:01:53] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 3 ms to minimize.
[2024-05-24 14:01:53] [INFO ] Deduced a trap composed of 3 places in 455 ms of which 5 ms to minimize.
[2024-05-24 14:01:53] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 3 ms to minimize.
[2024-05-24 14:01:54] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 4 ms to minimize.
[2024-05-24 14:01:54] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 3 ms to minimize.
[2024-05-24 14:01:55] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 2 ms to minimize.
[2024-05-24 14:01:55] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 2 ms to minimize.
[2024-05-24 14:01:55] [INFO ] Deduced a trap composed of 3 places in 60 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 6008 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 6792ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 713 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 106 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 99 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 14:01:57] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:01:57] [INFO ] Invariant cache hit.
[2024-05-24 14:01:58] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2024-05-24 14:01:58] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:01:58] [INFO ] Invariant cache hit.
[2024-05-24 14:01:58] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:02:02] [INFO ] Implicit Places using invariants and state equation in 3816 ms returned []
Implicit Place search using SMT with State Equation took 4934 ms to find 0 implicit places.
[2024-05-24 14:02:02] [INFO ] Redundant transitions in 101 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 14:02:02] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:02:02] [INFO ] Invariant cache hit.
[2024-05-24 14:02:02] [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 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 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 1.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 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 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 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 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 32203ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37375 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 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 42 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-05-24 14:02:34] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 14:02:34] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 14:02:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 14:02:34] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 14:02:34] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 14:02:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 14:02:34] [INFO ] After 39ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 14:02:34] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 14:02:34] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 397 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 143 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 197 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 285 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 34 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 14:02:35] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 14:02:35] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 14:02:36] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-24 14:02:36] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:02:36] [INFO ] Invariant cache hit.
[2024-05-24 14:02:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:02:45] [INFO ] Implicit Places using invariants and state equation in 8966 ms returned []
Implicit Place search using SMT with State Equation took 10298 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 14:02:45] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:02:45] [INFO ] Invariant cache hit.
[2024-05-24 14:02:45] [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 timeout
0.0 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 32638ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32671ms
Finished structural reductions in LTL mode , in 1 iterations and 43011 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 110 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))]
RANDOM walk for 40000 steps (8 resets) in 1192 ms. (33 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
[2024-05-24 14:03:19] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:03:19] [INFO ] Invariant cache hit.
[2024-05-24 14:03:19] [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 1224 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-05-24 14:03:20] [INFO ] Deduced a trap composed of 3 places in 113 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-05-24 14:03:21] [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-05-24 14:03:22] [INFO ] Deduced a trap composed of 3 places in 210 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 2909 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 4164ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 669 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 284 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 284 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 1240 ms. (32 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
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 149670 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 149670 steps, saw 100751 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 14:03:27] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 14:03:27] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 14:03:27] [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 802 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-05-24 14:03:29] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 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-05-24 14:03:29] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 5 ms to minimize.
[2024-05-24 14:03:30] [INFO ] Deduced a trap composed of 37 places in 489 ms of which 4 ms to minimize.
[2024-05-24 14:03:31] [INFO ] Deduced a trap composed of 3 places in 540 ms of which 5 ms to minimize.
[2024-05-24 14:03:31] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 4 ms to minimize.
[2024-05-24 14:03:31] [INFO ] Deduced a trap composed of 27 places in 456 ms of which 4 ms to minimize.
[2024-05-24 14:03:32] [INFO ] Deduced a trap composed of 3 places in 475 ms of which 4 ms to minimize.
[2024-05-24 14:03:32] [INFO ] Deduced a trap composed of 34 places in 390 ms of which 3 ms to minimize.
[2024-05-24 14:03:33] [INFO ] Deduced a trap composed of 35 places in 418 ms of which 4 ms to minimize.
[2024-05-24 14:03:33] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 4 ms to minimize.
[2024-05-24 14:03:34] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 4 ms to minimize.
[2024-05-24 14:03:34] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 4 ms to minimize.
[2024-05-24 14:03:34] [INFO ] Deduced a trap composed of 3 places in 75 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 6833 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 7673ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 766 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 100 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 100 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 99 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 14:03:36] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:03:36] [INFO ] Invariant cache hit.
[2024-05-24 14:03:37] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2024-05-24 14:03:37] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:03:37] [INFO ] Invariant cache hit.
[2024-05-24 14:03:38] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:03:42] [INFO ] Implicit Places using invariants and state equation in 5290 ms returned []
Implicit Place search using SMT with State Equation took 6431 ms to find 0 implicit places.
[2024-05-24 14:03:43] [INFO ] Redundant transitions in 166 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 14:03:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:03:43] [INFO ] Invariant cache hit.
[2024-05-24 14:03:43] [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 32783ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39494 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 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-05-24 14:04:16] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 14:04:16] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 14:04:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 14:04:16] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 14:04:16] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 14:04:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 14:04:16] [INFO ] After 28ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 14:04:16] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 14:04:16] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 337 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 188 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))]
Stuttering acceptance computed with spot in 175 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 162 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 1159 ms.
Product exploration explored 100000 steps with 25000 reset in 865 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 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 3 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 5 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 5 ms
Applied a total of 351 rules in 458 ms. Remains 811 /820 variables (removed 9) and now considering 3654/3249 (removed -405) transitions.
[2024-05-24 14:04:20] [INFO ] Redundant transitions in 228 ms returned []
Running 3645 sub problems to find dead transitions.
[2024-05-24 14:04:20] [INFO ] Flow matrix only has 1368 transitions (discarded 2286 similar events)
// Phase 1: matrix 1368 rows 811 cols
[2024-05-24 14:04:20] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 14:04:20] [INFO ] State equation strengthened by 597 read => feed constraints.
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 33436ms, After SMT, problems are : Problem set: 0 solved, 3645 unsolved
Search for dead transitions found 0 dead transitions in 33475ms
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 34189 ms. Remains : 811/820 places, 3654/3249 transitions.
Built C files in :
/tmp/ltsmin12461373354306158233
[2024-05-24 14:04:53] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12461373354306158233
Running compilation step : cd /tmp/ltsmin12461373354306158233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12461373354306158233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12461373354306158233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 41 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 14:04:56] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 14:04:56] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 14:04:58] [INFO ] Implicit Places using invariants in 1519 ms returned []
[2024-05-24 14:04:58] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:04:58] [INFO ] Invariant cache hit.
[2024-05-24 14:04:59] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:05:09] [INFO ] Implicit Places using invariants and state equation in 11092 ms returned []
Implicit Place search using SMT with State Equation took 12620 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 14:05:09] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:05:09] [INFO ] Invariant cache hit.
[2024-05-24 14:05:09] [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 33277ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 33329ms
Finished structural reductions in LTL mode , in 1 iterations and 45994 ms. Remains : 820/820 places, 3249/3249 transitions.
Built C files in :
/tmp/ltsmin2806971126942264786
[2024-05-24 14:05:42] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2806971126942264786
Running compilation step : cd /tmp/ltsmin2806971126942264786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2806971126942264786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2806971126942264786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 14:05:45] [INFO ] Flatten gal took : 80 ms
[2024-05-24 14:05:46] [INFO ] Flatten gal took : 88 ms
[2024-05-24 14:05:46] [INFO ] Time to serialize gal into /tmp/LTL3575860769927560414.gal : 12 ms
[2024-05-24 14:05:46] [INFO ] Time to serialize properties into /tmp/LTL15944021502894981882.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3575860769927560414.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13672438518193491732.hoa' '-atoms' '/tmp/LTL15944021502894981882.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15944021502894981882.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13672438518193491732.hoa
Detected timeout of ITS tools.
[2024-05-24 14:06:01] [INFO ] Flatten gal took : 81 ms
[2024-05-24 14:06:01] [INFO ] Flatten gal took : 88 ms
[2024-05-24 14:06:01] [INFO ] Time to serialize gal into /tmp/LTL8120852814435580472.gal : 13 ms
[2024-05-24 14:06:01] [INFO ] Time to serialize properties into /tmp/LTL4425808250070375476.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8120852814435580472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4425808250070375476.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("(((turn_1==0)||(flag_1_waiting==0))||(p25_5_1==0))"))))||("((turn_3==1)&&(p10_8_2==1))")))))
Formula 0 simplified : XG(!"((turn_3==1)&&(p10_8_2==1))" & XXG!"(((turn_1==0)||(flag_1_waiting==0))||(p25_5_1==0))")
Detected timeout of ITS tools.
[2024-05-24 14:06:16] [INFO ] Flatten gal took : 167 ms
[2024-05-24 14:06:16] [INFO ] Applying decomposition
[2024-05-24 14:06:16] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2513758790860448445.txt' '-o' '/tmp/graph2513758790860448445.bin' '-w' '/tmp/graph2513758790860448445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2513758790860448445.bin' '-l' '-1' '-v' '-w' '/tmp/graph2513758790860448445.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:06:16] [INFO ] Decomposing Gal with order
[2024-05-24 14:06:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:06:17] [INFO ] Removed a total of 6644 redundant transitions.
[2024-05-24 14:06:17] [INFO ] Flatten gal took : 221 ms
[2024-05-24 14:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 724 labels/synchronizations in 90 ms.
[2024-05-24 14:06:17] [INFO ] Time to serialize gal into /tmp/LTL14192819084917969086.gal : 18 ms
[2024-05-24 14:06:17] [INFO ] Time to serialize properties into /tmp/LTL18136009943043207242.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14192819084917969086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18136009943043207242.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("(((i2.u5.turn_1==0)||(i10.u2.flag_1_waiting==0))||(i12.u4.p25_5_1==0))"))))||("((i14.u6.turn_3==1)&&(i16.i1.i0.u46.p10_...169
Formula 0 simplified : XG(!"((i14.u6.turn_3==1)&&(i16.i1.i0.u46.p10_8_2==1))" & XXG!"(((i2.u5.turn_1==0)||(i10.u2.flag_1_waiting==0))||(i12.u4.p25_5_1==0))...157
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 337227 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 43 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 14:06:32] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 14:06:32] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 14:06:33] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-24 14:06:33] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:06:33] [INFO ] Invariant cache hit.
[2024-05-24 14:06:34] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:06:41] [INFO ] Implicit Places using invariants and state equation in 7770 ms returned []
Implicit Place search using SMT with State Equation took 8740 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 14:06:41] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 14:06:41] [INFO ] Invariant cache hit.
[2024-05-24 14:06:41] [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 32669ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32702ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41488 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 118 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 21 reset in 472 ms.
Stack based approach found an accepted trace after 96 steps with 0 reset with depth 97 and stack size 97 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-14 finished in 42113 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 4 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 314 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 14:07:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 14:07:14] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:07:15] [INFO ] Implicit Places using invariants in 994 ms returned []
[2024-05-24 14:07:15] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 14:07:15] [INFO ] Invariant cache hit.
[2024-05-24 14:07:16] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 14:07:19] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 4784 ms to find 0 implicit places.
[2024-05-24 14:07:19] [INFO ] Redundant transitions in 109 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 14:07:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 14:07:19] [INFO ] Invariant cache hit.
[2024-05-24 14:07:19] [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 32513ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32542ms
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 37758 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 130 reset in 320 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-15 finished in 38141 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 139 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 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 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 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 2916
Applied a total of 672 rules in 131 ms. Remains 487 /823 variables (removed 336) and now considering 2916/3276 (removed 360) transitions.
[2024-05-24 14:07:53] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 14:07:53] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 14:07:54] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2024-05-24 14:07:54] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:07:54] [INFO ] Invariant cache hit.
[2024-05-24 14:07:55] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:07:58] [INFO ] Implicit Places using invariants and state equation in 4005 ms returned []
Implicit Place search using SMT with State Equation took 5367 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-05-24 14:07:58] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:07:58] [INFO ] Invariant cache hit.
[2024-05-24 14:07:58] [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 32764ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32823ms
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 38328 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 321 ms.
Product exploration explored 100000 steps with 0 reset in 360 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 137 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 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 2156 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 96240 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 96240 steps, saw 67095 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-24 14:08:36] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:08:36] [INFO ] Invariant cache hit.
[2024-05-24 14:08:36] [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 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: 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-05-24 14:08:37] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 4 ms to minimize.
[2024-05-24 14:08:38] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 4 ms to minimize.
[2024-05-24 14:08:38] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 3 ms to minimize.
[2024-05-24 14:08:39] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 3 ms to minimize.
[2024-05-24 14:08:39] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 2 ms to minimize.
[2024-05-24 14:08:39] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2024-05-24 14:08:39] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 14:08:39] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-05-24 14:08:40] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 2 ms to minimize.
[2024-05-24 14:08:40] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2024-05-24 14:08:40] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-24 14:08:40] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
[2024-05-24 14:08:40] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 2 ms to minimize.
[2024-05-24 14:08:40] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 2 ms to minimize.
[2024-05-24 14:08:41] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 2 ms to minimize.
[2024-05-24 14:08:41] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2024-05-24 14:08:41] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 17/313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 441/1324 variables, 294/607 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1324 variables, 292/899 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 0/899 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 899 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5006 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: 17/17 constraints]
After SMT, in 5927ms 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 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 1636 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 119960 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 3
Probabilistic random walk after 119960 steps, saw 82226 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-24 14:08:45] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:08:45] [INFO ] Invariant cache hit.
[2024-05-24 14:08:45] [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 772 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-05-24 14:08:46] [INFO ] Deduced a trap composed of 3 places in 72 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-05-24 14:08:47] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 5 ms to minimize.
[2024-05-24 14:08:48] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 2 ms to minimize.
[2024-05-24 14:08:48] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 3 ms to minimize.
[2024-05-24 14:08:48] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
[2024-05-24 14:08:48] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-05-24 14:08:48] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2024-05-24 14:08:48] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
[2024-05-24 14:08:48] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 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 3000 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 3795ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1709 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 108 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 109 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 123 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 14:08:51] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:08:51] [INFO ] Invariant cache hit.
[2024-05-24 14:08:52] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-05-24 14:08:52] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:08:52] [INFO ] Invariant cache hit.
[2024-05-24 14:08:53] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:08:56] [INFO ] Implicit Places using invariants and state equation in 4073 ms returned []
Implicit Place search using SMT with State Equation took 4936 ms to find 0 implicit places.
[2024-05-24 14:08:56] [INFO ] Redundant transitions in 167 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 14:08:56] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:08:56] [INFO ] Invariant cache hit.
[2024-05-24 14:08:56] [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 32936ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32984ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38220 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 99 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-05-24 14:09:29] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 14:09:29] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 14:09:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 14:09:29] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 14:09:30] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 14:09:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 14:09:30] [INFO ] After 51ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 14:09:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:09:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:09:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2024-05-24 14:09:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:09:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:09:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2024-05-24 14:09:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:09:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-05-24 14:09:30] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 14:09:30] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 726 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 127 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))]
Stuttering acceptance computed with spot in 86 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 125 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 14:09:30] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 14:09:30] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:09:32] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2024-05-24 14:09:32] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:09:32] [INFO ] Invariant cache hit.
[2024-05-24 14:09:32] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:09:36] [INFO ] Implicit Places using invariants and state equation in 4885 ms returned []
Implicit Place search using SMT with State Equation took 6013 ms to find 0 implicit places.
[2024-05-24 14:09:37] [INFO ] Redundant transitions in 96 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 14:09:37] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:09:37] [INFO ] Invariant cache hit.
[2024-05-24 14:09:37] [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 32681ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32711ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38953 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 108 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 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 2578 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 84940 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 4
Probabilistic random walk after 84940 steps, saw 60175 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-24 14:10:14] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:10:14] [INFO ] Invariant cache hit.
[2024-05-24 14:10:14] [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-05-24 14:10:15] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 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-05-24 14:10:16] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 4 ms to minimize.
[2024-05-24 14:10:17] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 4 ms to minimize.
[2024-05-24 14:10:17] [INFO ] Deduced a trap composed of 3 places in 362 ms of which 4 ms to minimize.
[2024-05-24 14:10:17] [INFO ] Deduced a trap composed of 31 places in 334 ms of which 3 ms to minimize.
[2024-05-24 14:10:18] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 3 ms to minimize.
[2024-05-24 14:10:18] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 2 ms to minimize.
[2024-05-24 14:10:18] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2024-05-24 14:10:19] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2024-05-24 14:10:19] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 2 ms to minimize.
[2024-05-24 14:10:19] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-24 14:10:19] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 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
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 292/894 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 14:10:20] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 2 ms to minimize.
SMT process timed out in 6675ms, 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 168 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 169 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 2365 ms. (16 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 101990 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 3
Probabilistic random walk after 101990 steps, saw 70935 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-24 14:10:24] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:10:24] [INFO ] Invariant cache hit.
[2024-05-24 14:10: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, 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 1075 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-05-24 14:10:26] [INFO ] Deduced a trap composed of 3 places in 81 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-05-24 14:10:27] [INFO ] Deduced a trap composed of 7 places in 534 ms of which 5 ms to minimize.
[2024-05-24 14:10:27] [INFO ] Deduced a trap composed of 3 places in 526 ms of which 4 ms to minimize.
[2024-05-24 14:10:28] [INFO ] Deduced a trap composed of 19 places in 540 ms of which 4 ms to minimize.
[2024-05-24 14:10:28] [INFO ] Deduced a trap composed of 3 places in 503 ms of which 5 ms to minimize.
[2024-05-24 14:10:29] [INFO ] Deduced a trap composed of 26 places in 483 ms of which 4 ms to minimize.
[2024-05-24 14:10:29] [INFO ] Deduced a trap composed of 22 places in 491 ms of which 4 ms to minimize.
[2024-05-24 14:10:30] [INFO ] Deduced a trap composed of 66 places in 508 ms of which 4 ms to minimize.
[2024-05-24 14:10:31] [INFO ] Deduced a trap composed of 3 places in 507 ms of which 5 ms to minimize.
[2024-05-24 14:10:31] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 4 ms to minimize.
[2024-05-24 14:10:31] [INFO ] Deduced a trap composed of 43 places in 325 ms of which 3 ms to minimize.
[2024-05-24 14:10:32] [INFO ] Deduced a trap composed of 14 places in 486 ms of which 5 ms to minimize.
[2024-05-24 14:10:32] [INFO ] Deduced a trap composed of 3 places in 390 ms of which 4 ms to minimize.
[2024-05-24 14:10:33] [INFO ] Deduced a trap composed of 39 places in 328 ms of which 3 ms to minimize.
[2024-05-24 14:10:33] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 2 ms to minimize.
[2024-05-24 14:10:33] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 2 ms to minimize.
[2024-05-24 14:10:33] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2024-05-24 14:10:33] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-24 14:10:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-24 14:10:34] [INFO ] Deduced a trap composed of 34 places in 354 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-05-24 14:10:34] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 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 9836 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 10950ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1852 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 169 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 169 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 202 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 14:10:37] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:10:37] [INFO ] Invariant cache hit.
[2024-05-24 14:10:39] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2024-05-24 14:10:39] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:10:39] [INFO ] Invariant cache hit.
[2024-05-24 14:10:39] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:10:43] [INFO ] Implicit Places using invariants and state equation in 4668 ms returned []
Implicit Place search using SMT with State Equation took 5741 ms to find 0 implicit places.
[2024-05-24 14:10:43] [INFO ] Redundant transitions in 134 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 14:10:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:10:43] [INFO ] Invariant cache hit.
[2024-05-24 14:10:43] [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 33383ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 33422ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39510 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 40 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-05-24 14:11:17] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 14:11:17] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 14:11:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 14:11:17] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 14:11:17] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 14:11:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 14:11:17] [INFO ] After 52ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 14:11:17] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:11:17] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:11:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:11:17] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:11:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:11:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 190 ms
TRAPS : Iteration 1
[2024-05-24 14:11:17] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 14:11:17] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 728 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 170 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 116 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 483 ms.
Product exploration explored 100000 steps with 0 reset in 394 ms.
Built C files in :
/tmp/ltsmin18253309983393038334
[2024-05-24 14:11:19] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 14:11:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18253309983393038334
Running compilation step : cd /tmp/ltsmin18253309983393038334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18253309983393038334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18253309983393038334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 108 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 14:11:22] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 14:11:22] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:11:23] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-05-24 14:11:23] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:11:23] [INFO ] Invariant cache hit.
[2024-05-24 14:11:23] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:11:27] [INFO ] Implicit Places using invariants and state equation in 4007 ms returned []
Implicit Place search using SMT with State Equation took 4982 ms to find 0 implicit places.
[2024-05-24 14:11:27] [INFO ] Redundant transitions in 96 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 14:11:27] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 14:11:27] [INFO ] Invariant cache hit.
[2024-05-24 14:11:27] [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 32572ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32601ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37796 ms. Remains : 487/487 places, 2916/2916 transitions.
Built C files in :
/tmp/ltsmin7449457008024262228
[2024-05-24 14:12:00] [INFO ] Too many transitions (2916) to apply POR reductions. Disabling POR matrices.
[2024-05-24 14:12:00] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7449457008024262228
Running compilation step : cd /tmp/ltsmin7449457008024262228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7449457008024262228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7449457008024262228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 14:12:03] [INFO ] Flatten gal took : 74 ms
[2024-05-24 14:12:03] [INFO ] Flatten gal took : 76 ms
[2024-05-24 14:12:03] [INFO ] Time to serialize gal into /tmp/LTL6743414473962202432.gal : 11 ms
[2024-05-24 14:12:03] [INFO ] Time to serialize properties into /tmp/LTL2514285802577277793.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6743414473962202432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7157768495811748492.hoa' '-atoms' '/tmp/LTL2514285802577277793.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2514285802577277793.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7157768495811748492.hoa
Detected timeout of ITS tools.
[2024-05-24 14:12:18] [INFO ] Flatten gal took : 65 ms
[2024-05-24 14:12:18] [INFO ] Flatten gal took : 67 ms
[2024-05-24 14:12:18] [INFO ] Time to serialize gal into /tmp/LTL15516923588590852781.gal : 11 ms
[2024-05-24 14:12:18] [INFO ] Time to serialize properties into /tmp/LTL3006358000141229926.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15516923588590852781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3006358000141229926.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((turn_5==0)||(flag_5_active==0))")||(("(p25_8_4==0)")||(G("((turn_6==0)||(p10_5_0==0))")))))))
Formula 0 simplified : XF(!"((turn_5==0)||(flag_5_active==0))" & !"(p25_8_4==0)" & F!"((turn_6==0)||(p10_5_0==0))")
Detected timeout of ITS tools.
[2024-05-24 14:12:33] [INFO ] Flatten gal took : 72 ms
[2024-05-24 14:12:33] [INFO ] Applying decomposition
[2024-05-24 14:12:33] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16175759961646853230.txt' '-o' '/tmp/graph16175759961646853230.bin' '-w' '/tmp/graph16175759961646853230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16175759961646853230.bin' '-l' '-1' '-v' '-w' '/tmp/graph16175759961646853230.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:12:34] [INFO ] Decomposing Gal with order
[2024-05-24 14:12:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:12:34] [INFO ] Removed a total of 6306 redundant transitions.
[2024-05-24 14:12:34] [INFO ] Flatten gal took : 213 ms
[2024-05-24 14:12:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 692 labels/synchronizations in 60 ms.
[2024-05-24 14:12:34] [INFO ] Time to serialize gal into /tmp/LTL9915010889236531300.gal : 12 ms
[2024-05-24 14:12:34] [INFO ] Time to serialize properties into /tmp/LTL13679409874810938405.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9915010889236531300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13679409874810938405.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i7.u0.turn_5==0)||(i9.u3.flag_5_active==0))")||(("(i13.u7.p25_8_4==0)")||(G("((i13.u7.turn_6==0)||(i10.u12.p10_5_0==0))")))...159
Formula 0 simplified : XF(!"((i7.u0.turn_5==0)||(i9.u3.flag_5_active==0))" & !"(i13.u7.p25_8_4==0)" & F!"((i13.u7.turn_6==0)||(i10.u12.p10_5_0==0))")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 296741 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 110 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 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 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 2 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 112 ms. Remains 488 /823 variables (removed 335) and now considering 2917/3276 (removed 359) transitions.
[2024-05-24 14:12:49] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 14:12:49] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:12:50] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-05-24 14:12:50] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:12:50] [INFO ] Invariant cache hit.
[2024-05-24 14:12:51] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:12:54] [INFO ] Implicit Places using invariants and state equation in 3559 ms returned []
Implicit Place search using SMT with State Equation took 4417 ms to find 0 implicit places.
Running 2908 sub problems to find dead transitions.
[2024-05-24 14:12:54] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:12:54] [INFO ] Invariant cache hit.
[2024-05-24 14:12: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 32620ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32651ms
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 37182 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 91 reset in 287 ms.
Product exploration explored 100000 steps with 91 reset in 310 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 126 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 78 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 1131 ms. (35 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
[2024-05-24 14:13:28] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:13:28] [INFO ] Invariant cache hit.
[2024-05-24 14:13:28] [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 662 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-05-24 14:13:29] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 5 ms to minimize.
[2024-05-24 14:13:30] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 4 ms to minimize.
[2024-05-24 14:13:30] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 4 ms to minimize.
[2024-05-24 14:13:30] [INFO ] Deduced a trap composed of 42 places in 393 ms of which 5 ms to minimize.
[2024-05-24 14:13:31] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 2 ms to minimize.
[2024-05-24 14:13:31] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 5 ms to minimize.
[2024-05-24 14:13:31] [INFO ] Deduced a trap composed of 40 places in 395 ms of which 5 ms to minimize.
[2024-05-24 14:13:32] [INFO ] Deduced a trap composed of 24 places in 409 ms of which 4 ms to minimize.
[2024-05-24 14:13:32] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-05-24 14:13:32] [INFO ] Deduced a trap composed of 78 places in 319 ms of which 4 ms to minimize.
[2024-05-24 14:13:33] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 2 ms to minimize.
[2024-05-24 14:13:33] [INFO ] Deduced a trap composed of 35 places in 314 ms of which 4 ms to minimize.
[2024-05-24 14:13:33] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-05-24 14:13:33] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1326 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 236/488 constraints, ReadFeed: 98/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 5685ms 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 170 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 172 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 1019 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 154990 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 154990 steps, saw 102545 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-24 14:13:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:13:37] [INFO ] Invariant cache hit.
[2024-05-24 14:13: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 677 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-05-24 14:13:39] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 3 ms to minimize.
[2024-05-24 14:13:39] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 2 ms to minimize.
[2024-05-24 14:13:39] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 3 ms to minimize.
[2024-05-24 14:13:39] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 3 ms to minimize.
[2024-05-24 14:13:40] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 3 ms to minimize.
[2024-05-24 14:13:40] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 4 ms to minimize.
[2024-05-24 14:13:40] [INFO ] Deduced a trap composed of 40 places in 375 ms of which 3 ms to minimize.
[2024-05-24 14:13:41] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 3 ms to minimize.
[2024-05-24 14:13:41] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-05-24 14:13:41] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 2 ms to minimize.
[2024-05-24 14:13:41] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 2 ms to minimize.
[2024-05-24 14:13:42] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 3 ms to minimize.
[2024-05-24 14:13:42] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-05-24 14:13:42] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 3 ms to minimize.
[2024-05-24 14:13:43] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 2 ms to minimize.
[2024-05-24 14:13:43] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 2 ms to minimize.
[2024-05-24 14:13:43] [INFO ] Deduced a trap composed of 13 places in 393 ms of which 5 ms to minimize.
[2024-05-24 14:13:44] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 4 ms to minimize.
[2024-05-24 14:13:44] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 2 ms to minimize.
[2024-05-24 14:13:44] [INFO ] Deduced a trap composed of 34 places in 242 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-05-24 14:13:44] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
[2024-05-24 14:13:44] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2024-05-24 14:13:45] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2024-05-24 14:13:45] [INFO ] Deduced a trap composed of 31 places in 72 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-05-24 14:13:45] [INFO ] Deduced a trap composed of 33 places in 85 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 8109 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 8804ms 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 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 102 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 102 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 99 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 14:13:47] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:13:47] [INFO ] Invariant cache hit.
[2024-05-24 14:13:48] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2024-05-24 14:13:48] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:13:48] [INFO ] Invariant cache hit.
[2024-05-24 14:13:48] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:13:52] [INFO ] Implicit Places using invariants and state equation in 4073 ms returned []
Implicit Place search using SMT with State Equation took 5144 ms to find 0 implicit places.
[2024-05-24 14:13:52] [INFO ] Redundant transitions in 104 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 14:13:52] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:13:52] [INFO ] Invariant cache hit.
[2024-05-24 14:13:52] [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 32655ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38041 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 38 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-05-24 14:14:25] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 14:14:25] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 14:14:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 14:14:25] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 14:14:25] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 14:14:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 14:14:25] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 14:14:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:14:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:14:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-05-24 14:14:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 14:14:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-05-24 14:14:25] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 14:14:25] [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 528 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 258 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 103 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 103 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 103 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 14:14:26] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 14:14:26] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 14:14:27] [INFO ] Implicit Places using invariants in 997 ms returned []
[2024-05-24 14:14:27] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:14:27] [INFO ] Invariant cache hit.
[2024-05-24 14:14:27] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:14:31] [INFO ] Implicit Places using invariants and state equation in 4636 ms returned []
Implicit Place search using SMT with State Equation took 5636 ms to find 0 implicit places.
[2024-05-24 14:14:31] [INFO ] Redundant transitions in 96 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 14:14:31] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:14:31] [INFO ] Invariant cache hit.
[2024-05-24 14:14:31] [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 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 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 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)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 32789ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32819ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38662 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 160 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 95 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 1446 ms. (27 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
[2024-05-24 14:15:05] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:15:05] [INFO ] Invariant cache hit.
[2024-05-24 14:15:05] [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-05-24 14:15:07] [INFO ] Deduced a trap composed of 3 places in 536 ms of which 5 ms to minimize.
[2024-05-24 14:15:08] [INFO ] Deduced a trap composed of 3 places in 349 ms of which 4 ms to minimize.
[2024-05-24 14:15:08] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 4 ms to minimize.
[2024-05-24 14:15:09] [INFO ] Deduced a trap composed of 42 places in 492 ms of which 5 ms to minimize.
[2024-05-24 14:15:09] [INFO ] Deduced a trap composed of 51 places in 412 ms of which 5 ms to minimize.
[2024-05-24 14:15:10] [INFO ] Deduced a trap composed of 23 places in 485 ms of which 4 ms to minimize.
[2024-05-24 14:15:10] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 4 ms to minimize.
[2024-05-24 14:15:10] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 5 ms to minimize.
[2024-05-24 14:15:11] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 4 ms to minimize.
[2024-05-24 14:15:11] [INFO ] Deduced a trap composed of 78 places in 336 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1326 variables, and 374 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: 236/488 constraints, ReadFeed: 98/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 6077ms 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 170 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.
RANDOM walk for 40000 steps (8 resets) in 1326 ms. (30 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
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153420 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 153420 steps, saw 101660 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-24 14:15:15] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:15:15] [INFO ] Invariant cache hit.
[2024-05-24 14:15:15] [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 936 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-05-24 14:15:17] [INFO ] Deduced a trap composed of 3 places in 493 ms of which 4 ms to minimize.
[2024-05-24 14:15:17] [INFO ] Deduced a trap composed of 3 places in 437 ms of which 4 ms to minimize.
[2024-05-24 14:15:18] [INFO ] Deduced a trap composed of 3 places in 460 ms of which 5 ms to minimize.
[2024-05-24 14:15:19] [INFO ] Deduced a trap composed of 42 places in 507 ms of which 5 ms to minimize.
[2024-05-24 14:15:19] [INFO ] Deduced a trap composed of 51 places in 452 ms of which 4 ms to minimize.
[2024-05-24 14:15:20] [INFO ] Deduced a trap composed of 23 places in 495 ms of which 5 ms to minimize.
[2024-05-24 14:15:20] [INFO ] Deduced a trap composed of 40 places in 497 ms of which 4 ms to minimize.
[2024-05-24 14:15:21] [INFO ] Deduced a trap composed of 24 places in 521 ms of which 5 ms to minimize.
[2024-05-24 14:15:21] [INFO ] Deduced a trap composed of 3 places in 323 ms of which 3 ms to minimize.
[2024-05-24 14:15:21] [INFO ] Deduced a trap composed of 78 places in 422 ms of which 4 ms to minimize.
[2024-05-24 14:15:22] [INFO ] Deduced a trap composed of 53 places in 414 ms of which 4 ms to minimize.
[2024-05-24 14:15:22] [INFO ] Deduced a trap composed of 35 places in 402 ms of which 4 ms to minimize.
[2024-05-24 14:15:23] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 3 ms to minimize.
[2024-05-24 14:15:23] [INFO ] Deduced a trap composed of 30 places in 398 ms of which 4 ms to minimize.
[2024-05-24 14:15:23] [INFO ] Deduced a trap composed of 47 places in 483 ms of which 4 ms to minimize.
[2024-05-24 14:15:24] [INFO ] Deduced a trap composed of 45 places in 489 ms of which 4 ms to minimize.
[2024-05-24 14:15:25] [INFO ] Deduced a trap composed of 13 places in 485 ms of which 4 ms to minimize.
[2024-05-24 14:15:25] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 3 ms to minimize.
[2024-05-24 14:15:25] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 3 ms to minimize.
[2024-05-24 14:15:26] [INFO ] Deduced a trap composed of 34 places in 335 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-05-24 14:15:26] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 4 ms to minimize.
[2024-05-24 14:15:26] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 2 ms to minimize.
[2024-05-24 14:15:27] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 3 ms to minimize.
[2024-05-24 14:15:27] [INFO ] Deduced a trap composed of 31 places in 134 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-05-24 14:15:28] [INFO ] Deduced a trap composed of 33 places in 125 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 12294 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 13249ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 988 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 112 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 113 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 115 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 14:15:29] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:15:29] [INFO ] Invariant cache hit.
[2024-05-24 14:15:30] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2024-05-24 14:15:30] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:15:30] [INFO ] Invariant cache hit.
[2024-05-24 14:15:31] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:15:35] [INFO ] Implicit Places using invariants and state equation in 4225 ms returned []
Implicit Place search using SMT with State Equation took 5326 ms to find 0 implicit places.
[2024-05-24 14:15:35] [INFO ] Redundant transitions in 167 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 14:15:35] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:15:35] [INFO ] Invariant cache hit.
[2024-05-24 14:15:35] [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 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 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 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 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 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.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 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)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 33287ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 33334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38959 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 50 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-05-24 14:16:08] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 14:16:08] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 14:16:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 14:16:08] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 14:16:08] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 14:16:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 14:16:08] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 14:16:08] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:16:08] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:16:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2024-05-24 14:16:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-05-24 14:16:09] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 14:16:09] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 487 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 255 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 225 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 91 reset in 358 ms.
Product exploration explored 100000 steps with 90 reset in 396 ms.
Built C files in :
/tmp/ltsmin16068741751772662280
[2024-05-24 14:16:10] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 14:16:10] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16068741751772662280
Running compilation step : cd /tmp/ltsmin16068741751772662280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16068741751772662280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16068741751772662280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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-05-24 14:16:13] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 14:16:13] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:16:14] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2024-05-24 14:16:14] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:16:14] [INFO ] Invariant cache hit.
[2024-05-24 14:16:15] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 14:16:19] [INFO ] Implicit Places using invariants and state equation in 4466 ms returned []
Implicit Place search using SMT with State Equation took 5496 ms to find 0 implicit places.
[2024-05-24 14:16:19] [INFO ] Redundant transitions in 99 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 14:16:19] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 14:16:19] [INFO ] Invariant cache hit.
[2024-05-24 14:16:19] [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 32649ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32678ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38391 ms. Remains : 488/488 places, 2917/2917 transitions.
Built C files in :
/tmp/ltsmin1874448169951068810
[2024-05-24 14:16:52] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2024-05-24 14:16:52] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1874448169951068810
Running compilation step : cd /tmp/ltsmin1874448169951068810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1874448169951068810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1874448169951068810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 14:16:55] [INFO ] Flatten gal took : 65 ms
[2024-05-24 14:16:55] [INFO ] Flatten gal took : 67 ms
[2024-05-24 14:16:55] [INFO ] Time to serialize gal into /tmp/LTL14253836741630208918.gal : 10 ms
[2024-05-24 14:16:55] [INFO ] Time to serialize properties into /tmp/LTL9327506016448322146.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14253836741630208918.gal' '-t' 'CGAL' '-hoa' '/tmp/aut77272481894268304.hoa' '-atoms' '/tmp/LTL9327506016448322146.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9327506016448322146.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut77272481894268304.hoa
Detected timeout of ITS tools.
[2024-05-24 14:17:10] [INFO ] Flatten gal took : 70 ms
[2024-05-24 14:17:10] [INFO ] Flatten gal took : 68 ms
[2024-05-24 14:17:10] [INFO ] Time to serialize gal into /tmp/LTL4831444601194933106.gal : 10 ms
[2024-05-24 14:17:10] [INFO ] Time to serialize properties into /tmp/LTL17278167048579088868.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4831444601194933106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17278167048579088868.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_7_active==0)||(p09_3_7==0))")||(F((X("((flag_7_active==0)||(p09_3_7==0))"))||(G("((turn_6==0)||(p10_1_2==0))"))))))))
Formula 0 simplified : XF(!"((flag_7_active==0)||(p09_3_7==0))" & G(X!"((flag_7_active==0)||(p09_3_7==0))" & F!"((turn_6==0)||(p10_1_2==0))"))
Detected timeout of ITS tools.
[2024-05-24 14:17:25] [INFO ] Flatten gal took : 65 ms
[2024-05-24 14:17:25] [INFO ] Applying decomposition
[2024-05-24 14:17:25] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1819257050307873769.txt' '-o' '/tmp/graph1819257050307873769.bin' '-w' '/tmp/graph1819257050307873769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1819257050307873769.bin' '-l' '-1' '-v' '-w' '/tmp/graph1819257050307873769.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:17:25] [INFO ] Decomposing Gal with order
[2024-05-24 14:17:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:17:26] [INFO ] Removed a total of 6358 redundant transitions.
[2024-05-24 14:17:26] [INFO ] Flatten gal took : 196 ms
[2024-05-24 14:17:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 625 labels/synchronizations in 54 ms.
[2024-05-24 14:17:26] [INFO ] Time to serialize gal into /tmp/LTL189902287906503247.gal : 11 ms
[2024-05-24 14:17:26] [INFO ] Time to serialize properties into /tmp/LTL4731312787831954596.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL189902287906503247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4731312787831954596.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i0.u0.flag_7_active==0)||(i13.u11.p09_3_7==0))")||(F((X("((i0.u0.flag_7_active==0)||(i13.u11.p09_3_7==0))"))||(G("((i3.u65....192
Formula 0 simplified : XF(!"((i0.u0.flag_7_active==0)||(i13.u11.p09_3_7==0))" & G(X!"((i0.u0.flag_7_active==0)||(i13.u11.p09_3_7==0))" & F!"((i3.u65.turn_6...180
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 291722 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 296 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 178 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-05-24 14:17:42] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 14:17:42] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 14:17:43] [INFO ] Implicit Places using invariants in 1308 ms returned []
[2024-05-24 14:17:43] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:17:43] [INFO ] Invariant cache hit.
[2024-05-24 14:17:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 14:17:48] [INFO ] Implicit Places using invariants and state equation in 4628 ms returned []
Implicit Place search using SMT with State Equation took 5938 ms to find 0 implicit places.
Running 2900 sub problems to find dead transitions.
[2024-05-24 14:17:48] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:17:48] [INFO ] Invariant cache hit.
[2024-05-24 14:17:48] [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 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 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 1.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 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, 2900 unsolved
SMT process timed out in 33012ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 33040ms
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 39159 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 495 ms.
Product exploration explored 100000 steps with 0 reset in 503 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 162 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 168 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 2939 ms. (13 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 493 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 7/7 properties
[2024-05-24 14:18:24] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:18:24] [INFO ] Invariant cache hit.
[2024-05-24 14:18:24] [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 1791 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-05-24 14:18:26] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 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-05-24 14:18:26] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 2 ms to minimize.
[2024-05-24 14:18:26] [INFO ] Deduced a trap composed of 21 places in 150 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-05-24 14:18:28] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2024-05-24 14:18:28] [INFO ] Deduced a trap composed of 23 places in 95 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 2999 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 4823ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1009 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 161 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 162 ms. Remains : 488/488 places, 2909/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 1797 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 85260 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 4
Probabilistic random walk after 85260 steps, saw 60527 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-24 14:18:34] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:18:34] [INFO ] Invariant cache hit.
[2024-05-24 14:18:34] [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 1383 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-05-24 14:18:37] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-05-24 14:18:37] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 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 2630 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 4033ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 852 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 169 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 169 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 177 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 14:18:39] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:18:39] [INFO ] Invariant cache hit.
[2024-05-24 14:18:40] [INFO ] Implicit Places using invariants in 1293 ms returned []
[2024-05-24 14:18:40] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:18:40] [INFO ] Invariant cache hit.
[2024-05-24 14:18:41] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 14:18:45] [INFO ] Implicit Places using invariants and state equation in 4728 ms returned []
Implicit Place search using SMT with State Equation took 6023 ms to find 0 implicit places.
[2024-05-24 14:18:45] [INFO ] Redundant transitions in 153 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 14:18:45] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:18:45] [INFO ] Invariant cache hit.
[2024-05-24 14:18:45] [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 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 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 1.0)
(s387 1.0)
(s388 1.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 1.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 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.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 1.0)
(s425 0.0)
(s426 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 32870ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39277 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 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 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 153 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-05-24 14:19:18] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 14:19:18] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 14:19:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 14:19:18] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 14:19:19] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 14:19:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 14:19:19] [INFO ] After 51ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 14:19:19] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 14:19:19] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 644 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 511 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 56 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 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 171 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 14:19:20] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 14:19:20] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:19:21] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-05-24 14:19:21] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:19:21] [INFO ] Invariant cache hit.
[2024-05-24 14:19:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 14:19:25] [INFO ] Implicit Places using invariants and state equation in 4359 ms returned []
Implicit Place search using SMT with State Equation took 5685 ms to find 0 implicit places.
[2024-05-24 14:19:25] [INFO ] Redundant transitions in 148 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 14:19:26] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:19:26] [INFO ] Invariant cache hit.
[2024-05-24 14:19:26] [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 32978ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 33024ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39039 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 109 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 217 ms. (183 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 314170 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 1
Probabilistic random walk after 314170 steps, saw 199778 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-24 14:20:02] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 14:20:02] [INFO ] Invariant cache hit.
[2024-05-24 14:20:02] [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 729 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-05-24 14:20:03] [INFO ] Deduced a trap composed of 3 places in 67 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 904 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 1651ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 152 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 190 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 191 ms. Remains : 487/488 places, 2908/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 313090 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 1
Probabilistic random walk after 313090 steps, saw 198830 distinct states, run finished after 3004 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-24 14:20:07] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 14:20:07] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 14:20:07] [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 526 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-05-24 14:20:08] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 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-05-24 14:20:08] [INFO ] Deduced a trap composed of 21 places in 123 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 1262 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 1812ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 164 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 185 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 186 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 185 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 14:20:09] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 14:20:09] [INFO ] Invariant cache hit.
[2024-05-24 14:20:10] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2024-05-24 14:20:10] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 14:20:10] [INFO ] Invariant cache hit.
[2024-05-24 14:20:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 14:20:15] [INFO ] Implicit Places using invariants and state equation in 4327 ms returned []
Implicit Place search using SMT with State Equation took 5485 ms to find 0 implicit places.
[2024-05-24 14:20:15] [INFO ] Redundant transitions in 100 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 14:20:15] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 14:20:15] [INFO ] Invariant cache hit.
[2024-05-24 14:20:15] [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 32718ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32754ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38539 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 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 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 52 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-05-24 14:20:48] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 14:20:48] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 14:20:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 14:20:48] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 14:20:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 14:20:48] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 14:20:48] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 14:20:48] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 63 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 451 ms.
Product exploration explored 100000 steps with 0 reset in 545 ms.
Built C files in :
/tmp/ltsmin2848375861795519568
[2024-05-24 14:20:49] [INFO ] Too many transitions (2909) to apply POR reductions. Disabling POR matrices.
[2024-05-24 14:20:49] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2848375861795519568
Running compilation step : cd /tmp/ltsmin2848375861795519568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2848375861795519568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2848375861795519568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 5 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 195 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
[2024-05-24 14:20:52] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 14:20:52] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 14:20:54] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-24 14:20:54] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 14:20:54] [INFO ] Invariant cache hit.
[2024-05-24 14:20:54] [INFO ] State equation strengthened by 356 read => feed constraints.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266400196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;