MCC'2024- Execution of r135-tall-171631130300060

About the Execution of GreatSPN+red for DatabaseWithMutex-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
10634.552	3600000.00	9641606.00	4582.90	?T???TFFFFFFFFFF	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.r135-tall-171631130300060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DatabaseWithMutex-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130300060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 152K Apr 11 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 711K Apr 11 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 11 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 433K Apr 11 18:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 48K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 174K Apr 11 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 808K Apr 11 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 176K Apr 11 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 887K Apr 11 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 840K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716328244055

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:50:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 21:50:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:50:45] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-05-21 21:50:45] [INFO ] Transformed 830 places.
[2024-05-21 21:50:45] [INFO ] Transformed 800 transitions.
[2024-05-21 21:50:45] [INFO ] Found NUPN structural information;
[2024-05-21 21:50:45] [INFO ] Parsed PT model containing 830 places and 800 transitions and 3800 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-21 21:50:45] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-21 21:50:45] [INFO ] Reduced 90 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 732 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 29 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2024-05-21 21:50:45] [INFO ] Computed 130 invariants in 60 ms
[2024-05-21 21:50:46] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-21 21:50:46] [INFO ] Invariant cache hit.
[2024-05-21 21:50:46] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-21 21:50:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:50:57] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 14 ms to minimize.
[2024-05-21 21:50:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:50:58] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:51:06] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 914 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30051 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:51:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:51:22] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:51:24] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:51:25] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 6/920 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:51:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:51:35] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:51:39] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 3/923 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:51:44] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 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 Int declared 820/1630 variables, and 924 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30051 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 14/14 constraints]
After SMT, in 60453ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Finished structural reductions in LTL mode , in 1 iterations and 61567 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 732 out of 830 places after structural reductions.
[2024-05-21 21:51:47] [INFO ] Flatten gal took : 267 ms
[2024-05-21 21:51:48] [INFO ] Flatten gal took : 197 ms
[2024-05-21 21:51:48] [INFO ] Input system was already deterministic with 800 transitions.
Reduction of identical properties reduced properties to check from 24 to 21
RANDOM walk for 40000 steps (8 resets) in 1506 ms. (26 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2024-05-21 21:51:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/18 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/28 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/44 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 553/597 variables, 62/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 553/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 58/655 variables, 16/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/655 variables, 58/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/655 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 830/1630 variables, and 785 constraints, problems are : Problem set: 1 solved, 0 unsolved in 868 ms.
Refiners :[Domain max(s): 655/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 883ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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' '!(X((F(p0)&&F(p1))))'
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 87 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-21 21:51:51] [INFO ] Invariant cache hit.
[2024-05-21 21:51:51] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-21 21:51:51] [INFO ] Invariant cache hit.
[2024-05-21 21:51:52] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-21 21:51:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:52:03] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 5 ms to minimize.
[2024-05-21 21:52:03] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:52:03] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:52:10] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:52:20] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:52:22] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 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 820/1630 variables, and 916 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30028 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:52:27] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:52:32] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:52:36] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:52:41] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-21 21:52:48] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/1630 variables, and 921 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30038 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 11/11 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Finished structural reductions in LTL mode , in 1 iterations and 61703 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 452 reset in 1582 ms.
Product exploration explored 100000 steps with 450 reset in 1415 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 (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 261 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 544 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 1181 steps (0 resets) in 50 ms. (23 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 612 ms. Reduced automaton from 11 states, 35 edges and 2 AP (stutter insensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 415 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 359 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 21:52:58] [INFO ] Invariant cache hit.
[2024-05-21 21:53:01] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-05-21 21:53:03] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 1838 ms returned sat
[2024-05-21 21:53:11] [INFO ] [Real]Absence check using state equation in 8260 ms returned sat
[2024-05-21 21:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:53:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-21 21:53:15] [INFO ] [Nat]Absence check using 19 positive and 111 generalized place invariants in 831 ms returned sat
[2024-05-21 21:53:26] [INFO ] [Nat]Absence check using state equation in 11252 ms returned unknown
Could not prove EG (NOT p0)
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 410 place count 620 transition count 600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 410 place count 620 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Applied a total of 610 rules in 129 ms. Remains 520 /830 variables (removed 310) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 520 cols
[2024-05-21 21:53:26] [INFO ] Computed 120 invariants in 8 ms
[2024-05-21 21:53:26] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-21 21:53:26] [INFO ] Invariant cache hit.
[2024-05-21 21:53:27] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-21 21:53:27] [INFO ] Redundant transitions in 24 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30031 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 520/830 places, 500/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61011 ms. Remains : 520/830 places, 500/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 292 ms. Reduced automaton from 11 states, 35 edges and 2 AP (stutter insensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 445 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 283 steps (0 resets) in 19 ms. (14 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 486 ms. Reduced automaton from 11 states, 35 edges and 2 AP (stutter insensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 495 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 439 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 21:54:30] [INFO ] Invariant cache hit.
[2024-05-21 21:54:32] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2024-05-21 21:54:33] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 1228 ms returned sat
[2024-05-21 21:54:37] [INFO ] [Real]Absence check using state equation in 3894 ms returned sat
[2024-05-21 21:54:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:54:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2024-05-21 21:54:40] [INFO ] [Nat]Absence check using 9 positive and 111 generalized place invariants in 594 ms returned sat
[2024-05-21 21:54:51] [INFO ] [Nat]Absence check using state equation in 10747 ms returned sat
[2024-05-21 21:54:51] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 28 ms.
[2024-05-21 21:54:52] [INFO ] Added : 30 causal constraints over 6 iterations in 774 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 675 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1658 reset in 1757 ms.
Product exploration explored 100000 steps with 1649 reset in 1789 ms.
Support contains 310 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 500/500 transitions.
Applied a total of 0 rules in 15 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 21:54:56] [INFO ] Invariant cache hit.
[2024-05-21 21:54:56] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 21:54:56] [INFO ] Invariant cache hit.
[2024-05-21 21:54:57] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-21 21:54:57] [INFO ] Redundant transitions in 16 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30013 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30018 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60709 ms. Remains : 520/520 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-00 finished in 246748 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(F(p0))||G(p1))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 730 transition count 600
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 200 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 630 cols
[2024-05-21 21:55:57] [INFO ] Computed 130 invariants in 14 ms
[2024-05-21 21:55:58] [INFO ] Implicit Places using invariants in 841 ms returned [15, 26, 37, 38, 50, 51, 58, 61, 75, 86, 90, 93, 108, 114, 115, 124, 141, 144, 166, 167, 169, 178, 185, 186, 190, 191, 195, 197, 204, 206, 212, 228, 232, 249, 251, 253, 264, 268, 274, 277, 292, 302, 310, 316, 317, 318, 328, 333, 337, 341, 343, 354, 358, 360, 370, 374, 379, 382, 408, 427, 428, 430, 435, 439, 440, 442, 444, 448, 451, 454, 456, 460, 465, 479, 491, 504, 507, 509, 522, 523, 525, 530, 537, 538, 539, 541, 542, 552, 553, 563, 575, 578, 581, 583, 591, 594, 604, 607, 609, 620]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 851 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/830 places, 600/800 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1078 ms. Remains : 530/830 places, 600/800 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 746 reset in 823 ms.
Product exploration explored 100000 steps with 717 reset in 841 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 100 steps (0 resets) in 11 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 210 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 530 cols
[2024-05-21 21:56:01] [INFO ] Computed 30 invariants in 17 ms
[2024-05-21 21:56:01] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-21 21:56:01] [INFO ] Invariant cache hit.
[2024-05-21 21:56:05] [INFO ] Implicit Places using invariants and state equation in 3644 ms returned []
Implicit Place search using SMT with State Equation took 4258 ms to find 0 implicit places.
[2024-05-21 21:56:05] [INFO ] Redundant transitions in 12 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 520/520 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 18/538 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:56:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
[2024-05-21 21:56:10] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:56:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
[2024-05-21 21:56:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:56:10] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:56:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 13/551 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:56:14] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
[2024-05-21 21:56:15] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/571 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:56:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:56:18] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:56:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:56:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:56:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:19] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:56:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:56:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:19] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 10/581 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 11/592 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:56:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:56:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:56:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:56:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:56:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:56:28] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:56:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 15/607 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 (/ 1.0 8.0))
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s236 0.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 (/ 1.0 2.0))
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 (/ 1.0 2.0))
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 (/ 3.0 4.0))
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1130 variables, and 616 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30013 ms.
Refiners :[Domain max(s): 520/530 constraints, Positive P Invariants (semi-flows): 18/23 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 520/520 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 18/538 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 78/616 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:56:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:39] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:56:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 3 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:56:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:56:47] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/696 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:56:50] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:56:52] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:56:52] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:56:52] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/716 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:54] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:56:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:56:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:56:54] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:56:56] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:56:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/736 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:56:58] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:56:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:57:00] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:57:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:57:00] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:57:01] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:57:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:57:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:57:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:57:01] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-21 21:57:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 20/756 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:57:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:57:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:57:04] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:57:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:57:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:57:04] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 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 Int declared 520/1130 variables, and 763 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30014 ms.
Refiners :[Domain max(s): 520/530 constraints, Positive P Invariants (semi-flows): 18/23 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 225/225 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64499 ms. Remains : 530/530 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 75 steps (0 resets) in 19 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 683 reset in 919 ms.
Product exploration explored 100000 steps with 689 reset in 957 ms.
Support contains 210 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-05-21 21:57:08] [INFO ] Invariant cache hit.
[2024-05-21 21:57:09] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-21 21:57:09] [INFO ] Invariant cache hit.
[2024-05-21 21:57:12] [INFO ] Implicit Places using invariants and state equation in 3614 ms returned []
Implicit Place search using SMT with State Equation took 4349 ms to find 0 implicit places.
[2024-05-21 21:57:12] [INFO ] Redundant transitions in 4 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:57:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 520/520 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 18/538 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:16] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:57:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:57:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 13/551 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:57:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:57:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:57:22] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:57:22] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:57:22] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:57:22] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:57:22] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/571 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 10/581 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:57:28] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:57:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:57:28] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 11/592 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 11 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:57:35] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:57:36] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:57:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:57:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 15/607 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:57:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1130 variables, and 616 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30023 ms.
Refiners :[Domain max(s): 520/530 constraints, Positive P Invariants (semi-flows): 18/23 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 520/520 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 18/538 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 78/616 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:57:45] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:57:46] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:57:46] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:57:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:57:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:47] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:57:48] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:57:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:57:49] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:57:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:57:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:57:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:57:49] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:57:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:57:51] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:57:52] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:57:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:57:56] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/696 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:57:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:57:59] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:57:59] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:57:59] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:57:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:57:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:58:00] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/716 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:58:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:58:03] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:58:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:58:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-21 21:58:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:58:05] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:58:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:58:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/736 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:58:09] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:58:09] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:58:09] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:58:09] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:58:10] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:58:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:58:10] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:58:10] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:58:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:58:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:58:10] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 20/756 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1130 variables, and 756 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30020 ms.
Refiners :[Domain max(s): 520/530 constraints, Positive P Invariants (semi-flows): 18/23 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 218/218 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64578 ms. Remains : 530/530 places, 600/600 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-02 finished in 135757 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)&&F(p1))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 410 place count 620 transition count 600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 410 place count 620 transition count 500
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Applied a total of 610 rules in 94 ms. Remains 520 /830 variables (removed 310) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 520 cols
[2024-05-21 21:58:13] [INFO ] Computed 120 invariants in 6 ms
[2024-05-21 21:58:13] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-21 21:58:13] [INFO ] Invariant cache hit.
[2024-05-21 21:58:14] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-21 21:58:14] [INFO ] Redundant transitions in 4 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:58:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30013 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 520/830 places, 500/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61059 ms. Remains : 520/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 1859 reset in 935 ms.
Product exploration explored 100000 steps with 1870 reset in 919 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 193 steps (0 resets) in 7 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 21:59:17] [INFO ] Invariant cache hit.
[2024-05-21 21:59:19] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-21 21:59:20] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 1240 ms returned sat
[2024-05-21 21:59:24] [INFO ] [Real]Absence check using state equation in 3993 ms returned sat
[2024-05-21 21:59:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:59:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-05-21 21:59:27] [INFO ] [Nat]Absence check using 9 positive and 111 generalized place invariants in 632 ms returned sat
[2024-05-21 21:59:39] [INFO ] [Nat]Absence check using state equation in 11395 ms returned sat
[2024-05-21 21:59:39] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 36 ms.
Could not prove EG (NOT p0)
Support contains 210 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 500/500 transitions.
Applied a total of 0 rules in 15 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 21:59:40] [INFO ] Invariant cache hit.
[2024-05-21 21:59:40] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-21 21:59:40] [INFO ] Invariant cache hit.
[2024-05-21 21:59:40] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2024-05-21 21:59:40] [INFO ] Redundant transitions in 4 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:59:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30025 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30012 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60994 ms. Remains : 520/520 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 233 steps (0 resets) in 9 ms. (23 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 22:00:41] [INFO ] Invariant cache hit.
[2024-05-21 22:00:44] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 22:00:45] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 1242 ms returned sat
[2024-05-21 22:00:49] [INFO ] [Real]Absence check using state equation in 4056 ms returned sat
[2024-05-21 22:00:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:00:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 22:00:52] [INFO ] [Nat]Absence check using 9 positive and 111 generalized place invariants in 603 ms returned sat
[2024-05-21 22:01:03] [INFO ] [Nat]Absence check using state equation in 11033 ms returned sat
[2024-05-21 22:01:03] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 29 ms.
[2024-05-21 22:01:04] [INFO ] Added : 30 causal constraints over 6 iterations in 790 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1852 reset in 943 ms.
Product exploration explored 100000 steps with 1833 reset in 971 ms.
Support contains 210 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 22:01:06] [INFO ] Invariant cache hit.
[2024-05-21 22:01:06] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-21 22:01:06] [INFO ] Invariant cache hit.
[2024-05-21 22:01:07] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2024-05-21 22:01:07] [INFO ] Redundant transitions in 3 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 22:01:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30042 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
(s426 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 1)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30021 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61029 ms. Remains : 520/520 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-03 finished in 234324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p2)||p1)))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 830 transition count 700
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 730 transition count 700
Applied a total of 200 rules in 36 ms. Remains 730 /830 variables (removed 100) and now considering 700/800 (removed 100) transitions.
// Phase 1: matrix 700 rows 730 cols
[2024-05-21 22:02:07] [INFO ] Computed 130 invariants in 12 ms
[2024-05-21 22:02:08] [INFO ] Implicit Places using invariants in 1252 ms returned [17, 30, 45, 46, 58, 59, 66, 70, 85, 96, 100, 103, 123, 129, 130, 143, 163, 166, 190, 191, 193, 203, 214, 215, 219, 220, 226, 228, 237, 239, 245, 262, 267, 287, 291, 293, 304, 308, 315, 318, 338, 350, 358, 364, 365, 366, 377, 382, 386, 393, 396, 410, 414, 417, 430, 435, 442, 445, 476, 497, 498, 500, 505, 509, 510, 512, 514, 520, 524, 527, 529, 533, 538, 555, 568, 583, 587, 589, 603, 604, 606, 612, 619, 620, 622, 624, 626, 637, 638, 650, 665, 668, 671, 673, 683, 686, 700, 703, 705, 718]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1255 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/830 places, 700/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 630 /630 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1306 ms. Remains : 630/830 places, 700/800 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1018 ms.
Product exploration explored 100000 steps with 0 reset in 1129 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) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (OR (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (OR (NOT p2) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 125 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 4
RANDOM walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1295 ms. (30 steps per ms) remains 1/1 properties
// Phase 1: matrix 700 rows 630 cols
[2024-05-21 22:02:12] [INFO ] Computed 30 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 394/604 variables, 22/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 394/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/630 variables, 8/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 26/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 1290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5013 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 210/1330 variables, and 210 constraints, problems are : Problem set: 1 solved, 0 unsolved in 63 ms.
Refiners :[Domain max(s): 210/630 constraints, Positive P Invariants (semi-flows): 0/22 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5241ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (OR (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (OR (NOT p2) (NOT p0)))), (X (X (NOT p1))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F p0), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F p1)]
Knowledge based reduction with 18 factoid took 354 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p0) (NOT p1))]
[2024-05-21 22:02:17] [INFO ] Invariant cache hit.
[2024-05-21 22:02:19] [INFO ] [Real]Absence check using 22 positive place invariants in 136 ms returned sat
[2024-05-21 22:02:20] [INFO ] [Real]Absence check using 22 positive and 8 generalized place invariants in 110 ms returned sat
[2024-05-21 22:02:32] [INFO ] [Real]Absence check using state equation in 12881 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-21 22:02:32] [INFO ] Invariant cache hit.
[2024-05-21 22:02:33] [INFO ] [Real]Absence check using 22 positive place invariants in 180 ms returned sat
[2024-05-21 22:02:33] [INFO ] [Real]Absence check using 22 positive and 8 generalized place invariants in 146 ms returned sat
[2024-05-21 22:02:44] [INFO ] [Real]Absence check using state equation in 10415 ms returned sat
[2024-05-21 22:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:02:45] [INFO ] [Nat]Absence check using 22 positive place invariants in 550 ms returned sat
[2024-05-21 22:02:47] [INFO ] [Nat]Absence check using 22 positive and 8 generalized place invariants in 2132 ms returned sat
[2024-05-21 22:02:55] [INFO ] [Nat]Absence check using state equation in 7898 ms returned unknown
Could not prove EG (NOT p1)
Support contains 210 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 700/700 transitions.
Applied a total of 0 rules in 19 ms. Remains 630 /630 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-21 22:02:55] [INFO ] Invariant cache hit.
[2024-05-21 22:02:56] [INFO ] Implicit Places using invariants in 934 ms returned []
[2024-05-21 22:02:56] [INFO ] Invariant cache hit.
[2024-05-21 22:05:36] [INFO ] Implicit Places using invariants and state equation in 160026 ms returned []
Implicit Place search using SMT with State Equation took 160961 ms to find 0 implicit places.
[2024-05-21 22:05:36] [INFO ] Redundant transitions in 8 ms returned []
Running 600 sub problems to find dead transitions.
[2024-05-21 22:05:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 18/638 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:05:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:05:43] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:05:43] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:05:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:05:43] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-21 22:05:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:05:47] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/658 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:05:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:05:49] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-21 22:05:50] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:05:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:05:50] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 20/678 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:05:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:05:55] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:05:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:05:56] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 4/682 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:05:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:06:03] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:06:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1330 variables, and 685 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30012 ms.
Refiners :[Domain max(s): 620/630 constraints, Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 18/638 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 47/685 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:06:19] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:06:19] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:06:22] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:06:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:06:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:06:23] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-21 22:06:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:06:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:06:24] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:06:24] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-21 22:06:24] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:06:24] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:06:24] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:06:29] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:06:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:06:29] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:06:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:06:31] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:06:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:06:31] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:06:31] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/1330 variables, and 765 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Domain max(s): 620/630 constraints, Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 127/127 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 221183 ms. Remains : 630/630 places, 700/700 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) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 65 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 374 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 36 ms :[(OR (NOT p1) (NOT p0))]
[2024-05-21 22:06:37] [INFO ] Invariant cache hit.
[2024-05-21 22:06:38] [INFO ] [Real]Absence check using 22 positive place invariants in 182 ms returned sat
[2024-05-21 22:06:38] [INFO ] [Real]Absence check using 22 positive and 8 generalized place invariants in 148 ms returned sat
[2024-05-21 22:06:49] [INFO ] [Real]Absence check using state equation in 10522 ms returned sat
[2024-05-21 22:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:06:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 573 ms returned sat
[2024-05-21 22:06:51] [INFO ] [Nat]Absence check using 22 positive and 8 generalized place invariants in 1539 ms returned sat
[2024-05-21 22:06:59] [INFO ] [Nat]Absence check using state equation in 7928 ms returned unknown
Could not prove EG (NOT p1)
[2024-05-21 22:06:59] [INFO ] Invariant cache hit.
[2024-05-21 22:07:01] [INFO ] [Real]Absence check using 22 positive place invariants in 134 ms returned sat
[2024-05-21 22:07:02] [INFO ] [Real]Absence check using 22 positive and 8 generalized place invariants in 107 ms returned sat
[2024-05-21 22:07:14] [INFO ] [Real]Absence check using state equation in 12797 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 867 ms.
Product exploration explored 100000 steps with 0 reset in 957 ms.
Support contains 210 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 700/700 transitions.
Applied a total of 0 rules in 12 ms. Remains 630 /630 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-21 22:07:16] [INFO ] Invariant cache hit.
[2024-05-21 22:07:17] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-05-21 22:07:17] [INFO ] Invariant cache hit.
[2024-05-21 22:09:57] [INFO ] Implicit Places using invariants and state equation in 160012 ms returned []
Implicit Place search using SMT with State Equation took 160933 ms to find 0 implicit places.
[2024-05-21 22:09:57] [INFO ] Redundant transitions in 7 ms returned []
Running 600 sub problems to find dead transitions.
[2024-05-21 22:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 18/638 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 12 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:10:08] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/658 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:10:09] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:10:11] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:10:11] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:10:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 20/678 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:16] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:10:17] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:10:17] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 4/682 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:20] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1330 variables, and 685 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Domain max(s): 620/630 constraints, Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 18/638 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 47/685 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:33] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:10:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:10:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:10:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:10:38] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:43] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:10:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:10:50] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:10:51] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:10:52] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:10:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:52] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 22:10:57] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:10:57] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:10:57] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:10:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:10:57] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/1330 variables, and 771 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Domain max(s): 620/630 constraints, Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 133/133 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 221157 ms. Remains : 630/630 places, 700/700 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-04 finished in 530423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||F(p2))))'
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2024-05-21 22:10:57] [INFO ] Computed 130 invariants in 6 ms
[2024-05-21 22:10:59] [INFO ] Implicit Places using invariants in 1066 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1074 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1094 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 881 ms.
Product exploration explored 100000 steps with 50000 reset in 948 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 24 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-05 finished in 3169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-21 22:11:01] [INFO ] Invariant cache hit.
[2024-05-21 22:11:02] [INFO ] Implicit Places using invariants in 1136 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1141 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1162 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 343 steps with 95 reset in 5 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-07 finished in 1377 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 11 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 830 transition count 602
Reduce places removed 207 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 1 with 379 rules applied. Total rules applied 577 place count 623 transition count 430
Reduce places removed 172 places and 0 transitions.
Iterating post reduction 2 with 172 rules applied. Total rules applied 749 place count 451 transition count 430
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 749 place count 451 transition count 322
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 965 place count 343 transition count 322
Applied a total of 965 rules in 42 ms. Remains 343 /830 variables (removed 487) and now considering 322/800 (removed 478) transitions.
// Phase 1: matrix 322 rows 343 cols
[2024-05-21 22:11:02] [INFO ] Computed 121 invariants in 8 ms
[2024-05-21 22:11:04] [INFO ] Implicit Places using invariants in 1532 ms returned [6, 9, 12, 14, 15, 16, 18, 19, 20, 21, 25, 26, 27, 28, 29, 31, 34, 36, 40, 42, 43, 46, 49, 51, 52, 55, 56, 57, 59, 60, 61, 63, 67, 68, 73, 74, 78, 79, 80, 89, 90, 91, 92, 97, 98, 99, 100, 101, 102, 103, 104, 105, 108, 109, 112, 114, 116, 117, 120, 121, 122, 124, 128, 129, 130, 135, 139, 140, 141, 142, 143, 144, 148, 149, 153, 154, 158, 159, 160, 163, 169, 170, 171, 173, 175, 176, 177, 179, 180, 183, 184, 185, 187, 188, 189, 190, 191, 193, 194, 197, 198, 199, 200, 201, 203, 206, 209, 210, 212, 214, 218, 221, 225, 226, 228, 230, 231, 232, 235, 236, 237, 238, 240, 242, 243, 245, 246, 247, 248, 250, 251, 252, 253, 254, 255, 257, 259, 263, 265, 269, 274, 275, 276, 278, 279, 280, 283, 286, 287, 288, 291, 293, 295, 296, 297, 298, 299, 301, 302, 303, 305, 307, 308, 309, 310, 311, 317, 318, 319, 321, 323, 326, 327, 328, 331, 332, 333, 334, 335, 338, 340]
[2024-05-21 22:11:04] [INFO ] Actually due to overlaps returned [6, 14, 15, 16, 20, 21, 28, 29, 36, 311, 91, 117, 141, 153, 175, 242, 298, 321, 338]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1538 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/830 places, 322/800 transitions.
Applied a total of 0 rules in 17 ms. Remains 324 /324 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1599 ms. Remains : 324/830 places, 322/800 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 572 ms.
Stack based approach found an accepted trace after 596 steps with 0 reset with depth 597 and stack size 597 in 4 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-09 finished in 2236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 18 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2024-05-21 22:11:04] [INFO ] Computed 130 invariants in 13 ms
[2024-05-21 22:11:05] [INFO ] Implicit Places using invariants in 1263 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1266 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1300 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-10
Product exploration explored 100000 steps with 345 reset in 467 ms.
Product exploration explored 100000 steps with 310 reset in 464 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2415 steps (0 resets) in 17 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 800 rows 730 cols
[2024-05-21 22:11:07] [INFO ] Computed 30 invariants in 16 ms
[2024-05-21 22:11:08] [INFO ] [Real]Absence check using 21 positive place invariants in 99 ms returned sat
[2024-05-21 22:11:08] [INFO ] [Real]Absence check using 21 positive and 9 generalized place invariants in 172 ms returned sat
[2024-05-21 22:11:15] [INFO ] [Real]Absence check using state equation in 6656 ms returned sat
[2024-05-21 22:11:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:11:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 60 ms returned sat
[2024-05-21 22:11:15] [INFO ] [Nat]Absence check using 21 positive and 9 generalized place invariants in 75 ms returned sat
[2024-05-21 22:11:17] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2024-05-21 22:11:17] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-21 22:11:17] [INFO ] Added : 1 causal constraints over 1 iterations in 198 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 191 place count 730 transition count 609
Reduce places removed 201 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 1 with 400 rules applied. Total rules applied 591 place count 529 transition count 410
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 200 rules applied. Total rules applied 791 place count 330 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 792 place count 329 transition count 409
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 99 Pre rules applied. Total rules applied 792 place count 329 transition count 310
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 990 place count 230 transition count 310
Applied a total of 990 rules in 26 ms. Remains 230 /730 variables (removed 500) and now considering 310/800 (removed 490) transitions.
// Phase 1: matrix 310 rows 230 cols
[2024-05-21 22:11:17] [INFO ] Computed 20 invariants in 8 ms
[2024-05-21 22:11:18] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-21 22:11:18] [INFO ] Invariant cache hit.
[2024-05-21 22:11:19] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2024-05-21 22:11:19] [INFO ] Redundant transitions in 4 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-21 22:11:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 10/230 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 10/243 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 7/250 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 10/260 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 310/540 variables, 230/490 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 6/496 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 22:11:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:11:32] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 22:11:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:11:37] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:11:37] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:11:37] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 22:11:43] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-21 22:11:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:11:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:11:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:11:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:11:43] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/540 variables, 6/510 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 510 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30016 ms.
Refiners :[Domain max(s): 230/230 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 30/258 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 10/230 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 10/273 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 7/280 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 22:11:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 310/540 variables, 230/511 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 210/721 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 721 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30013 ms.
Refiners :[Domain max(s): 230/230 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 31/31 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 230/730 places, 310/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61857 ms. Remains : 230/730 places, 310/800 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 239 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-21 22:12:20] [INFO ] Invariant cache hit.
[2024-05-21 22:12:20] [INFO ] [Real]Absence check using 13 positive place invariants in 60 ms returned sat
[2024-05-21 22:12:20] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 64 ms returned sat
[2024-05-21 22:12:21] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2024-05-21 22:12:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:12:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 67 ms returned sat
[2024-05-21 22:12:22] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-21 22:12:22] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-05-21 22:12:22] [INFO ] Computed and/alt/rep : 110/118/110 causal constraints (skipped 100 transitions) in 29 ms.
[2024-05-21 22:12:22] [INFO ] Added : 1 causal constraints over 1 iterations in 87 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2272 reset in 638 ms.
Stack based approach found an accepted trace after 397 steps with 12 reset with depth 12 and stack size 12 in 3 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-10 finished in 78604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(G(p1))) U p2))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 830 transition count 612
Reduce places removed 196 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 1 with 356 rules applied. Total rules applied 544 place count 634 transition count 452
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 704 place count 474 transition count 452
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 704 place count 474 transition count 333
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 942 place count 355 transition count 333
Applied a total of 942 rules in 28 ms. Remains 355 /830 variables (removed 475) and now considering 333/800 (removed 467) transitions.
// Phase 1: matrix 333 rows 355 cols
[2024-05-21 22:12:23] [INFO ] Computed 122 invariants in 3 ms
[2024-05-21 22:12:24] [INFO ] Implicit Places using invariants in 1656 ms returned [0, 8, 11, 13, 15, 18, 19, 20, 21, 24, 25, 26, 27, 30, 32, 34, 39, 40, 41, 42, 44, 46, 48, 50, 51, 54, 55, 56, 60, 62, 63, 65, 70, 75, 79, 80, 81, 82, 83, 90, 91, 92, 93, 94, 95, 99, 100, 101, 102, 104, 105, 106, 107, 108, 111, 112, 114, 117, 119, 123, 124, 127, 128, 131, 132, 134, 139, 142, 143, 144, 146, 147, 150, 151, 155, 156, 160, 162, 165, 168, 172, 173, 174, 176, 177, 178, 179, 181, 182, 186, 187, 188, 190, 191, 192, 193, 194, 196, 197, 200, 201, 202, 204, 208, 209, 211, 214, 215, 217, 220, 224, 226, 227, 232, 234, 236, 237, 238, 239, 240, 243, 244, 245, 248, 250, 251, 253, 254, 257, 259, 260, 261, 263, 264, 265, 266, 268, 270, 272, 274, 278, 284, 285, 287, 288, 290, 292, 295, 296, 297, 300, 304, 305, 306, 307, 308, 311, 312, 313, 314, 315, 317, 320, 321, 326, 328, 330, 331, 333, 334, 335, 338, 339, 340, 344, 345, 346, 347, 350, 353]
[2024-05-21 22:12:24] [INFO ] Actually due to overlaps returned [0, 13, 15, 20, 21, 27, 34, 42, 50, 54, 93, 94, 99, 119, 134, 144, 307, 320, 333, 350]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1659 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 335/830 places, 333/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 335 /335 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1704 ms. Remains : 335/830 places, 333/800 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 451 ms.
Product exploration explored 100000 steps with 0 reset in 521 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 p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X p1), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be false thanks to negative knowledge :(X (X (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-12 finished in 2960 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 U p1))))'
Support contains 2 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 830 transition count 601
Reduce places removed 209 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 409 rules applied. Total rules applied 608 place count 621 transition count 401
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 808 place count 421 transition count 401
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 808 place count 421 transition count 301
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1008 place count 321 transition count 301
Applied a total of 1008 rules in 28 ms. Remains 321 /830 variables (removed 509) and now considering 301/800 (removed 499) transitions.
// Phase 1: matrix 301 rows 321 cols
[2024-05-21 22:12:26] [INFO ] Computed 120 invariants in 8 ms
[2024-05-21 22:12:28] [INFO ] Implicit Places using invariants in 1840 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 36, 37, 38, 39, 40, 42, 44, 46, 47, 49, 50, 51, 52, 54, 55, 56, 58, 61, 62, 66, 67, 71, 72, 73, 74, 75, 81, 82, 83, 84, 85, 86, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 104, 105, 107, 108, 111, 112, 113, 115, 116, 118, 119, 120, 121, 125, 127, 128, 129, 130, 131, 132, 135, 136, 140, 141, 145, 146, 147, 150, 153, 155, 156, 157, 159, 160, 161, 162, 164, 165, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 181, 182, 183, 184, 185, 187, 188, 190, 193, 194, 196, 198, 201, 202, 204, 205, 209, 210, 213, 214, 215, 216, 217, 220, 221, 222, 223, 225, 227, 228, 230, 231, 232, 233, 235, 236, 237, 238, 239, 240, 241, 243, 245, 247, 249, 253, 257, 258, 259, 261, 262, 263, 265, 267, 268, 269, 272, 273, 275, 276, 277, 278, 279, 281, 282, 283, 284, 285, 287, 288, 289, 290, 291, 295, 297, 298, 299, 301, 302, 303, 306, 307, 308, 310, 311, 312, 313, 314, 317, 319]
[2024-05-21 22:12:28] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 18, 19, 25, 26, 32, 84, 108, 129, 140, 160, 227, 278, 289, 301, 317]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1853 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/830 places, 301/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1888 ms. Remains : 301/830 places, 301/800 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 667 ms.
Stack based approach found an accepted trace after 225 steps with 0 reset with depth 226 and stack size 226 in 1 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-13 finished in 2657 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 2 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 830 transition count 600
Reduce places removed 210 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 410 rules applied. Total rules applied 610 place count 620 transition count 400
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 810 place count 420 transition count 300
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 30 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
// Phase 1: matrix 300 rows 320 cols
[2024-05-21 22:12:28] [INFO ] Computed 120 invariants in 6 ms
[2024-05-21 22:12:30] [INFO ] Implicit Places using invariants in 1769 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 36, 37, 38, 39, 40, 42, 44, 46, 47, 49, 50, 51, 52, 54, 55, 56, 58, 61, 62, 66, 67, 71, 72, 73, 74, 75, 81, 82, 83, 84, 85, 86, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 104, 105, 107, 108, 111, 112, 113, 115, 116, 118, 119, 120, 121, 125, 127, 128, 129, 130, 131, 132, 135, 136, 140, 141, 145, 146, 147, 150, 153, 155, 156, 157, 159, 160, 161, 162, 164, 165, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 181, 182, 183, 184, 185, 187, 188, 190, 193, 194, 196, 198, 201, 202, 204, 205, 209, 210, 212, 213, 214, 215, 216, 219, 220, 221, 222, 224, 226, 227, 229, 230, 231, 232, 234, 235, 236, 237, 238, 239, 240, 242, 244, 246, 248, 252, 256, 257, 258, 260, 261, 262, 264, 266, 267, 268, 271, 272, 274, 275, 276, 277, 278, 280, 281, 282, 283, 284, 286, 287, 288, 289, 290, 294, 296, 297, 298, 300, 301, 302, 305, 306, 307, 309, 310, 311, 312, 313, 316, 318]
[2024-05-21 22:12:30] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 18, 19, 25, 26, 32, 84, 108, 129, 140, 160, 226, 277, 288, 300, 316]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1771 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/830 places, 300/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1809 ms. Remains : 300/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 949 reset in 628 ms.
Product exploration explored 100000 steps with 633 reset in 657 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 300 rows 300 cols
[2024-05-21 22:12:32] [INFO ] Computed 100 invariants in 6 ms
[2024-05-21 22:12:32] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-21 22:12:33] [INFO ] [Real]Absence check using 16 positive and 84 generalized place invariants in 302 ms returned sat
[2024-05-21 22:12:35] [INFO ] [Real]Absence check using state equation in 2571 ms returned sat
[2024-05-21 22:12:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:12:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-21 22:12:36] [INFO ] [Nat]Absence check using 16 positive and 84 generalized place invariants in 203 ms returned sat
[2024-05-21 22:12:38] [INFO ] [Nat]Absence check using state equation in 1826 ms returned sat
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:12:38] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1339 ms
[2024-05-21 22:12:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1339 ms
[2024-05-21 22:12:39] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 100 transitions) in 22 ms.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:12:40] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1821 ms
[2024-05-21 22:12:41] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1821 ms
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 937 ms
[2024-05-21 22:12:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 937 ms
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:12:43] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-21 22:12:43] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-21 22:12:43] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:12:43] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-21 22:12:43] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:12:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1211 ms
[2024-05-21 22:12:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1211 ms
[2024-05-21 22:12:43] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:12:43] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1276 ms
[2024-05-21 22:12:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1276 ms
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:12:45] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1302 ms
[2024-05-21 22:12:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1302 ms
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-21 22:12:48] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2631 ms
[2024-05-21 22:12:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2631 ms
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1026 ms
[2024-05-21 22:12:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1027 ms
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:12:50] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 533 ms
Could not prove EG (NOT p0)
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-05-21 22:12:50] [INFO ] Invariant cache hit.
[2024-05-21 22:12:51] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-21 22:12:51] [INFO ] Invariant cache hit.
[2024-05-21 22:12:51] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2024-05-21 22:12:51] [INFO ] Redundant transitions in 2 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-21 22:12:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 290/290 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 60/365 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 9/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 9/300 variables, 15/391 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 9/400 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:12:58] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:12:58] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:12:58] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:12:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:12:58] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:12:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:13:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:07] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/300 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 20/560 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:14] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/300 variables, 20/580 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/300 variables, 20/600 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:13:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-21 22:13:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/300 variables, 19/619 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:22] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/600 variables, and 635 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30017 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 235/235 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 290/290 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 60/365 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 217/582 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 9/593 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 9/602 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 9/300 variables, 15/617 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 9/626 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 9/635 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:13:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:13:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:13:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:13:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:28] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:28] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:13:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:13:30] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:13:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/300 variables, 7/682 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:13:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:13:31] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:13:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:32] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:13:32] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:13:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 14/696 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:34] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:13:34] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 18/714 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:13:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:13:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:13:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/300 variables, 20/734 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:13:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/300 variables, 9/743 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:13:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:13:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:13:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/300 variables, 4/747 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:13:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:13:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:13:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:45] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:13:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:13:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 7/754 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:13:47] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:13:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/300 variables, 3/757 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 22:13:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:13:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:13:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:13:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/300 variables, 5/762 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/600 variables, and 762 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30011 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 0/200 constraints, Known Traps: 362/362 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61282 ms. Remains : 300/300 places, 300/300 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2024-05-21 22:13:52] [INFO ] Invariant cache hit.
[2024-05-21 22:13:52] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-21 22:13:53] [INFO ] [Real]Absence check using 16 positive and 84 generalized place invariants in 748 ms returned sat
[2024-05-21 22:14:04] [INFO ] [Real]Absence check using state equation in 11248 ms returned sat
[2024-05-21 22:14:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:14:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-21 22:14:05] [INFO ] [Nat]Absence check using 16 positive and 84 generalized place invariants in 226 ms returned sat
[2024-05-21 22:14:06] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2024-05-21 22:14:06] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:14:06] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-21 22:14:06] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-21 22:14:06] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:14:06] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:14:06] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1085 ms
[2024-05-21 22:14:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1085 ms
[2024-05-21 22:14:07] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 100 transitions) in 22 ms.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:14:07] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:14:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1222 ms
[2024-05-21 22:14:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1222 ms
[2024-05-21 22:14:08] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:14:09] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-21 22:14:10] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:14:11] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:14:11] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-05-21 22:14:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2301 ms
[2024-05-21 22:14:11] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2301 ms
[2024-05-21 22:14:11] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-21 22:14:11] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-21 22:14:11] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-21 22:14:11] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:11] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1402 ms
[2024-05-21 22:14:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1402 ms
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:12] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:14:13] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:14:13] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:14:13] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-21 22:14:13] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:14:13] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:14:13] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:14:13] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:14:14] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:14:14] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:14:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1548 ms
[2024-05-21 22:14:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1548 ms
[2024-05-21 22:14:14] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:14:14] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-21 22:14:14] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:14] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:14:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1340 ms
[2024-05-21 22:14:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1341 ms
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:14:16] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:17] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-05-21 22:14:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1258 ms
[2024-05-21 22:14:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1258 ms
[2024-05-21 22:14:17] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-21 22:14:17] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 22:14:17] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-21 22:14:17] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-21 22:14:17] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-21 22:14:17] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-21 22:14:18] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-21 22:14:18] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:14:18] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-21 22:14:18] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:14:18] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-21 22:14:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1324 ms
[2024-05-21 22:14:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1325 ms
[2024-05-21 22:14:18] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:14:18] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:14:19] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:14:20] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:14:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1360 ms
[2024-05-21 22:14:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1360 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 648 reset in 628 ms.
Stack based approach found an accepted trace after 28252 steps with 189 reset with depth 8 and stack size 8 in 184 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-14 finished in 112045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X(X(p2)))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 18 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2024-05-21 22:14:21] [INFO ] Computed 130 invariants in 8 ms
[2024-05-21 22:14:22] [INFO ] Implicit Places using invariants in 1362 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1365 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1398 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-15 finished in 1643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Found a Shortening insensitive property : DatabaseWithMutex-PT-10-LTLFireability-00
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 410 place count 620 transition count 600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 410 place count 620 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Applied a total of 610 rules in 31 ms. Remains 520 /830 variables (removed 310) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 520 cols
[2024-05-21 22:14:23] [INFO ] Computed 120 invariants in 11 ms
[2024-05-21 22:14:23] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 22:14:23] [INFO ] Invariant cache hit.
[2024-05-21 22:14:23] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-21 22:14:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30024 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LI_LTL mode, iteration 1 : 520/830 places, 500/800 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60742 ms. Remains : 520/830 places, 500/800 transitions.
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 1652 reset in 1983 ms.
Product exploration explored 100000 steps with 1676 reset in 1920 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 (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 431 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 299 steps (0 resets) in 23 ms. (12 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 506 ms. Reduced automaton from 11 states, 35 edges and 2 AP (stutter insensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 442 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 447 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 22:15:30] [INFO ] Invariant cache hit.
[2024-05-21 22:15:32] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 22:15:33] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 1294 ms returned sat
[2024-05-21 22:15:38] [INFO ] [Real]Absence check using state equation in 4198 ms returned sat
[2024-05-21 22:15:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:15:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 22:15:41] [INFO ] [Nat]Absence check using 9 positive and 111 generalized place invariants in 654 ms returned sat
[2024-05-21 22:15:52] [INFO ] [Nat]Absence check using state equation in 11395 ms returned sat
[2024-05-21 22:15:52] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 31 ms.
[2024-05-21 22:15:53] [INFO ] Added : 15 causal constraints over 3 iterations in 400 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 310 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 22:15:53] [INFO ] Invariant cache hit.
[2024-05-21 22:15:53] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 22:15:53] [INFO ] Invariant cache hit.
[2024-05-21 22:15:53] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-21 22:15:53] [INFO ] Redundant transitions in 6 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 22:15:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30024 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60738 ms. Remains : 520/520 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 311 ms. Reduced automaton from 11 states, 35 edges and 2 AP (stutter insensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 468 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 265 steps (0 resets) in 20 ms. (12 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 504 ms. Reduced automaton from 11 states, 35 edges and 2 AP (stutter insensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 504 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 22:16:56] [INFO ] Invariant cache hit.
[2024-05-21 22:16:58] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 22:17:00] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 1290 ms returned sat
[2024-05-21 22:17:04] [INFO ] [Real]Absence check using state equation in 4182 ms returned sat
[2024-05-21 22:17:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 22:17:07] [INFO ] [Nat]Absence check using 9 positive and 111 generalized place invariants in 630 ms returned sat
[2024-05-21 22:17:18] [INFO ] [Nat]Absence check using state equation in 11246 ms returned sat
[2024-05-21 22:17:18] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 28 ms.
[2024-05-21 22:17:19] [INFO ] Added : 25 causal constraints over 5 iterations in 534 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 490 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1634 reset in 1984 ms.
Product exploration explored 100000 steps with 1636 reset in 1918 ms.
Support contains 310 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 22:17:23] [INFO ] Invariant cache hit.
[2024-05-21 22:17:23] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 22:17:23] [INFO ] Invariant cache hit.
[2024-05-21 22:17:24] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-21 22:17:24] [INFO ] Redundant transitions in 5 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 22:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 1160 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 10/520 variables, 39/630 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 500/1020 variables, 520/1160 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 400/1560 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1560 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60718 ms. Remains : 520/520 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-00 finished in 241990 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(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p2)||p1)))))'
[2024-05-21 22:18:25] [INFO ] Flatten gal took : 87 ms
[2024-05-21 22:18:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 22 ms.
[2024-05-21 22:18:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 830 places, 800 transitions and 3800 arcs took 8 ms.
Total runtime 1659854 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DatabaseWithMutex-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 830
TRANSITIONS: 800
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.021s, Sys 0.002s]

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

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

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

Process ID: 6592
MODEL NAME: /home/mcc/execution/411/model
830 places, 800 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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