MCC'2024- Execution of r512-smll-171654407300276

About the Execution of LTSMin+red for Peterson-PT-5

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
903.544	536126.00	665964.00	1522.90	FFFFTTFFFFFFFFFF	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.r512-smll-171654407300276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Peterson-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 110K Apr 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 458K Apr 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 47K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 173K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 733K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 289K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K May 18 16:43 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 Peterson-PT-5-LTLFireability-00
FORMULA_NAME Peterson-PT-5-LTLFireability-01
FORMULA_NAME Peterson-PT-5-LTLFireability-02
FORMULA_NAME Peterson-PT-5-LTLFireability-03
FORMULA_NAME Peterson-PT-5-LTLFireability-04
FORMULA_NAME Peterson-PT-5-LTLFireability-05
FORMULA_NAME Peterson-PT-5-LTLFireability-06
FORMULA_NAME Peterson-PT-5-LTLFireability-07
FORMULA_NAME Peterson-PT-5-LTLFireability-08
FORMULA_NAME Peterson-PT-5-LTLFireability-09
FORMULA_NAME Peterson-PT-5-LTLFireability-10
FORMULA_NAME Peterson-PT-5-LTLFireability-11
FORMULA_NAME Peterson-PT-5-LTLFireability-12
FORMULA_NAME Peterson-PT-5-LTLFireability-13
FORMULA_NAME Peterson-PT-5-LTLFireability-14
FORMULA_NAME Peterson-PT-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717272784312

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:13:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:13:06] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-06-01 20:13:06] [INFO ] Transformed 834 places.
[2024-06-01 20:13:07] [INFO ] Transformed 1242 transitions.
[2024-06-01 20:13:07] [INFO ] Found NUPN structural information;
[2024-06-01 20:13:07] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 565 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-5-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 685 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 50 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:13:07] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:13:07] [INFO ] Computed 23 invariants in 42 ms
[2024-06-01 20:13:08] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-06-01 20:13:08] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:13:08] [INFO ] Invariant cache hit.
[2024-06-01 20:13:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:13:09] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-06-01 20:13:09] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:13:09] [INFO ] Invariant cache hit.
[2024-06-01 20:13:09] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
SMT process timed out in 30780ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30836ms
Finished structural reductions in LTL mode , in 1 iterations and 32677 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 685 out of 834 places after structural reductions.
[2024-06-01 20:13:41] [INFO ] Flatten gal took : 328 ms
[2024-06-01 20:13:41] [INFO ] Flatten gal took : 180 ms
[2024-06-01 20:13:41] [INFO ] Input system was already deterministic with 1242 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (8 resets) in 3159 ms. (12 steps per ms) remains 7/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
[2024-06-01 20:13:43] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:13:43] [INFO ] Invariant cache hit.
[2024-06-01 20:13:43] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 769/807 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/807 variables, 769/818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/810 variables, 3/821 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 3/824 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:44] [INFO ] Deduced a trap composed of 139 places in 410 ms of which 61 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 142 places in 854 ms of which 13 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 157 places in 575 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 3/827 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:46] [INFO ] Deduced a trap composed of 119 places in 723 ms of which 11 ms to minimize.
[2024-06-01 20:13:47] [INFO ] Deduced a trap composed of 93 places in 675 ms of which 9 ms to minimize.
[2024-06-01 20:13:47] [INFO ] Deduced a trap composed of 101 places in 614 ms of which 7 ms to minimize.
[2024-06-01 20:13:48] [INFO ] Deduced a trap composed of 97 places in 643 ms of which 8 ms to minimize.
SMT process timed out in 5555ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 834 transition count 896
Reduce places removed 346 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 348 rules applied. Total rules applied 694 place count 488 transition count 894
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 696 place count 486 transition count 894
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 696 place count 486 transition count 712
Deduced a syphon composed of 182 places in 1 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1060 place count 304 transition count 712
Applied a total of 1060 rules in 190 ms. Remains 304 /834 variables (removed 530) and now considering 712/1242 (removed 530) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 304/834 places, 712/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 608 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 434581 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 7
Probabilistic random walk after 434581 steps, saw 64268 distinct states, run finished after 3020 ms. (steps per millisecond=143 ) properties seen :0
[2024-06-01 20:13:52] [INFO ] Flow matrix only has 592 transitions (discarded 120 similar events)
// Phase 1: matrix 592 rows 304 cols
[2024-06-01 20:13:52] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 20:13:52] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 238/276 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 238/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 5/281 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 5 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/286 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 3 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 7/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:13:55] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 592/878 variables, 286/605 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/878 variables, 205/810 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/878 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 18/896 variables, 18/828 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/896 variables, 18/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/896 variables, 3/849 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/896 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 0/896 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 896/896 variables, and 849 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3998 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 304/304 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 238/276 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 238/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/281 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/286 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 11/319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 4 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/286 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 592/878 variables, 286/610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/878 variables, 205/815 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/878 variables, 7/822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:13:58] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:14:00] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:14:00] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:14:00] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:14:00] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:14:01] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:14:01] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:14:01] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/878 variables, 14/836 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:14:02] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 4 ms to minimize.
[2024-06-01 20:14:02] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:14:02] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:14:02] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/878 variables, 4/840 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/878 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 18/896 variables, 18/858 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/896 variables, 18/876 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/896 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:14:03] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 4 ms to minimize.
[2024-06-01 20:14:04] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 4 ms to minimize.
[2024-06-01 20:14:04] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:14:04] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:14:05] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 5 ms to minimize.
[2024-06-01 20:14:05] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 4 ms to minimize.
[2024-06-01 20:14:06] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 5 ms to minimize.
[2024-06-01 20:14:06] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:14:06] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 4 ms to minimize.
[2024-06-01 20:14:07] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:14:07] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:14:07] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 5 ms to minimize.
[2024-06-01 20:14:08] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:14:08] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 8 ms to minimize.
[2024-06-01 20:14:08] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 4 ms to minimize.
[2024-06-01 20:14:09] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:14:09] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 5 ms to minimize.
[2024-06-01 20:14:09] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 4 ms to minimize.
[2024-06-01 20:14:10] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 5 ms to minimize.
[2024-06-01 20:14:10] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 5 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/896 variables, 20/899 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:14:11] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 5 ms to minimize.
[2024-06-01 20:14:11] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 4 ms to minimize.
[2024-06-01 20:14:11] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:14:12] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:14:12] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:14:12] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 4 ms to minimize.
[2024-06-01 20:14:13] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:14:13] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:14:13] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:14:14] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/896 variables, 10/909 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/896 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/896 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 896/896 variables, and 909 constraints, problems are : Problem set: 0 solved, 7 unsolved in 20419 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 304/304 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 66/66 constraints]
After SMT, in 24464ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 2695 ms.
Support contains 10 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 712/712 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 707
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 299 transition count 707
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 66 place count 271 transition count 679
Applied a total of 66 rules in 75 ms. Remains 271 /304 variables (removed 33) and now considering 679/712 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 271/304 places, 679/712 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 560042 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 6
Probabilistic random walk after 560042 steps, saw 83463 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-06-01 20:14:23] [INFO ] Flow matrix only has 559 transitions (discarded 120 similar events)
// Phase 1: matrix 559 rows 271 cols
[2024-06-01 20:14:23] [INFO ] Computed 23 invariants in 13 ms
[2024-06-01 20:14:23] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 196/206 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 196/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:23] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/210 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/214 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:23] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 4 ms to minimize.
[2024-06-01 20:14:24] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:14:24] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:14:24] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:14:24] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:14:24] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 4 ms to minimize.
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 477/691 variables, 214/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/691 variables, 150/611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:27] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/691 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/691 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 56/747 variables, 22/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/747 variables, 22/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/747 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/747 variables, 13/672 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/747 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 33/780 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/780 variables, 33/706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/780 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 1/781 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/781 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/781 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 1/782 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/782 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/782 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 48/830 variables, 35/745 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/830 variables, 42/787 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/830 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 0/830 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 787 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6019 ms.
Refiners :[Domain max(s): 271/271 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 271/271 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 196/206 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 196/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/210 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/214 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 14/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:29] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 3 ms to minimize.
[2024-06-01 20:14:29] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:14:30] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:14:30] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:30] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:14:30] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 477/691 variables, 214/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/691 variables, 150/618 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/691 variables, 5/623 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/691 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 56/747 variables, 22/645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/747 variables, 22/667 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/747 variables, 3/670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/747 variables, 13/683 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:31] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 4 ms to minimize.
[2024-06-01 20:14:31] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 3 ms to minimize.
[2024-06-01 20:14:31] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/747 variables, 3/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/747 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 33/780 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/780 variables, 33/720 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:32] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:14:32] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:14:32] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 4 ms to minimize.
[2024-06-01 20:14:33] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/780 variables, 4/724 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:33] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/780 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:34] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:14:34] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:14:34] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:14:34] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:14:34] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/780 variables, 5/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/780 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 1/781 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/781 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/781 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/781 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 1/782 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/782 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:36] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:14:36] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 4 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/782 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:36] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2024-06-01 20:14:37] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 3 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/782 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:37] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:14:37] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:14:38] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 4 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/782 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/782 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 48/830 variables, 35/777 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/830 variables, 42/819 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/830 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (OVERLAPS) 0/830 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 819 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9998 ms.
Refiners :[Domain max(s): 271/271 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 271/271 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 43/43 constraints]
After SMT, in 16057ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2602 ms.
Support contains 10 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 679/679 transitions.
Applied a total of 0 rules in 23 ms. Remains 271 /271 variables (removed 0) and now considering 679/679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 271/271 places, 679/679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 679/679 transitions.
Applied a total of 0 rules in 20 ms. Remains 271 /271 variables (removed 0) and now considering 679/679 (removed 0) transitions.
[2024-06-01 20:14:41] [INFO ] Flow matrix only has 559 transitions (discarded 120 similar events)
[2024-06-01 20:14:41] [INFO ] Invariant cache hit.
[2024-06-01 20:14:42] [INFO ] Implicit Places using invariants in 617 ms returned [234, 246, 247, 248, 249, 250]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 622 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 265/271 places, 679/679 transitions.
Applied a total of 0 rules in 33 ms. Remains 265 /265 variables (removed 0) and now considering 679/679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 675 ms. Remains : 265/271 places, 679/679 transitions.
RANDOM walk for 40000 steps (8 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 597709 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 6
Probabilistic random walk after 597709 steps, saw 88307 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2024-06-01 20:14:45] [INFO ] Flow matrix only has 559 transitions (discarded 120 similar events)
// Phase 1: matrix 559 rows 265 cols
[2024-06-01 20:14:45] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 20:14:45] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 195/205 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 195/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:46] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 4 ms to minimize.
[2024-06-01 20:14:46] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:14:46] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:14:46] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:14:46] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:14:46] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:14:47] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:14:47] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:14:47] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:14:47] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:14:47] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:14:47] [INFO ] Deduced a trap composed of 71 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/209 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 5 ms to minimize.
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:14:51] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 477/686 variables, 209/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 150/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 56/742 variables, 22/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/742 variables, 22/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/742 variables, 3/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/742 variables, 13/669 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/742 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/742 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/742 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 33/775 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/775 variables, 33/705 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:53] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:14:53] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:14:53] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:14:53] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:14:54] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/775 variables, 5/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/775 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 1/776 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/776 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:54] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:14:54] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/776 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/776 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (OVERLAPS) 48/824 variables, 34/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/824 variables, 42/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/824 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 0/824 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 790 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9820 ms.
Refiners :[Domain max(s): 265/265 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 265/265 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 195/205 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 195/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 29/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:56] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:14:56] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/209 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 477/686 variables, 209/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 150/611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 5/616 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:56] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 56/742 variables, 22/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/742 variables, 22/661 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/742 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/742 variables, 13/677 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/742 variables, 4/681 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:57] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 4 ms to minimize.
[2024-06-01 20:14:57] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:14:58] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:14:58] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:14:58] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/742 variables, 5/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/742 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 33/775 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/775 variables, 33/720 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/775 variables, 5/725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:14:59] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2024-06-01 20:14:59] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 4 ms to minimize.
[2024-06-01 20:14:59] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 4 ms to minimize.
[2024-06-01 20:15:00] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:15:00] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 4 ms to minimize.
[2024-06-01 20:15:00] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:15:00] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:15:01] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:15:01] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:15:01] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:15:02] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:15:02] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:15:02] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 5 ms to minimize.
[2024-06-01 20:15:02] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:15:03] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:15:03] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 4 ms to minimize.
[2024-06-01 20:15:03] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:15:04] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 4 ms to minimize.
[2024-06-01 20:15:04] [INFO ] Deduced a trap composed of 49 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:15:04] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 4 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/775 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:04] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:15:05] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:15:05] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 2 ms to minimize.
[2024-06-01 20:15:05] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:15:05] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:15:06] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 4 ms to minimize.
[2024-06-01 20:15:06] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:15:06] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:15:06] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:15:07] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:15:07] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:15:07] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:15:07] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/775 variables, 13/758 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:08] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:15:08] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:15:08] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:15:09] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:15:09] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 3 ms to minimize.
[2024-06-01 20:15:09] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:15:10] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:15:10] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 3 ms to minimize.
[2024-06-01 20:15:10] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:15:10] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/775 variables, 10/768 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:11] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 2 ms to minimize.
[2024-06-01 20:15:11] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:15:11] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:15:11] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/775 variables, 4/772 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:12] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:15:12] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:15:12] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 4 ms to minimize.
[2024-06-01 20:15:12] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/775 variables, 4/776 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:13] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:15:13] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:15:14] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 4 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/775 variables, 3/779 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:14] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:15:15] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 4 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/775 variables, 2/781 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/775 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 1/776 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/776 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/776 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:16] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 3 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/776 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:16] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:15:17] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 4 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/776 variables, 2/787 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/776 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 48/824 variables, 34/821 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/824 variables, 42/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:15:18] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 4 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/824 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/824 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 0/824 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 864 constraints, problems are : Problem set: 0 solved, 6 unsolved in 24136 ms.
Refiners :[Domain max(s): 265/265 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 265/265 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 106/106 constraints]
After SMT, in 33978ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3209 ms.
Support contains 10 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 679/679 transitions.
Applied a total of 0 rules in 15 ms. Remains 265 /265 variables (removed 0) and now considering 679/679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 265/265 places, 679/679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 679/679 transitions.
Applied a total of 0 rules in 14 ms. Remains 265 /265 variables (removed 0) and now considering 679/679 (removed 0) transitions.
[2024-06-01 20:15:23] [INFO ] Flow matrix only has 559 transitions (discarded 120 similar events)
[2024-06-01 20:15:23] [INFO ] Invariant cache hit.
[2024-06-01 20:15:23] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 20:15:23] [INFO ] Flow matrix only has 559 transitions (discarded 120 similar events)
[2024-06-01 20:15:23] [INFO ] Invariant cache hit.
[2024-06-01 20:15:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:15:24] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2024-06-01 20:15:24] [INFO ] Redundant transitions in 70 ms returned []
Running 673 sub problems to find dead transitions.
[2024-06-01 20:15:24] [INFO ] Flow matrix only has 559 transitions (discarded 120 similar events)
[2024-06-01 20:15:24] [INFO ] Invariant cache hit.
[2024-06-01 20:15:24] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 265/265 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 17/282 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-01 20:15:32] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 5 ms to minimize.
[2024-06-01 20:15:32] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 4 ms to minimize.
[2024-06-01 20:15:32] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:15:32] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 5 ms to minimize.
[2024-06-01 20:15:33] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 5 ms to minimize.
[2024-06-01 20:15:33] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:15:33] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 4 ms to minimize.
[2024-06-01 20:15:33] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 4 ms to minimize.
[2024-06-01 20:15:34] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 4 ms to minimize.
[2024-06-01 20:15:34] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:15:34] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 4 ms to minimize.
[2024-06-01 20:15:34] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:15:35] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:15:35] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:15:35] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:15:35] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:15:36] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 3 ms to minimize.
[2024-06-01 20:15:36] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:15:36] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:15:36] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-01 20:15:37] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 5 ms to minimize.
[2024-06-01 20:15:37] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:15:38] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 4 ms to minimize.
[2024-06-01 20:15:38] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 5 ms to minimize.
[2024-06-01 20:15:38] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 5 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 5 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 5 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 16 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 3 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:15:41] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:15:41] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:15:41] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-01 20:15:49] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:15:49] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 4 ms to minimize.
[2024-06-01 20:15:50] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:15:50] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 3 ms to minimize.
[2024-06-01 20:15:50] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:15:50] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:15:51] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:15:51] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-06-01 20:15:51] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:15:51] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:15:51] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:15:52] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:15:52] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:15:52] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:15:52] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:15:53] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 4 ms to minimize.
[2024-06-01 20:15:53] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:15:53] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:15:53] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:15:53] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-01 20:15:55] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 4 ms to minimize.
SMT process timed out in 30345ms, After SMT, problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 30360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32127 ms. Remains : 265/265 places, 679/679 transitions.
FORMULA Peterson-PT-5-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Peterson-PT-5-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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)) U (X(G(p0)) U p1)))'
Support contains 240 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 834 transition count 1036
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 628 transition count 1036
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 412 place count 628 transition count 876
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 732 place count 468 transition count 876
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 744 place count 462 transition count 870
Applied a total of 744 rules in 102 ms. Remains 462 /834 variables (removed 372) and now considering 870/1242 (removed 372) transitions.
[2024-06-01 20:15:55] [INFO ] Flow matrix only has 750 transitions (discarded 120 similar events)
// Phase 1: matrix 750 rows 462 cols
[2024-06-01 20:15:55] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 20:15:56] [INFO ] Implicit Places using invariants in 401 ms returned [418, 438, 439, 440, 441, 442]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 404 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/834 places, 870/1242 transitions.
Applied a total of 0 rules in 27 ms. Remains 456 /456 variables (removed 0) and now considering 870/870 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 535 ms. Remains : 456/834 places, 870/1242 transitions.
Stuttering acceptance computed with spot in 457 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-00
Product exploration explored 100000 steps with 11351 reset in 1756 ms.
Stack based approach found an accepted trace after 1099 steps with 138 reset with depth 14 and stack size 14 in 18 ms.
FORMULA Peterson-PT-5-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-00 finished in 2893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 24 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1044 place count 312 transition count 720
Applied a total of 1044 rules in 53 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2024-06-01 20:15:58] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2024-06-01 20:15:58] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 20:15:58] [INFO ] Implicit Places using invariants in 366 ms returned [268, 288, 289, 290, 291, 292]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 369 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/834 places, 720/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 306 /306 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 437 ms. Remains : 306/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-01
Product exploration explored 100000 steps with 8444 reset in 481 ms.
Stack based approach found an accepted trace after 65 steps with 5 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-01 finished in 1033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((F(!p0) U p1)&&X(G(p2)))))))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:15:59] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:15:59] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 20:16:00] [INFO ] Implicit Places using invariants in 635 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 638 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 664 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-02
Product exploration explored 100000 steps with 2 reset in 1831 ms.
Product exploration explored 100000 steps with 3 reset in 1728 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 p0) p2), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 676 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 7
RANDOM walk for 40000 steps (8 resets) in 755 ms. (52 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 724 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
[2024-06-01 20:16:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 20:16:05] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 20:16:05] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 612/792 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 612/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/798 variables, 6/804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 6/810 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1122/1920 variables, 798/1608 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1920 variables, 205/1813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1920 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 30/1950 variables, 30/1843 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1950 variables, 30/1873 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1950 variables, 5/1878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1950 variables, 0/1878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1950 variables, 0/1878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1878 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4010 ms.
Refiners :[Domain max(s): 828/828 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 612/792 variables, 6/186 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 612/798 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:16:11] [INFO ] Deduced a trap composed of 139 places in 766 ms of which 9 ms to minimize.
[2024-06-01 20:16:11] [INFO ] Deduced a trap composed of 191 places in 417 ms of which 6 ms to minimize.
[2024-06-01 20:16:12] [INFO ] Deduced a trap composed of 99 places in 783 ms of which 10 ms to minimize.
[2024-06-01 20:16:13] [INFO ] Deduced a trap composed of 99 places in 603 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 4/802 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:16:13] [INFO ] Deduced a trap composed of 79 places in 566 ms of which 8 ms to minimize.
[2024-06-01 20:16:14] [INFO ] Deduced a trap composed of 119 places in 784 ms of which 10 ms to minimize.
[2024-06-01 20:16:15] [INFO ] Deduced a trap composed of 199 places in 288 ms of which 4 ms to minimize.
SMT process timed out in 9253ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 828 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 753 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 753 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 593 transition count 1007
Applied a total of 470 rules in 88 ms. Remains 593 /828 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 593/828 places, 1007/1242 transitions.
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (8 resets) in 467 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 266371 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 266371 steps, saw 139193 distinct states, run finished after 3009 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 20:16:18] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-06-01 20:16:18] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 20:16:18] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 377/557 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 377/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/563 variables, 6/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/1343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/1480 variables, 30/1373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 30/1403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/1408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1480 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 1408 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1191 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 377/557 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 377/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:16:20] [INFO ] Deduced a trap composed of 54 places in 617 ms of which 9 ms to minimize.
[2024-06-01 20:16:21] [INFO ] Deduced a trap composed of 129 places in 555 ms of which 8 ms to minimize.
[2024-06-01 20:16:21] [INFO ] Deduced a trap composed of 84 places in 546 ms of which 7 ms to minimize.
[2024-06-01 20:16:22] [INFO ] Deduced a trap composed of 99 places in 415 ms of which 6 ms to minimize.
[2024-06-01 20:16:22] [INFO ] Deduced a trap composed of 69 places in 300 ms of which 5 ms to minimize.
[2024-06-01 20:16:22] [INFO ] Deduced a trap composed of 114 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 6/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/563 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 6/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 887/1450 variables, 563/1144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 205/1349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 2/1351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1450 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 30/1480 variables, 30/1381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 30/1411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 5/1416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:16:25] [INFO ] Deduced a trap composed of 11 places in 424 ms of which 8 ms to minimize.
[2024-06-01 20:16:26] [INFO ] Deduced a trap composed of 77 places in 475 ms of which 7 ms to minimize.
[2024-06-01 20:16:26] [INFO ] Deduced a trap composed of 47 places in 373 ms of which 7 ms to minimize.
[2024-06-01 20:16:27] [INFO ] Deduced a trap composed of 50 places in 424 ms of which 6 ms to minimize.
[2024-06-01 20:16:27] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 6 ms to minimize.
[2024-06-01 20:16:27] [INFO ] Deduced a trap composed of 26 places in 448 ms of which 7 ms to minimize.
[2024-06-01 20:16:28] [INFO ] Deduced a trap composed of 65 places in 448 ms of which 6 ms to minimize.
[2024-06-01 20:16:28] [INFO ] Deduced a trap composed of 29 places in 407 ms of which 6 ms to minimize.
[2024-06-01 20:16:29] [INFO ] Deduced a trap composed of 29 places in 410 ms of which 6 ms to minimize.
[2024-06-01 20:16:29] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:16:30] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 6 ms to minimize.
[2024-06-01 20:16:30] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 6 ms to minimize.
[2024-06-01 20:16:31] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 7 ms to minimize.
[2024-06-01 20:16:31] [INFO ] Deduced a trap composed of 20 places in 450 ms of which 7 ms to minimize.
[2024-06-01 20:16:32] [INFO ] Deduced a trap composed of 70 places in 320 ms of which 5 ms to minimize.
[2024-06-01 20:16:32] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:16:32] [INFO ] Deduced a trap composed of 77 places in 304 ms of which 5 ms to minimize.
[2024-06-01 20:16:33] [INFO ] Deduced a trap composed of 70 places in 306 ms of which 5 ms to minimize.
[2024-06-01 20:16:33] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 5 ms to minimize.
[2024-06-01 20:16:33] [INFO ] Deduced a trap composed of 70 places in 309 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1480 variables, 20/1436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:16:34] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:16:35] [INFO ] Deduced a trap composed of 70 places in 301 ms of which 5 ms to minimize.
[2024-06-01 20:16:36] [INFO ] Deduced a trap composed of 17 places in 389 ms of which 6 ms to minimize.
[2024-06-01 20:16:36] [INFO ] Deduced a trap composed of 51 places in 355 ms of which 6 ms to minimize.
[2024-06-01 20:16:36] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 5 ms to minimize.
[2024-06-01 20:16:37] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 5 ms to minimize.
[2024-06-01 20:16:37] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 5 ms to minimize.
[2024-06-01 20:16:37] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 5 ms to minimize.
[2024-06-01 20:16:37] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:16:38] [INFO ] Deduced a trap composed of 80 places in 191 ms of which 4 ms to minimize.
[2024-06-01 20:16:38] [INFO ] Deduced a trap composed of 93 places in 239 ms of which 4 ms to minimize.
[2024-06-01 20:16:38] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 4 ms to minimize.
[2024-06-01 20:16:39] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:16:39] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 5 ms to minimize.
[2024-06-01 20:16:40] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:16:40] [INFO ] Deduced a trap composed of 59 places in 306 ms of which 5 ms to minimize.
[2024-06-01 20:16:41] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:16:42] [INFO ] Deduced a trap composed of 32 places in 536 ms of which 8 ms to minimize.
[2024-06-01 20:16:43] [INFO ] Deduced a trap composed of 53 places in 498 ms of which 7 ms to minimize.
[2024-06-01 20:16:44] [INFO ] Deduced a trap composed of 11 places in 590 ms of which 8 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1480 variables, 20/1456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:16:45] [INFO ] Deduced a trap composed of 94 places in 465 ms of which 12 ms to minimize.
[2024-06-01 20:16:45] [INFO ] Deduced a trap composed of 39 places in 513 ms of which 7 ms to minimize.
[2024-06-01 20:16:46] [INFO ] Deduced a trap composed of 39 places in 418 ms of which 7 ms to minimize.
[2024-06-01 20:16:47] [INFO ] Deduced a trap composed of 45 places in 529 ms of which 7 ms to minimize.
[2024-06-01 20:16:48] [INFO ] Deduced a trap composed of 11 places in 542 ms of which 8 ms to minimize.
[2024-06-01 20:16:48] [INFO ] Deduced a trap composed of 65 places in 424 ms of which 6 ms to minimize.
[2024-06-01 20:16:49] [INFO ] Deduced a trap composed of 68 places in 469 ms of which 6 ms to minimize.
[2024-06-01 20:16:49] [INFO ] Deduced a trap composed of 65 places in 483 ms of which 6 ms to minimize.
[2024-06-01 20:16:50] [INFO ] Deduced a trap composed of 65 places in 470 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1480 variables, 9/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:16:51] [INFO ] Deduced a trap composed of 47 places in 500 ms of which 8 ms to minimize.
[2024-06-01 20:16:52] [INFO ] Deduced a trap composed of 129 places in 556 ms of which 7 ms to minimize.
[2024-06-01 20:16:52] [INFO ] Deduced a trap composed of 45 places in 498 ms of which 7 ms to minimize.
[2024-06-01 20:16:53] [INFO ] Deduced a trap composed of 83 places in 440 ms of which 4 ms to minimize.
[2024-06-01 20:16:53] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:16:54] [INFO ] Deduced a trap composed of 53 places in 463 ms of which 6 ms to minimize.
[2024-06-01 20:16:54] [INFO ] Deduced a trap composed of 83 places in 464 ms of which 7 ms to minimize.
[2024-06-01 20:16:55] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 5 ms to minimize.
[2024-06-01 20:16:55] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 5 ms to minimize.
[2024-06-01 20:16:55] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1480 variables, 10/1475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:16:57] [INFO ] Deduced a trap composed of 29 places in 458 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1480 variables, 1/1476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1480 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1480 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 1476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40066 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 66/66 constraints]
After SMT, in 41313ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 258 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 30 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 16 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 20:17:00] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 20:17:00] [INFO ] Invariant cache hit.
[2024-06-01 20:17:00] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-01 20:17:00] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 20:17:00] [INFO ] Invariant cache hit.
[2024-06-01 20:17:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:17:02] [INFO ] Implicit Places using invariants and state equation in 2038 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
[2024-06-01 20:17:02] [INFO ] Redundant transitions in 18 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-06-01 20:17:02] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 20:17:02] [INFO ] Invariant cache hit.
[2024-06-01 20:17:02] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 593/593 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 17/610 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 20:17:15] [INFO ] Deduced a trap composed of 29 places in 363 ms of which 6 ms to minimize.
[2024-06-01 20:17:16] [INFO ] Deduced a trap composed of 20 places in 398 ms of which 5 ms to minimize.
[2024-06-01 20:17:16] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 6 ms to minimize.
[2024-06-01 20:17:16] [INFO ] Deduced a trap composed of 56 places in 359 ms of which 5 ms to minimize.
[2024-06-01 20:17:17] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 5 ms to minimize.
[2024-06-01 20:17:17] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 5 ms to minimize.
[2024-06-01 20:17:18] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 5 ms to minimize.
[2024-06-01 20:17:18] [INFO ] Deduced a trap composed of 66 places in 378 ms of which 5 ms to minimize.
[2024-06-01 20:17:18] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:17:19] [INFO ] Deduced a trap composed of 95 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:17:19] [INFO ] Deduced a trap composed of 106 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:17:19] [INFO ] Deduced a trap composed of 92 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:17:19] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:17:20] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:17:20] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 3 ms to minimize.
[2024-06-01 20:17:20] [INFO ] Deduced a trap composed of 77 places in 252 ms of which 3 ms to minimize.
[2024-06-01 20:17:20] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:17:21] [INFO ] Deduced a trap composed of 146 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:17:21] [INFO ] Deduced a trap composed of 92 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:17:21] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/630 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 20:17:22] [INFO ] Deduced a trap composed of 35 places in 403 ms of which 6 ms to minimize.
[2024-06-01 20:17:23] [INFO ] Deduced a trap composed of 110 places in 436 ms of which 5 ms to minimize.
[2024-06-01 20:17:23] [INFO ] Deduced a trap composed of 92 places in 404 ms of which 5 ms to minimize.
[2024-06-01 20:17:24] [INFO ] Deduced a trap composed of 89 places in 403 ms of which 5 ms to minimize.
[2024-06-01 20:17:24] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 5 ms to minimize.
[2024-06-01 20:17:24] [INFO ] Deduced a trap composed of 23 places in 409 ms of which 5 ms to minimize.
[2024-06-01 20:17:25] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 5 ms to minimize.
[2024-06-01 20:17:25] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 4 ms to minimize.
[2024-06-01 20:17:26] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 5 ms to minimize.
[2024-06-01 20:17:26] [INFO ] Deduced a trap composed of 35 places in 381 ms of which 5 ms to minimize.
[2024-06-01 20:17:26] [INFO ] Deduced a trap composed of 32 places in 395 ms of which 5 ms to minimize.
[2024-06-01 20:17:27] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 5 ms to minimize.
[2024-06-01 20:17:27] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 5 ms to minimize.
[2024-06-01 20:17:28] [INFO ] Deduced a trap composed of 75 places in 412 ms of which 5 ms to minimize.
[2024-06-01 20:17:28] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 5 ms to minimize.
[2024-06-01 20:17:29] [INFO ] Deduced a trap composed of 59 places in 388 ms of which 5 ms to minimize.
[2024-06-01 20:17:29] [INFO ] Deduced a trap composed of 56 places in 357 ms of which 6 ms to minimize.
[2024-06-01 20:17:29] [INFO ] Deduced a trap composed of 57 places in 358 ms of which 5 ms to minimize.
[2024-06-01 20:17:30] [INFO ] Deduced a trap composed of 75 places in 363 ms of which 5 ms to minimize.
[2024-06-01 20:17:30] [INFO ] Deduced a trap composed of 47 places in 370 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/650 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1480 variables, and 650 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30034 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/593 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1001/1001 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1001 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 593/593 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 17/610 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 40/650 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 20:17:35] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 4 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 4 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 106 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:17:37] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:17:37] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:17:37] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:17:37] [INFO ] Deduced a trap composed of 48 places in 305 ms of which 5 ms to minimize.
[2024-06-01 20:17:38] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:17:38] [INFO ] Deduced a trap composed of 61 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:17:38] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:17:38] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:17:39] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:17:39] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:17:39] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 3 ms to minimize.
[2024-06-01 20:17:39] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:17:40] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:17:40] [INFO ] Deduced a trap composed of 114 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:17:40] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/670 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 56 places in 366 ms of which 5 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 35 places in 307 ms of which 4 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 41 places in 325 ms of which 5 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 5 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 5 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 56 places in 320 ms of which 4 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 99 places in 228 ms of which 4 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 92 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 99 places in 222 ms of which 4 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 4 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 99 places in 331 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 20/690 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 20:17:54] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 5 ms to minimize.
[2024-06-01 20:17:55] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:17:55] [INFO ] Deduced a trap composed of 132 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:17:55] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:17:55] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 4 ms to minimize.
[2024-06-01 20:17:56] [INFO ] Deduced a trap composed of 14 places in 321 ms of which 4 ms to minimize.
[2024-06-01 20:17:56] [INFO ] Deduced a trap composed of 46 places in 433 ms of which 5 ms to minimize.
[2024-06-01 20:17:57] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 5 ms to minimize.
[2024-06-01 20:17:57] [INFO ] Deduced a trap composed of 57 places in 365 ms of which 5 ms to minimize.
[2024-06-01 20:17:58] [INFO ] Deduced a trap composed of 54 places in 253 ms of which 5 ms to minimize.
[2024-06-01 20:17:58] [INFO ] Deduced a trap composed of 61 places in 360 ms of which 5 ms to minimize.
[2024-06-01 20:17:59] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 8 ms to minimize.
[2024-06-01 20:17:59] [INFO ] Deduced a trap composed of 87 places in 353 ms of which 4 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 80 places in 339 ms of which 5 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 99 places in 345 ms of which 5 ms to minimize.
[2024-06-01 20:18:01] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 6 ms to minimize.
[2024-06-01 20:18:01] [INFO ] Deduced a trap composed of 114 places in 481 ms of which 8 ms to minimize.
[2024-06-01 20:18:01] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:18:02] [INFO ] Deduced a trap composed of 166 places in 275 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 20/710 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1480 variables, and 710 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30033 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/593 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/1001 constraints, Known Traps: 100/100 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62897 ms. Remains : 593/593 places, 1007/1007 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (G (OR p2 p1 (NOT p0))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
[2024-06-01 20:18:03] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 20:18:03] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 20:18:05] [INFO ] [Real]Absence check using 17 positive place invariants in 47 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (G (OR p2 p1 (NOT p0))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-5-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLFireability-02 finished in 126041 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(p0))||G(!p1)||(!p1&&F(G(!p2))))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:18:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:18:05] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 20:18:05] [INFO ] Implicit Places using invariants in 421 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 423 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 452 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND p1 (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-03
Product exploration explored 100000 steps with 117 reset in 337 ms.
Product exploration explored 100000 steps with 121 reset in 365 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 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p1 (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
RANDOM walk for 4172 steps (0 resets) in 56 ms. (73 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p2), (F p1), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND p1 (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 102 ms :[(AND p1 (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 192 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 828 transition count 1117
Reduce places removed 125 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 155 rules applied. Total rules applied 280 place count 703 transition count 1087
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 310 place count 673 transition count 1087
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 174 Pre rules applied. Total rules applied 310 place count 673 transition count 913
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 658 place count 499 transition count 913
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 708 place count 474 transition count 888
Applied a total of 708 rules in 62 ms. Remains 474 /828 variables (removed 354) and now considering 888/1242 (removed 354) transitions.
[2024-06-01 20:18:07] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 474 cols
[2024-06-01 20:18:07] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 20:18:08] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 20:18:08] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 20:18:08] [INFO ] Invariant cache hit.
[2024-06-01 20:18:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:18:08] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2024-06-01 20:18:08] [INFO ] Redundant transitions in 10 ms returned []
Running 882 sub problems to find dead transitions.
[2024-06-01 20:18:09] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 20:18:09] [INFO ] Invariant cache hit.
[2024-06-01 20:18:09] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 474/474 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 17/491 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 20:18:18] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 5 ms to minimize.
[2024-06-01 20:18:18] [INFO ] Deduced a trap composed of 88 places in 346 ms of which 4 ms to minimize.
[2024-06-01 20:18:18] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 4 ms to minimize.
[2024-06-01 20:18:19] [INFO ] Deduced a trap composed of 63 places in 327 ms of which 4 ms to minimize.
[2024-06-01 20:18:19] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 5 ms to minimize.
[2024-06-01 20:18:19] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 4 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 4 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 4 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 4 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:18:25] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:18:25] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 4 ms to minimize.
[2024-06-01 20:18:25] [INFO ] Deduced a trap composed of 54 places in 307 ms of which 4 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 5 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 58 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 4 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 3 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 3 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:18:29] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:18:29] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 20/531 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 3 ms to minimize.
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:18:39] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:18:39] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
SMT process timed out in 30363ms, After SMT, problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 30375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 474/828 places, 888/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31567 ms. Remains : 474/828 places, 888/1242 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 p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 166 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND p1 p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
RANDOM walk for 1267 steps (0 resets) in 33 ms. (37 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) (NOT p1) p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 13 factoid took 413 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND p1 p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND p1 p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(AND p1 p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Product exploration explored 100000 steps with 220 reset in 399 ms.
Stack based approach found an accepted trace after 2762 steps with 8 reset with depth 292 and stack size 286 in 13 ms.
FORMULA Peterson-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-03 finished in 35545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 18 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:18:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:18:41] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 20:18:41] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 20:18:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:18:41] [INFO ] Invariant cache hit.
[2024-06-01 20:18:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:18:44] [INFO ] Implicit Places using invariants and state equation in 3273 ms returned []
Implicit Place search using SMT with State Equation took 3850 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-06-01 20:18:44] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:18:44] [INFO ] Invariant cache hit.
[2024-06-01 20:18:44] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1956 variables, and 839 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30026 ms.
Refiners :[Domain max(s): 828/834 constraints, Positive P Invariants (semi-flows): 7/17 constraints, Generalized P Invariants (flows): 2/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 20:19:30] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:19:31] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:19:32] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:19:32] [INFO ] Deduced a trap composed of 126 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:19:33] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-06-01 20:19:34] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:19:36] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 7/846 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1956 variables, and 846 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30024 ms.
Refiners :[Domain max(s): 828/834 constraints, Positive P Invariants (semi-flows): 7/17 constraints, Generalized P Invariants (flows): 2/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 9/9 constraints]
After SMT, in 60377ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Finished structural reductions in LTL mode , in 1 iterations and 64261 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Product exploration explored 100000 steps with 50000 reset in 406 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 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-5-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLFireability-04 finished in 65303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:19:46] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:19:46] [INFO ] Invariant cache hit.
[2024-06-01 20:19:46] [INFO ] Implicit Places using invariants in 630 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 632 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 653 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-07 finished in 752 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 U X(!p0)))||(!p0 U (X(p1) U p2))))'
Support contains 4 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:19:47] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:19:47] [INFO ] Invariant cache hit.
[2024-06-01 20:19:47] [INFO ] Implicit Places using invariants in 598 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 600 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (AND p0 (NOT p2)), p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-09
Product exploration explored 100000 steps with 169 reset in 217 ms.
Stack based approach found an accepted trace after 1028 steps with 2 reset with depth 359 and stack size 359 in 4 ms.
FORMULA Peterson-PT-5-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-09 finished in 1219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:19:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:19:48] [INFO ] Invariant cache hit.
[2024-06-01 20:19:48] [INFO ] Implicit Places using invariants in 612 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 614 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 645 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-10 finished in 779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(p2))))'
Support contains 7 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:19:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:19:49] [INFO ] Invariant cache hit.
[2024-06-01 20:19:49] [INFO ] Implicit Places using invariants in 592 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 594 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 628 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 202 ms.
Stack based approach found an accepted trace after 42 steps with 2 reset with depth 39 and stack size 39 in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-11 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 3 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1138 place count 265 transition count 673
Applied a total of 1138 rules in 37 ms. Remains 265 /834 variables (removed 569) and now considering 673/1242 (removed 569) transitions.
[2024-06-01 20:19:50] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 265 cols
[2024-06-01 20:19:50] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:19:50] [INFO ] Implicit Places using invariants in 358 ms returned [229, 241, 242, 243, 244, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 370 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/834 places, 673/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 417 ms. Remains : 259/834 places, 673/1242 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 205 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-13 finished in 750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 36 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2024-06-01 20:19:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2024-06-01 20:19:50] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:19:51] [INFO ] Implicit Places using invariants in 413 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 414 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 204 ms.
Product exploration explored 100000 steps with 0 reset in 248 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 30196 steps (6 resets) in 98 ms. (305 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 20:19:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 20:19:52] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:19:52] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 20:19:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 20:19:52] [INFO ] Invariant cache hit.
[2024-06-01 20:19:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:19:53] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2024-06-01 20:19:53] [INFO ] Redundant transitions in 5 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 20:19:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 20:19:53] [INFO ] Invariant cache hit.
[2024-06-01 20:19:53] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 6 ms to minimize.
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 2 ms to minimize.
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 2 ms to minimize.
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:20:01] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:20:01] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:01] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:20:01] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:20:02] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 2 ms to minimize.
[2024-06-01 20:20:02] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:20:02] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:20:02] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:20:02] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-06-01 20:20:02] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:20:03] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:20:04] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:20:04] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:20:04] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:20:04] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:08] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:20:08] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:20:08] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:20:08] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:20:08] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-06-01 20:20:09] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-06-01 20:20:10] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:20:10] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:20:10] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:20:10] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:20:10] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:20:10] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:11] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:20:11] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:20:11] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:20:11] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:20:12] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:20:13] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:20:13] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:20:13] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:20:13] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:20:13] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:20:13] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:20:13] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:14] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:20:14] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:20:14] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:20:15] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:20:15] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:20:15] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:20:15] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:20:15] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:20:15] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:20:16] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:20:17] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:20:17] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 375 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30019 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 100/375 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:27] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:20:27] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:20:27] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:20:27] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:20:28] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:20:28] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:20:28] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:20:28] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:20:28] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:20:28] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:20:29] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:20:29] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:20:29] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:20:29] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:20:29] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:20:29] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:20:29] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:20:30] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:20:30] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:20:30] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:33] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:20:33] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:20:33] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:20:33] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:20:33] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:20:34] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:20:34] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 3 ms to minimize.
[2024-06-01 20:20:34] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:20:34] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:20:34] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:20:35] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-01 20:20:35] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:20:35] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:20:35] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:20:35] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:20:36] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:20:36] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:20:36] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:20:36] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:20:36] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:41] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:20:41] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:20:41] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:20:41] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:20:41] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:20:41] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:20:42] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:20:42] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:20:42] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:20:42] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:20:42] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:20:42] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:20:42] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:20:43] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:20:43] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-06-01 20:20:44] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:20:44] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:20:45] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:20:45] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:20:45] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:20:50] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:20:50] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:20:50] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:20:51] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:20:51] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-06-01 20:20:52] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:20:53] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/810 variables, and 442 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30020 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 167/167 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61566 ms. Remains : 258/258 places, 672/672 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 34 ms :[(NOT p0)]
RANDOM walk for 20355 steps (4 resets) in 80 ms. (251 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 20:20:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 20:20:54] [INFO ] Invariant cache hit.
[2024-06-01 20:20:54] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-06-01 20:20:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 20:20:55] [INFO ] Invariant cache hit.
[2024-06-01 20:20:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:20:55] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-06-01 20:20:55] [INFO ] Redundant transitions in 5 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 20:20:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 20:20:55] [INFO ] Invariant cache hit.
[2024-06-01 20:20:55] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:00] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:21:00] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-06-01 20:21:00] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:21:01] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:21:01] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:21:01] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:21:01] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:21:01] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:21:01] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:21:02] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:21:02] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:21:02] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:21:02] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:21:02] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:21:02] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:21:02] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:21:03] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:21:03] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:21:03] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:21:03] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:03] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:21:04] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:21:04] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:21:04] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:21:04] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:21:05] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:21:05] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:21:05] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-06-01 20:21:05] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 3 ms to minimize.
[2024-06-01 20:21:05] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:21:05] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:21:05] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:21:06] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:10] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:21:10] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:21:11] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:21:12] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2024-06-01 20:21:12] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:21:12] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:21:12] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:21:12] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:21:12] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:21:12] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-06-01 20:21:13] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:13] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:21:13] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:21:14] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 3 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:21:15] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:16] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:21:17] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:21:17] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:21:17] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:21:17] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:21:17] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-06-01 20:21:17] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:21:17] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:21:18] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:21:19] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:21:19] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:21:19] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:21:19] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:26] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:21:26] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 377 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30014 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 102/377 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:29] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-06-01 20:21:29] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:21:29] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:21:29] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-06-01 20:21:29] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:21:29] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:21:30] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:21:30] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:21:30] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:21:31] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:21:31] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:21:31] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:21:31] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:21:31] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:21:31] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:21:31] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:21:32] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:21:32] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:21:32] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:21:32] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:35] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 3 ms to minimize.
[2024-06-01 20:21:36] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:21:36] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:21:36] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:21:36] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:21:37] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:21:38] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:21:38] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:21:38] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:21:38] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 3 ms to minimize.
[2024-06-01 20:21:38] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:21:38] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-06-01 20:21:38] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:42] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-06-01 20:21:43] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:21:43] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 20:21:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:21:44] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:21:45] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-06-01 20:21:45] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:21:45] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:21:45] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:21:45] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:21:46] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:21:46] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:21:46] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:21:46] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:21:47] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:21:47] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:21:47] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:21:47] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:21:47] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:21:47] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 20:21:52] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:21:53] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:21:53] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:21:53] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-06-01 20:21:54] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:21:54] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:21:55] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:21:56] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 60296ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61636 ms. Remains : 258/258 places, 672/672 transitions.
Treatment of property Peterson-PT-5-LTLFireability-14 finished in 125607 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))&&F(p1))))'
Support contains 4 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 834 transition count 884
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 476 transition count 884
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 716 place count 476 transition count 704
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 1132 place count 268 transition count 676
Applied a total of 1132 rules in 37 ms. Remains 268 /834 variables (removed 566) and now considering 676/1242 (removed 566) transitions.
[2024-06-01 20:21:56] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 268 cols
[2024-06-01 20:21:56] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:21:56] [INFO ] Implicit Places using invariants in 327 ms returned [231, 244, 245, 246, 247, 248]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 329 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 262/834 places, 676/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 376 ms. Remains : 262/834 places, 676/1242 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 216 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-15 finished in 721 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)))'
[2024-06-01 20:21:57] [INFO ] Flatten gal took : 66 ms
[2024-06-01 20:21:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 20:21:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 11 ms.
Total runtime 531155 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Peterson-PT-5-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717273320438

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Peterson-PT-5-LTLFireability-14
ltl formula formula --ltl=/tmp/3796/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 834 places, 1242 transitions and 3828 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.040 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3796/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3796/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3796/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3796/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 835 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 835, there are 1252 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~114724 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~192268 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~9785!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 38886
pnml2lts-mc( 0/ 4): unique transitions count: 417612
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 95583
pnml2lts-mc( 0/ 4): - claim success count: 38890
pnml2lts-mc( 0/ 4): - cum. max stack depth: 38872
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 38890 states 417664 transitions, fanout: 10.740
pnml2lts-mc( 0/ 4): Total exploration time 2.140 sec (2.140 sec minimum, 2.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18173, Transitions per second: 195170
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.5MB, 20.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 1272 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.5MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-5, 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 r512-smll-171654407300276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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