MCC'2024- Execution of r136-tall-171631131700020

About the Execution of ITS-Tools for DatabaseWithMutex-COL-10

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.3K Apr 11 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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 4.2K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 27K 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-COL-10-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716325684156

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-21 21:08:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:08:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:08:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 21:08:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 21:08:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 535 ms
[2024-05-21 21:08:05] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 830 PT places and 800.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 21:08:06] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2024-05-21 21:08:06] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 1651 steps (0 resets) in 31 ms. (51 steps per ms) remains 0/9 properties
[2024-05-21 21:08:06] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:08:06] [INFO ] Flatten gal took : 3 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-21 21:08:06] [INFO ] Unfolded HLPN to a Petri net with 830 places and 800 transitions 3800 arcs in 30 ms.
[2024-05-21 21:08:06] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-21 21:08:06] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-21 21:08:06] [INFO ] Reduced 90 identical enabling conditions.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 830 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 15 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:08:06] [INFO ] Computed 130 invariants in 33 ms
[2024-05-21 21:08:06] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-21 21:08:06] [INFO ] Invariant cache hit.
[2024-05-21 21:08:07] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-21 21:08:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 10/830 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 700 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 830/1630 variables, and 130 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 10/830 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 6 (OVERLAPS) 800/1630 variables, 830/960 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1630 variables, 700/1660 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1630/1630 variables, and 1660 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 830/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 0/0 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Finished structural reductions in LTL mode , in 1 iterations and 61345 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 830 out of 830 places after structural reductions.
[2024-05-21 21:09:07] [INFO ] Flatten gal took : 115 ms
[2024-05-21 21:09:08] [INFO ] Flatten gal took : 116 ms
[2024-05-21 21:09:08] [INFO ] Input system was already deterministic with 800 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 893 steps (0 resets) in 172 ms. (5 steps per ms) remains 0/10 properties
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 54 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-21 21:09:09] [INFO ] Invariant cache hit.
[2024-05-21 21:09:09] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 21:09:09] [INFO ] Invariant cache hit.
[2024-05-21 21:09:09] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-21 21:09:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 10/830 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 830/1630 variables, and 130 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 10/830 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 6 (OVERLAPS) 800/1630 variables, 830/960 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1630 variables, 700/1660 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1630/1630 variables, and 1660 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 830/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in LTL mode , in 1 iterations and 61156 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 456 reset in 1282 ms.
Product exploration explored 100000 steps with 449 reset in 1190 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 (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 268 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 441 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 1014 steps (0 resets) in 84 ms. (11 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 559 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 451 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 453 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:10:15] [INFO ] Invariant cache hit.
[2024-05-21 21:10:18] [INFO ] [Real]Absence check using 29 positive place invariants in 45 ms returned sat
[2024-05-21 21:10:18] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 545 ms returned sat
[2024-05-21 21:10:21] [INFO ] [Real]Absence check using state equation in 3043 ms returned sat
[2024-05-21 21:10:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:10:24] [INFO ] [Nat]Absence check using 29 positive place invariants in 36 ms returned sat
[2024-05-21 21:10:24] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 183 ms returned sat
[2024-05-21 21:10:27] [INFO ] [Nat]Absence check using state equation in 2718 ms returned sat
[2024-05-21 21:10:27] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 51 ms.
[2024-05-21 21:10:34] [INFO ] Added : 480 causal constraints over 96 iterations in 7035 ms. Result :sat
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 73 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:10:34] [INFO ] Computed 120 invariants in 8 ms
[2024-05-21 21:10:34] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 21:10:34] [INFO ] Invariant cache hit.
[2024-05-21 21:10:34] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-21 21:10:34] [INFO ] Redundant transitions in 25 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:10:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 0/640 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 640 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 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, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 400/1040 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 1040 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
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 60636 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 p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 10 factoid took 352 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 477 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 295 steps (0 resets) in 31 ms. (9 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 479 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 491 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 464 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:11:37] [INFO ] Invariant cache hit.
[2024-05-21 21:11:39] [INFO ] [Real]Absence check using 19 positive place invariants in 33 ms returned sat
[2024-05-21 21:11:39] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 329 ms returned sat
[2024-05-21 21:11:42] [INFO ] [Real]Absence check using state equation in 2136 ms returned sat
[2024-05-21 21:11:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:11:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-21 21:11:44] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 151 ms returned sat
[2024-05-21 21:11:45] [INFO ] [Nat]Absence check using state equation in 1179 ms returned sat
[2024-05-21 21:11:45] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 32 ms.
[2024-05-21 21:11:46] [INFO ] Added : 150 causal constraints over 30 iterations in 1266 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 476 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 1652 reset in 1442 ms.
Product exploration explored 100000 steps with 1664 reset in 1489 ms.
Built C files in :
/tmp/ltsmin4371325355527895421
[2024-05-21 21:11:50] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-21 21:11:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:11:50] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-21 21:11:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:11:50] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-21 21:11:50] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:11:50] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4371325355527895421
Running compilation step : cd /tmp/ltsmin4371325355527895421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1887 ms.
Running link step : cd /tmp/ltsmin4371325355527895421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4371325355527895421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased322203249754535990.hoa' '--buchi-type=spotba'
LTSmin run took 4022 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-00 finished in 167395 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 0 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 103 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:11:56] [INFO ] Computed 130 invariants in 10 ms
[2024-05-21 21:11:57] [INFO ] Implicit Places using invariants in 440 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 444 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 20 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 567 ms. Remains : 530/830 places, 600/800 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-02
Product exploration explored 100000 steps with 709 reset in 644 ms.
Product exploration explored 100000 steps with 699 reset in 679 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 p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 84 steps (0 resets) in 8 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 262 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 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 34 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:11:59] [INFO ] Computed 30 invariants in 19 ms
[2024-05-21 21:11:59] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 21:11:59] [INFO ] Invariant cache hit.
[2024-05-21 21:12:01] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-21 21:12:01] [INFO ] Redundant transitions in 11 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:12:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 3 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 4 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 5 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 9 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 5 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:12:15] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:16] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:12:16] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:12:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:12:16] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:12:16] [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/139 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:12:20] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:12:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1130 variables, and 211 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 19/28 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 192/192 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 192/211 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:12:31] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:12:31] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:12:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:12:33] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:35] [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/271 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:12:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:12:39] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:40] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:12:42] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:12:46] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:12:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:12:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:12:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:12:49] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:12:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:12:59] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:13:00] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:13:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:13:00] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:13:00] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:13:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:13:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:13:01] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:13:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1130 variables, and 410 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/28 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 391/391 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62035 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) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 135 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 83 steps (0 resets) in 11 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 241 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 705 reset in 738 ms.
Product exploration explored 100000 steps with 692 reset in 762 ms.
Built C files in :
/tmp/ltsmin6367265556388984925
[2024-05-21 21:13:03] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2024-05-21 21:13:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:13:03] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2024-05-21 21:13:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:13:03] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2024-05-21 21:13:03] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:13:03] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6367265556388984925
Running compilation step : cd /tmp/ltsmin6367265556388984925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1848 ms.
Running link step : cd /tmp/ltsmin6367265556388984925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6367265556388984925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17973713453013483844.hoa' '--buchi-type=spotba'
LTSmin run took 5658 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-02 finished in 74877 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 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 37 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:13:11] [INFO ] Computed 120 invariants in 5 ms
[2024-05-21 21:13:11] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 21:13:11] [INFO ] Invariant cache hit.
[2024-05-21 21:13:11] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-21 21:13:11] [INFO ] Redundant transitions in 3 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 0/640 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 640 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 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, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 400/1040 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 1040 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
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 60678 ms. Remains : 520/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-03
Product exploration explored 100000 steps with 1853 reset in 729 ms.
Product exploration explored 100000 steps with 1862 reset in 732 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 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 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 232 steps (0 resets) in 10 ms. (21 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 158 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 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 21:14:14] [INFO ] Invariant cache hit.
[2024-05-21 21:14:16] [INFO ] [Real]Absence check using 19 positive place invariants in 35 ms returned sat
[2024-05-21 21:14:17] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 333 ms returned sat
[2024-05-21 21:14:19] [INFO ] [Real]Absence check using state equation in 2144 ms returned sat
[2024-05-21 21:14:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:14:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-21 21:14:21] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 148 ms returned sat
[2024-05-21 21:14:22] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2024-05-21 21:14:22] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 31 ms.
[2024-05-21 21:14:23] [INFO ] Added : 150 causal constraints over 30 iterations in 1264 ms. Result :sat
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 21 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 21:14:23] [INFO ] Invariant cache hit.
[2024-05-21 21:14:24] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 21:14:24] [INFO ] Invariant cache hit.
[2024-05-21 21:14:24] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-21 21:14:24] [INFO ] Redundant transitions in 1 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:14:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1020 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 640 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 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, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 400/1040 constraints. Problems are: Problem set: 0 solved, 400 unsolved
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 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(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 1)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 timeout
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 1040 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60166ms 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 60665 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 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 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 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 218 steps (0 resets) in 12 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 134 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 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 21:15:25] [INFO ] Invariant cache hit.
[2024-05-21 21:15:27] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned sat
[2024-05-21 21:15:27] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 325 ms returned sat
[2024-05-21 21:15:30] [INFO ] [Real]Absence check using state equation in 2130 ms returned sat
[2024-05-21 21:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:15:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-21 21:15:32] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 146 ms returned sat
[2024-05-21 21:15:33] [INFO ] [Nat]Absence check using state equation in 1133 ms returned sat
[2024-05-21 21:15:33] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 28 ms.
[2024-05-21 21:15:34] [INFO ] Added : 150 causal constraints over 30 iterations in 1254 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1854 reset in 711 ms.
Product exploration explored 100000 steps with 1850 reset in 729 ms.
Built C files in :
/tmp/ltsmin12159451191102582097
[2024-05-21 21:15:36] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-21 21:15:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:15:36] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-21 21:15:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:15:36] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-21 21:15:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:15:36] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12159451191102582097
Running compilation step : cd /tmp/ltsmin12159451191102582097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1602 ms.
Running link step : cd /tmp/ltsmin12159451191102582097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12159451191102582097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18180123700464268523.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 17 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 21:15:51] [INFO ] Invariant cache hit.
[2024-05-21 21:15:51] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 21:15:51] [INFO ] Invariant cache hit.
[2024-05-21 21:15:51] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-05-21 21:15:51] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:15:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1020 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 640 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 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, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 400/1040 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 1040 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60646 ms. Remains : 520/520 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin1880290460755452552
[2024-05-21 21:16:52] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-21 21:16:52] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:52] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-21 21:16:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:52] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-21 21:16:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:52] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1880290460755452552
Running compilation step : cd /tmp/ltsmin1880290460755452552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1598 ms.
Running link step : cd /tmp/ltsmin1880290460755452552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1880290460755452552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17812332198529792745.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:17:07] [INFO ] Flatten gal took : 45 ms
[2024-05-21 21:17:07] [INFO ] Flatten gal took : 35 ms
[2024-05-21 21:17:07] [INFO ] Time to serialize gal into /tmp/LTL13668523276210236467.gal : 10 ms
[2024-05-21 21:17:07] [INFO ] Time to serialize properties into /tmp/LTL10298056586170445735.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13668523276210236467.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13752715568358509744.hoa' '-atoms' '/tmp/LTL10298056586170445735.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10298056586170445735.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13752715568358509744.hoa
Detected timeout of ITS tools.
[2024-05-21 21:17:22] [INFO ] Flatten gal took : 37 ms
[2024-05-21 21:17:22] [INFO ] Flatten gal took : 32 ms
[2024-05-21 21:17:22] [INFO ] Time to serialize gal into /tmp/LTL3919268711038864448.gal : 7 ms
[2024-05-21 21:17:22] [INFO ] Time to serialize properties into /tmp/LTL2405585150294612712.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3919268711038864448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2405585150294612712.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((((((Active_92>=1)&&(Acknowledge_2>=1))&&((Acknowledge_12>=1)&&(Acknowledge_22>=1)))&&(((Acknowledge_32>=1)&&(Acknowle...22647
Formula 0 simplified : F(G!"((((((((((((Active_92>=1)&&(Acknowledge_2>=1))&&((Acknowledge_12>=1)&&(Acknowledge_22>=1)))&&(((Acknowledge_32>=1)&&(Acknowledg...22639
Detected timeout of ITS tools.
[2024-05-21 21:17:37] [INFO ] Flatten gal took : 32 ms
[2024-05-21 21:17:37] [INFO ] Applying decomposition
[2024-05-21 21:17:37] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8135707170574977504.txt' '-o' '/tmp/graph8135707170574977504.bin' '-w' '/tmp/graph8135707170574977504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8135707170574977504.bin' '-l' '-1' '-v' '-w' '/tmp/graph8135707170574977504.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:17:37] [INFO ] Decomposing Gal with order
[2024-05-21 21:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:17:38] [INFO ] Removed a total of 1690 redundant transitions.
[2024-05-21 21:17:38] [INFO ] Flatten gal took : 136 ms
[2024-05-21 21:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-21 21:17:38] [INFO ] Time to serialize gal into /tmp/LTL14858554370871735449.gal : 9 ms
[2024-05-21 21:17:38] [INFO ] Time to serialize properties into /tmp/LTL16845096756151298015.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14858554370871735449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16845096756151298015.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((((((i16.u11.Active_92>=1)&&(i16.u18.Acknowledge_2>=1))&&((i16.u67.Acknowledge_12>=1)&&(i16.u30.Acknowledge_22>=1)))&&...30858
Formula 0 simplified : F(G!"((((((((((((i16.u11.Active_92>=1)&&(i16.u18.Acknowledge_2>=1))&&((i16.u67.Acknowledge_12>=1)&&(i16.u30.Acknowledge_22>=1)))&&((...30850
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-03 finished in 281920 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 100 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.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 2 with 200 rules applied. Total rules applied 510 place count 620 transition count 500
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 610 place count 520 transition count 500
Applied a total of 610 rules in 32 ms. Remains 520 /830 variables (removed 310) and now considering 500/800 (removed 300) transitions.
[2024-05-21 21:17:53] [INFO ] Invariant cache hit.
[2024-05-21 21:17:53] [INFO ] Implicit Places using invariants in 475 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 485 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/830 places, 500/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 420 /420 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 530 ms. Remains : 420/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 434 ms.
Product exploration explored 100000 steps with 0 reset in 495 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 based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 53 steps (0 resets) in 7 ms. (6 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 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 500 rows 420 cols
[2024-05-21 21:17:55] [INFO ] Computed 20 invariants in 14 ms
[2024-05-21 21:17:55] [INFO ] [Real]Absence check using 18 positive place invariants in 27 ms returned sat
[2024-05-21 21:17:55] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-21 21:17:56] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2024-05-21 21:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:17:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 31 ms returned sat
[2024-05-21 21:17:56] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-21 21:17:58] [INFO ] [Nat]Absence check using state equation in 1435 ms returned sat
[2024-05-21 21:17:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:17:58] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:17:58] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:17:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:17:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:17:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:17:58] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:17:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:17:59] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:17:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:17:59] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:17:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1211 ms
[2024-05-21 21:17:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1212 ms
[2024-05-21 21:17:59] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-21 21:18:00] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:18:00] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:18:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:18:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:18:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:18:00] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:18:00] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:18:01] [INFO ] Deduced a trap composed of 15 places in 585 ms of which 0 ms to minimize.
[2024-05-21 21:18:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:18:01] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:18:02] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 10 ms to minimize.
[2024-05-21 21:18:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2335 ms
[2024-05-21 21:18:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2335 ms
[2024-05-21 21:18:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:18:06] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:18:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:18:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:18:07] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:18:07] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:18:07] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:18:08] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 2609 ms
Could not prove EG (NOT p0)
Support contains 100 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 420 /420 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 21:18:11] [INFO ] Invariant cache hit.
[2024-05-21 21:18:11] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-21 21:18:11] [INFO ] Invariant cache hit.
[2024-05-21 21:18:12] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2024-05-21 21:18:12] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:18:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:16] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-21 21:18:17] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:18:19] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:18:20] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:18:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:20] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:18:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:20] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:18:20] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:18:23] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:24] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:18:25] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:18:25] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:18:25] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:18:25] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-21 21:18:25] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:18:27] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:18:27] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:18:27] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-21 21:18:27] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-21 21:18:27] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 23 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:18:28] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:18:30] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:18:30] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-21 21:18:30] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:18:30] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:18:31] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:18:31] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:18:31] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:18:31] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-21 21:18:31] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:18:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:18:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:37] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:18:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:18:37] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:18:37] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:18:37] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-21 21:18:38] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 15/154 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:40] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
[2024-05-21 21:18:40] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
[2024-05-21 21:18:40] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:18:40] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:18:41] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:18:42] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-05-21 21:18:42] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:18:42] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:18:42] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:18:42] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:18:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/920 variables, and 174 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/18 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 165/165 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 165/174 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:18:44] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 5 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:18:45] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-21 21:18:49] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:18:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:18:52] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:18:52] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-21 21:18:52] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:18:52] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:18:52] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:18:52] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-21 21:18:52] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:18:53] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:18:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:18:55] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
[2024-05-21 21:18:55] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-21 21:18:55] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:18:56] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:18:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:19:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 14/328 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:19:05] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:19:05] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:19:05] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:19:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:19:05] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:19:05] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 16/344 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:19:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-21 21:19:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:19:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/920 variables, and 347 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/18 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 338/338 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61240 ms. Remains : 420/420 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 62 steps (0 resets) in 5 ms. (10 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 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-21 21:19:13] [INFO ] Invariant cache hit.
[2024-05-21 21:19:13] [INFO ] [Real]Absence check using 18 positive place invariants in 38 ms returned sat
[2024-05-21 21:19:13] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-21 21:19:14] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2024-05-21 21:19:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 35 ms returned sat
[2024-05-21 21:19:14] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-21 21:19:16] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2024-05-21 21:19:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:19:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:19:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:19:16] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:19:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:19:16] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:19:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:19:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:19:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:19:17] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:19:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:19:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1279 ms
[2024-05-21 21:19:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1280 ms
[2024-05-21 21:19:17] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:19:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:19:19] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:19:19] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:19:19] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:19:21] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 2796 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 536 ms.
Built C files in :
/tmp/ltsmin6841369115987670246
[2024-05-21 21:19:30] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-21 21:19:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:19:30] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-21 21:19:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:19:30] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-21 21:19:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:19:30] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6841369115987670246
Running compilation step : cd /tmp/ltsmin6841369115987670246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1403 ms.
Running link step : cd /tmp/ltsmin6841369115987670246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6841369115987670246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11064574252223668275.hoa' '--buchi-type=spotba'
LTSmin run took 3806 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-04 finished in 102745 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 12 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:19:36] [INFO ] Computed 130 invariants in 8 ms
[2024-05-21 21:19:36] [INFO ] Implicit Places using invariants in 516 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 519 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 6 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 537 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 799 ms.
Product exploration explored 100000 steps with 50000 reset in 794 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 p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND 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 20 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-COL-10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-05 finished in 2357 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 7 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-21 21:19:38] [INFO ] Invariant cache hit.
[2024-05-21 21:19:38] [INFO ] Implicit Places using invariants in 541 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 544 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 9 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 560 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 168 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-COL-10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 531 steps with 166 reset in 5 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-07 finished in 751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||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 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 32 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:19:39] [INFO ] Computed 120 invariants in 9 ms
[2024-05-21 21:19:39] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 21:19:39] [INFO ] Invariant cache hit.
[2024-05-21 21:19:39] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-21 21:19:39] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:19:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 0/640 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 640 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 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, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 400/1040 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 1040 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 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
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 60691 ms. Remains : 520/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-09
Product exploration explored 100000 steps with 7693 reset in 1008 ms.
Product exploration explored 100000 steps with 7725 reset in 979 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) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 125 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 41 ms :[(AND p0 (NOT p1))]
RANDOM walk for 275 steps (0 resets) in 9 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 337 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 30 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND p0 (NOT p1))]
[2024-05-21 21:20:42] [INFO ] Invariant cache hit.
[2024-05-21 21:20:45] [INFO ] [Real]Absence check using 19 positive place invariants in 36 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 596 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Real]Absence check using state equation in 1543 ms returned sat
[2024-05-21 21:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 26 ms returned sat
[2024-05-21 21:20:50] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 145 ms returned sat
[2024-05-21 21:20:51] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2024-05-21 21:20:51] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 43 ms.
[2024-05-21 21:20:53] [INFO ] Added : 180 causal constraints over 36 iterations in 1487 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
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 10 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-21 21:20:53] [INFO ] Invariant cache hit.
[2024-05-21 21:20:53] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 21:20:53] [INFO ] Invariant cache hit.
[2024-05-21 21:20:53] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-21 21:20:53] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-21 21:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1020 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 640 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30001 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 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, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (OVERLAPS) 10/520 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 500/1020 variables, 520/640 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 400/1040 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 1040 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60600 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 p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 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 36 ms :[(AND p0 (NOT p1))]
RANDOM walk for 309 steps (0 resets) in 13 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 206 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 41 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
[2024-05-21 21:21:54] [INFO ] Invariant cache hit.
[2024-05-21 21:21:57] [INFO ] [Real]Absence check using 19 positive place invariants in 36 ms returned sat
[2024-05-21 21:21:57] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 581 ms returned sat
[2024-05-21 21:21:59] [INFO ] [Real]Absence check using state equation in 1536 ms returned sat
[2024-05-21 21:21:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2024-05-21 21:22:02] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 159 ms returned sat
[2024-05-21 21:22:03] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2024-05-21 21:22:03] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 30 ms.
[2024-05-21 21:22:05] [INFO ] Added : 180 causal constraints over 36 iterations in 1507 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 41 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 7702 reset in 954 ms.
Product exploration explored 100000 steps with 7712 reset in 956 ms.
Built C files in :
/tmp/ltsmin7587960510685739622
[2024-05-21 21:22:07] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-21 21:22:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:22:07] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-21 21:22:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:22:07] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-21 21:22:07] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:22:07] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7587960510685739622
Running compilation step : cd /tmp/ltsmin7587960510685739622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1644 ms.
Running link step : cd /tmp/ltsmin7587960510685739622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7587960510685739622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased503361613174678898.hoa' '--buchi-type=spotba'
LTSmin run took 3939 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-09 finished in 153639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 100 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 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 610 place count 520 transition count 400
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 810 place count 420 transition count 400
Applied a total of 810 rules in 33 ms. Remains 420 /830 variables (removed 410) and now considering 400/800 (removed 400) transitions.
// Phase 1: matrix 400 rows 420 cols
[2024-05-21 21:22:12] [INFO ] Computed 120 invariants in 11 ms
[2024-05-21 21:22:13] [INFO ] Implicit Places using invariants in 797 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2024-05-21 21:22:13] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 799 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/830 places, 400/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 840 ms. Remains : 400/830 places, 400/800 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-10
Product exploration explored 100000 steps with 10645 reset in 568 ms.
Product exploration explored 100000 steps with 10679 reset in 579 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 37 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
// Phase 1: matrix 400 rows 400 cols
[2024-05-21 21:22:15] [INFO ] Computed 100 invariants in 11 ms
[2024-05-21 21:22:15] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-21 21:22:15] [INFO ] [Real]Absence check using 19 positive and 81 generalized place invariants in 35 ms returned sat
[2024-05-21 21:22:15] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-05-21 21:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-21 21:22:16] [INFO ] [Nat]Absence check using 19 positive and 81 generalized place invariants in 63 ms returned sat
[2024-05-21 21:22:16] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-05-21 21:22:16] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:22:16] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:22:16] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:22:16] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:22:18] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:22:20] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:22:21] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:22:22] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:22:25] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 4 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 11336 ms
[2024-05-21 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 124/123 trap constraints in 11337 ms
[2024-05-21 21:22:27] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 100 transitions) in 26 ms.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 944 ms
[2024-05-21 21:22:29] [INFO ] Added : 4 causal constraints over 1 iterations in 1051 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 100 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-21 21:22:29] [INFO ] Invariant cache hit.
[2024-05-21 21:22:29] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 21:22:29] [INFO ] Invariant cache hit.
[2024-05-21 21:22:29] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-05-21 21:22:29] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-21 21:22:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 10/400 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:22:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:22:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:22:37] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:39] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:22:39] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:22:39] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:22:40] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:22:42] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 3 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:22:43] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:22:45] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:46] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:48] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:22:48] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:48] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:48] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:48] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:22:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:22:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:22:51] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:52] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:22:52] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:22:52] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:52] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:22:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:22:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:53] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:22:54] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:54] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:22:54] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:22:54] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:54] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:22:55] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:22:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:56] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:22:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:56] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:22:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:22:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:22:58] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:22:58] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:22:59] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
SMT process timed out in 30114ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30894 ms. Remains : 400/400 places, 400/400 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-21 21:23:00] [INFO ] Invariant cache hit.
[2024-05-21 21:23:00] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-21 21:23:00] [INFO ] [Real]Absence check using 19 positive and 81 generalized place invariants in 48 ms returned sat
[2024-05-21 21:23:00] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2024-05-21 21:23:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:23:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-21 21:23:01] [INFO ] [Nat]Absence check using 19 positive and 81 generalized place invariants in 72 ms returned sat
[2024-05-21 21:23:01] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2024-05-21 21:23:01] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:23:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:23:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 3 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:23:04] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:23:05] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:23:06] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5712 ms
[2024-05-21 21:23:07] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 5712 ms
[2024-05-21 21:23:07] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 100 transitions) in 24 ms.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:23:07] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:23:08] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:23:09] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:10] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:11] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:23:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:23:15] [INFO ] Trap strengthening (SAT) tested/added 93/92 trap constraints in 7937 ms
[2024-05-21 21:23:15] [INFO ] Added : 8 causal constraints over 2 iterations in 8078 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10693 reset in 568 ms.
Product exploration explored 100000 steps with 10657 reset in 572 ms.
Built C files in :
/tmp/ltsmin1466537465982812878
[2024-05-21 21:23:16] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2024-05-21 21:23:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:23:16] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2024-05-21 21:23:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:23:16] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2024-05-21 21:23:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:23:16] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1466537465982812878
Running compilation step : cd /tmp/ltsmin1466537465982812878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1203 ms.
Running link step : cd /tmp/ltsmin1466537465982812878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1466537465982812878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3479298348402909555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-21 21:23:31] [INFO ] Invariant cache hit.
[2024-05-21 21:23:32] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 21:23:32] [INFO ] Invariant cache hit.
[2024-05-21 21:23:32] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-21 21:23:32] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-21 21:23:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 10/400 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:38] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:23:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:23:40] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:42] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:23:42] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:23:42] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:23:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 4 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:44] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:23:45] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:23:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:47] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:47] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:23:47] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:47] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:23:48] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:51] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:51] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:23:51] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:51] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:23:51] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:23:51] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:23:52] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:53] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:23:54] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:23:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:23:55] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:23:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:23:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:23:55] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:23:56] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:23:57] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:23:57] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:23:57] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:23:57] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:23:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:23:57] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:23:58] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:23:58] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:23:59] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:23:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:23:59] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:23:59] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:24:01] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:24:01] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:01] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:02] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:24:02] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:02] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:02] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:24:02] [INFO ] Deduced a trap composed of 13 places in 46 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 400/800 variables, and 270 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 81/81 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 170/170 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 165/246 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 10/400 variables, 10/256 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 9/265 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:24:05] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:24:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:10] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:24:11] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:24:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:24:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:24:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:14] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:14] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:24:14] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:24:17] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 20/410 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:17] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:24:17] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:24:19] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:24:20] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:24:20] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:24:20] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:24:21] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:24:22] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:24:23] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:24:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:24:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:24:24] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:24:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:24:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:24:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:24:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 11/448 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:28] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:24:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:28] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:30] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 6/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-21 21:24:31] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:24:31] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:24:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:24:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:24:31] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:24:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/800 variables, and 460 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 81/81 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/300 constraints, Known Traps: 360/360 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60896 ms. Remains : 400/400 places, 400/400 transitions.
Built C files in :
/tmp/ltsmin15500866965795658361
[2024-05-21 21:24:32] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2024-05-21 21:24:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:24:32] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2024-05-21 21:24:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:24:32] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2024-05-21 21:24:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:24:32] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15500866965795658361
Running compilation step : cd /tmp/ltsmin15500866965795658361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1196 ms.
Running link step : cd /tmp/ltsmin15500866965795658361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15500866965795658361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14320080299015420957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:24:47] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:24:47] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:24:47] [INFO ] Time to serialize gal into /tmp/LTL4812663760448078704.gal : 4 ms
[2024-05-21 21:24:47] [INFO ] Time to serialize properties into /tmp/LTL3657043825871271495.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4812663760448078704.gal' '-t' 'CGAL' '-hoa' '/tmp/aut658474575875592678.hoa' '-atoms' '/tmp/LTL3657043825871271495.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3657043825871271495.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut658474575875592678.hoa
Detected timeout of ITS tools.
[2024-05-21 21:25:03] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:25:03] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:25:03] [INFO ] Time to serialize gal into /tmp/LTL9314287856632853426.gal : 4 ms
[2024-05-21 21:25:03] [INFO ] Time to serialize properties into /tmp/LTL1226275439933560434.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9314287856632853426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1226275439933560434.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("((((((((Modify_71>=1)||(Modify_6>=1))||((Modify_67>=1)||(Modify_2>=1)))||(((Modify_79>=1)||(Modify_14>=1))||((Modify_75>=1)||(Mo...1817
Formula 0 simplified : G!"((((((((Modify_71>=1)||(Modify_6>=1))||((Modify_67>=1)||(Modify_2>=1)))||(((Modify_79>=1)||(Modify_14>=1))||((Modify_75>=1)||(Mod...1813
Detected timeout of ITS tools.
[2024-05-21 21:25:18] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:25:18] [INFO ] Applying decomposition
[2024-05-21 21:25:18] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4502999980348873571.txt' '-o' '/tmp/graph4502999980348873571.bin' '-w' '/tmp/graph4502999980348873571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4502999980348873571.bin' '-l' '-1' '-v' '-w' '/tmp/graph4502999980348873571.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:25:18] [INFO ] Decomposing Gal with order
[2024-05-21 21:25:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:25:18] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-21 21:25:18] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:25:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 21:25:18] [INFO ] Time to serialize gal into /tmp/LTL13846718052946914560.gal : 5 ms
[2024-05-21 21:25:18] [INFO ] Time to serialize properties into /tmp/LTL12071987385054925722.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13846718052946914560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12071987385054925722.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F("((((((((u10.Modify_71>=1)||(u15.Modify_6>=1))||((u16.Modify_67>=1)||(u11.Modify_2>=1)))||(((u18.Modify_79>=1)||(u13.Modify_14>=1...2207
Formula 0 simplified : G!"((((((((u10.Modify_71>=1)||(u15.Modify_6>=1))||((u16.Modify_67>=1)||(u11.Modify_2>=1)))||(((u18.Modify_79>=1)||(u13.Modify_14>=1)...2203
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
875 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.84107,275956,1,0,517152,20709,2370,689839,3489,314284,660433
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-10 finished in 196122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1)) U ((G(p2)||X(!p0)) U G(p3))))'
Support contains 410 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 5 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:25:28] [INFO ] Computed 130 invariants in 5 ms
[2024-05-21 21:25:29] [INFO ] Implicit Places using invariants in 513 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 519 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 532 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 792 ms :[(NOT p3), p0, (NOT p3), (AND (NOT p1) p0), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0), (AND (NOT p3) (NOT p1) p0), (AND (NOT p3) p0), (AND (NOT p2) (NOT p3) (NOT p1) p0), (AND (NOT p2) (NOT p3) p0), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-12
Entered a terminal (fully accepting) state of product in 291 steps with 98 reset in 23 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-12 finished in 1402 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 100 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 0 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 27 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:25:30] [INFO ] Computed 130 invariants in 3 ms
[2024-05-21 21:25:30] [INFO ] Implicit Places using invariants in 516 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 518 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 9 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 554 ms. Remains : 530/830 places, 600/800 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-13
Product exploration explored 100000 steps with 5059 reset in 669 ms.
Product exploration explored 100000 steps with 5092 reset in 677 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 based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 62 steps (0 resets) in 7 ms. (7 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 97 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 94 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 600 rows 530 cols
[2024-05-21 21:25:32] [INFO ] Computed 30 invariants in 14 ms
[2024-05-21 21:25:33] [INFO ] [Real]Absence check using 27 positive place invariants in 58 ms returned sat
[2024-05-21 21:25:33] [INFO ] [Real]Absence check using 27 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-21 21:25:34] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2024-05-21 21:25:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:25:35] [INFO ] [Nat]Absence check using 27 positive place invariants in 44 ms returned sat
[2024-05-21 21:25:35] [INFO ] [Nat]Absence check using 27 positive and 3 generalized place invariants in 30 ms returned sat
[2024-05-21 21:25:37] [INFO ] [Nat]Absence check using state equation in 2700 ms returned sat
[2024-05-21 21:25:37] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:25:38] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:25:38] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:25:38] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:25:38] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:25:38] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:25:39] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:25:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:25:40] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2300 ms
[2024-05-21 21:25:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2300 ms
[2024-05-21 21:25:40] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-21 21:25:43] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:25:43] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:25:43] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:25:44] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:25:44] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:25:44] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:25:44] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:25:44] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:25:44] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:25:45] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:25:45] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:25:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1820 ms
[2024-05-21 21:25:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1820 ms
[2024-05-21 21:25:45] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:25:45] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:25:45] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:25:46] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:25:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:25:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:25:46] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:25:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:25:46] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:25:47] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:25:47] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:25:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1591 ms
[2024-05-21 21:25:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1591 ms
[2024-05-21 21:25:47] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:25:47] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:25:48] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:25:48] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:25:49] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 2420 ms
Could not prove EG (NOT p0)
Support contains 100 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 10 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-05-21 21:25:49] [INFO ] Invariant cache hit.
[2024-05-21 21:25:49] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-21 21:25:49] [INFO ] Invariant cache hit.
[2024-05-21 21:25:51] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2024-05-21 21:25:51] [INFO ] Redundant transitions in 4 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:25:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:25:55] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:25:55] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:25:55] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:25:55] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:25:56] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:25:57] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:25:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:25:59] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:26:00] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:26:01] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:26:01] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:26:01] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:26:05] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:06] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:26:07] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:26:08] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:26:09] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:26:10] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:26:11] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:26:15] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:26:16] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-21 21:26:16] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-21 21:26:16] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:26:16] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-21 21:26:16] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:26:16] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:26:16] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:26:17] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:26:18] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:26:19] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:26:19] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-21 21:26:19] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:26:19] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:26:19] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:26:19] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:20] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:26:20] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1130 variables, and 181 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/27 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 162/162 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 162/181 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:26:22] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:26:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 8 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:26:24] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:26:25] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:26:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:26:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:26:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:26:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:26:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:26:34] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:26:34] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:26:41] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:26:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:26:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:26:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:26:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 15/376 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:26:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:26:44] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:26:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:44] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:26:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 5 ms to minimize.
[2024-05-21 21:26:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:44] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:26:46] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:26:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:26:49] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:26:49] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:26:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:26:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
SMT process timed out in 60200ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62088 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 71 steps (0 resets) in 8 ms. (7 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 87 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
[2024-05-21 21:26:52] [INFO ] Invariant cache hit.
[2024-05-21 21:26:52] [INFO ] [Real]Absence check using 27 positive place invariants in 41 ms returned sat
[2024-05-21 21:26:52] [INFO ] [Real]Absence check using 27 positive and 3 generalized place invariants in 33 ms returned sat
[2024-05-21 21:26:54] [INFO ] [Real]Absence check using state equation in 1579 ms returned sat
[2024-05-21 21:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:26:54] [INFO ] [Nat]Absence check using 27 positive place invariants in 34 ms returned sat
[2024-05-21 21:26:54] [INFO ] [Nat]Absence check using 27 positive and 3 generalized place invariants in 35 ms returned sat
[2024-05-21 21:26:56] [INFO ] [Nat]Absence check using state equation in 2106 ms returned sat
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 4 ms to minimize.
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:26:57] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:26:58] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:26:58] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:26:58] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:26:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1433 ms
[2024-05-21 21:26:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1433 ms
[2024-05-21 21:26:58] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-21 21:27:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:27:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:27:01] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:27:01] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:27:01] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:27:01] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:27:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:27:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:27:02] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:27:02] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:27:02] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:27:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1636 ms
[2024-05-21 21:27:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1637 ms
[2024-05-21 21:27:02] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:27:03] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:27:03] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:27:03] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:27:03] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:27:04] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:27:04] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:27:04] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:27:04] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:27:05] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:27:06] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 3936 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5077 reset in 659 ms.
Product exploration explored 100000 steps with 5059 reset in 687 ms.
Built C files in :
/tmp/ltsmin8055707261311233615
[2024-05-21 21:27:10] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2024-05-21 21:27:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:27:10] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2024-05-21 21:27:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:27:10] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2024-05-21 21:27:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:27:10] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8055707261311233615
Running compilation step : cd /tmp/ltsmin8055707261311233615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1857 ms.
Running link step : cd /tmp/ltsmin8055707261311233615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8055707261311233615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10467575692185399033.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 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 14 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-05-21 21:27:25] [INFO ] Invariant cache hit.
[2024-05-21 21:27:26] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-21 21:27:26] [INFO ] Invariant cache hit.
[2024-05-21 21:27:27] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2024-05-21 21:27:27] [INFO ] Redundant transitions in 3 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:27:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:31] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-21 21:27:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:27:32] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:27:33] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 3 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:27:34] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:27:35] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:36] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:27:37] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:27:37] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:27:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:41] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:42] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:27:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:27:44] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-21 21:27:46] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:50] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:27:51] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-21 21:27:52] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:27:53] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:27:54] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:27:55] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:27:55] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:27:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:27:55] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:27:55] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:56] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:27:56] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1130 variables, and 181 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/27 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 162/162 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 162/181 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:27:58] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:27:58] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:27:58] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:27:58] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-21 21:27:58] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:27:59] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:28:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:28:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:28:03] [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/241 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:03] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:28:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:28:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:28:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:28:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:28:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:28:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:28:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:28:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:28:15] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:28:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:28:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:28:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:28:17] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:28:17] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:28:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:28:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:28:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 15/376 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:19] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:28:19] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:28:19] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:28:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-21 21:28:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:28:20] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:28:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:28:21] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:28:23] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:28:23] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:28:23] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:28:23] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1130 variables, and 408 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/27 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 389/389 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62075 ms. Remains : 530/530 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin16018923350349642831
[2024-05-21 21:28:28] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2024-05-21 21:28:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:28] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2024-05-21 21:28:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:28] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2024-05-21 21:28:28] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:28] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16018923350349642831
Running compilation step : cd /tmp/ltsmin16018923350349642831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1785 ms.
Running link step : cd /tmp/ltsmin16018923350349642831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16018923350349642831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8501259798776149514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:28:43] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:28:43] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:28:43] [INFO ] Time to serialize gal into /tmp/LTL17985033941038287160.gal : 4 ms
[2024-05-21 21:28:43] [INFO ] Time to serialize properties into /tmp/LTL15338262608308540618.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17985033941038287160.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12848393002723767813.hoa' '-atoms' '/tmp/LTL15338262608308540618.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15338262608308540618.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12848393002723767813.hoa
Detected timeout of ITS tools.
[2024-05-21 21:28:58] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:28:58] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:28:58] [INFO ] Time to serialize gal into /tmp/LTL17899822073991679967.gal : 5 ms
[2024-05-21 21:28:58] [INFO ] Time to serialize properties into /tmp/LTL6731458874865184019.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17899822073991679967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6731458874865184019.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((MesBuffReply_32>=1)||(MesBuffReply_93>=1))||((MesBuffReply_28>=1)||(MesBuffReply_40>=1)))||(((MesBuffReply_97>=1)||(Me...2420
Formula 0 simplified : FG!"((((((((MesBuffReply_32>=1)||(MesBuffReply_93>=1))||((MesBuffReply_28>=1)||(MesBuffReply_40>=1)))||(((MesBuffReply_97>=1)||(MesB...2414
Detected timeout of ITS tools.
[2024-05-21 21:29:13] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:29:13] [INFO ] Applying decomposition
[2024-05-21 21:29:13] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15213508461526691564.txt' '-o' '/tmp/graph15213508461526691564.bin' '-w' '/tmp/graph15213508461526691564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15213508461526691564.bin' '-l' '-1' '-v' '-w' '/tmp/graph15213508461526691564.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:29:13] [INFO ] Decomposing Gal with order
[2024-05-21 21:29:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:29:13] [INFO ] Removed a total of 980 redundant transitions.
[2024-05-21 21:29:13] [INFO ] Flatten gal took : 57 ms
[2024-05-21 21:29:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-21 21:29:13] [INFO ] Time to serialize gal into /tmp/LTL17457659036306233555.gal : 8 ms
[2024-05-21 21:29:13] [INFO ] Time to serialize properties into /tmp/LTL17546823579911685722.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17457659036306233555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17546823579911685722.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i11.u88.MesBuffReply_32>=1)||(i19.u71.MesBuffReply_93>=1))||((i16.u84.MesBuffReply_28>=1)||(i17.u42.MesBuffReply_40>=1...3240
Formula 0 simplified : FG!"((((((((i11.u88.MesBuffReply_32>=1)||(i19.u71.MesBuffReply_93>=1))||((i16.u84.MesBuffReply_28>=1)||(i17.u42.MesBuffReply_40>=1))...3234
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-13 finished in 238394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(p2)))))'
Support contains 400 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.
Performed 100 Post agglomeration using F-continuation condition.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
Applied a total of 410 rules in 23 ms. Remains 620 /830 variables (removed 210) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 620 cols
[2024-05-21 21:29:28] [INFO ] Computed 120 invariants in 10 ms
[2024-05-21 21:29:28] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 21:29:28] [INFO ] Invariant cache hit.
[2024-05-21 21:29:29] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-21 21:29:29] [INFO ] Redundant transitions in 3 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:29:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 10/620 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (OVERLAPS) 600/1220 variables, 620/740 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 740 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 10/620 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (OVERLAPS) 600/1220 variables, 620/740 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 500/1240 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1240 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/830 places, 600/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60768 ms. Remains : 620/830 places, 600/800 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-14
Product exploration explored 100000 steps with 1682 reset in 742 ms.
Product exploration explored 100000 steps with 1671 reset in 757 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) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 296 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 438 steps (0 resets) in 14 ms. (29 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F p1)]
Knowledge based reduction with 8 factoid took 320 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 117 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2024-05-21 21:30:32] [INFO ] Invariant cache hit.
[2024-05-21 21:30:34] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-21 21:30:35] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 324 ms returned sat
[2024-05-21 21:30:37] [INFO ] [Real]Absence check using state equation in 2375 ms returned sat
[2024-05-21 21:30:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-21 21:30:39] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 173 ms returned sat
[2024-05-21 21:30:41] [INFO ] [Nat]Absence check using state equation in 1960 ms returned sat
[2024-05-21 21:30:41] [INFO ] Computed and/alt/rep : 400/1200/400 causal constraints (skipped 100 transitions) in 31 ms.
[2024-05-21 21:30:45] [INFO ] Added : 320 causal constraints over 64 iterations in 3447 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 21:30:45] [INFO ] Invariant cache hit.
[2024-05-21 21:30:45] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-21 21:30:45] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 128 ms returned sat
[2024-05-21 21:30:46] [INFO ] [Real]Absence check using state equation in 1066 ms returned sat
[2024-05-21 21:30:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-21 21:30:47] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 132 ms returned sat
[2024-05-21 21:30:48] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2024-05-21 21:30:48] [INFO ] Computed and/alt/rep : 400/1200/400 causal constraints (skipped 100 transitions) in 33 ms.
[2024-05-21 21:30:49] [INFO ] Added : 7 causal constraints over 2 iterations in 186 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 300 out of 620 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 600/600 transitions.
Applied a total of 0 rules in 9 ms. Remains 620 /620 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-05-21 21:30:49] [INFO ] Invariant cache hit.
[2024-05-21 21:30:49] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 21:30:49] [INFO ] Invariant cache hit.
[2024-05-21 21:30:49] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-05-21 21:30:49] [INFO ] Redundant transitions in 2 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:30:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 10/620 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (OVERLAPS) 600/1220 variables, 620/740 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 740 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 10/620 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (OVERLAPS) 600/1220 variables, 620/740 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 500/1240 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1240 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60766 ms. Remains : 620/620 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 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 115 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 133 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 393 steps (0 resets) in 11 ms. (32 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 5 factoid took 148 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 148 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2024-05-21 21:31:50] [INFO ] Invariant cache hit.
[2024-05-21 21:31:53] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-21 21:31:53] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 323 ms returned sat
[2024-05-21 21:31:55] [INFO ] [Real]Absence check using state equation in 2394 ms returned sat
[2024-05-21 21:31:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:31:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-21 21:31:58] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 175 ms returned sat
[2024-05-21 21:32:00] [INFO ] [Nat]Absence check using state equation in 2015 ms returned sat
[2024-05-21 21:32:00] [INFO ] Computed and/alt/rep : 400/1200/400 causal constraints (skipped 100 transitions) in 34 ms.
[2024-05-21 21:32:04] [INFO ] Added : 320 causal constraints over 64 iterations in 3518 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 21:32:04] [INFO ] Invariant cache hit.
[2024-05-21 21:32:04] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-21 21:32:04] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 130 ms returned sat
[2024-05-21 21:32:05] [INFO ] [Real]Absence check using state equation in 1098 ms returned sat
[2024-05-21 21:32:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:32:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-21 21:32:06] [INFO ] [Nat]Absence check using 19 positive and 101 generalized place invariants in 127 ms returned sat
[2024-05-21 21:32:07] [INFO ] [Nat]Absence check using state equation in 1424 ms returned sat
[2024-05-21 21:32:07] [INFO ] Computed and/alt/rep : 400/1200/400 causal constraints (skipped 100 transitions) in 33 ms.
[2024-05-21 21:32:07] [INFO ] Added : 7 causal constraints over 2 iterations in 190 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1657 reset in 743 ms.
Product exploration explored 100000 steps with 1620 reset in 764 ms.
Built C files in :
/tmp/ltsmin16747385754090248420
[2024-05-21 21:32:09] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2024-05-21 21:32:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:32:09] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2024-05-21 21:32:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:32:09] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2024-05-21 21:32:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:32:09] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16747385754090248420
Running compilation step : cd /tmp/ltsmin16747385754090248420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1978 ms.
Running link step : cd /tmp/ltsmin16747385754090248420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16747385754090248420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12789190278254197868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 600/600 transitions.
Applied a total of 0 rules in 14 ms. Remains 620 /620 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-05-21 21:32:24] [INFO ] Invariant cache hit.
[2024-05-21 21:32:24] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 21:32:24] [INFO ] Invariant cache hit.
[2024-05-21 21:32:25] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-21 21:32:25] [INFO ] Redundant transitions in 2 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-21 21:32:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 10/620 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (OVERLAPS) 600/1220 variables, 620/740 constraints. Problems are: Problem set: 0 solved, 500 unsolved
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 1220/1220 variables, and 740 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 10/620 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (OVERLAPS) 600/1220 variables, 620/740 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 500/1240 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1240 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60766 ms. Remains : 620/620 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin8469128440330326974
[2024-05-21 21:33:25] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2024-05-21 21:33:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:33:25] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2024-05-21 21:33:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:33:25] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2024-05-21 21:33:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:33:25] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8469128440330326974
Running compilation step : cd /tmp/ltsmin8469128440330326974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1971 ms.
Running link step : cd /tmp/ltsmin8469128440330326974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8469128440330326974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased314806033870168506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:33:40] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:33:40] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:33:40] [INFO ] Time to serialize gal into /tmp/LTL5219451824697234017.gal : 3 ms
[2024-05-21 21:33:40] [INFO ] Time to serialize properties into /tmp/LTL7845970963557106338.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5219451824697234017.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5934663708703323225.hoa' '-atoms' '/tmp/LTL7845970963557106338.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7845970963557106338.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5934663708703323225.hoa
Detected timeout of ITS tools.
[2024-05-21 21:33:55] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:33:55] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:33:55] [INFO ] Time to serialize gal into /tmp/LTL15784355416218683041.gal : 4 ms
[2024-05-21 21:33:55] [INFO ] Time to serialize properties into /tmp/LTL8328294128810196960.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15784355416218683041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8328294128810196960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((Modify_71>=1)||(Modify_6>=1))||((Modify_67>=1)||(Modify_2>=1)))||(((Modify_79>=1)||(Modify_14>=1))||((Modify_75>=1)||(M...26124
Formula 0 simplified : F!"((((((((Modify_71>=1)||(Modify_6>=1))||((Modify_67>=1)||(Modify_2>=1)))||(((Modify_79>=1)||(Modify_14>=1))||((Modify_75>=1)||(Mod...26112
Detected timeout of ITS tools.
[2024-05-21 21:34:10] [INFO ] Flatten gal took : 26 ms
[2024-05-21 21:34:10] [INFO ] Applying decomposition
[2024-05-21 21:34:10] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11873074792424021627.txt' '-o' '/tmp/graph11873074792424021627.bin' '-w' '/tmp/graph11873074792424021627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11873074792424021627.bin' '-l' '-1' '-v' '-w' '/tmp/graph11873074792424021627.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:34:10] [INFO ] Decomposing Gal with order
[2024-05-21 21:34:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:34:10] [INFO ] Removed a total of 1690 redundant transitions.
[2024-05-21 21:34:10] [INFO ] Flatten gal took : 60 ms
[2024-05-21 21:34:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-21 21:34:10] [INFO ] Time to serialize gal into /tmp/LTL12620910276781828940.gal : 7 ms
[2024-05-21 21:34:10] [INFO ] Time to serialize properties into /tmp/LTL3383490666205326317.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12620910276781828940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3383490666205326317.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((i14.u10.Modify_71>=1)||(i11.u12.Modify_6>=1))||((i17.u51.Modify_67>=1)||(i18.u52.Modify_2>=1)))||(((i13.u14.Modify_79>=...35774
Formula 0 simplified : F!"((((((((i14.u10.Modify_71>=1)||(i11.u12.Modify_6>=1))||((i17.u51.Modify_67>=1)||(i18.u52.Modify_2>=1)))||(((i13.u14.Modify_79>=1)...35762
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-14 finished in 297322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 100 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.
// Phase 1: matrix 800 rows 830 cols
[2024-05-21 21:34:26] [INFO ] Computed 130 invariants in 10 ms
[2024-05-21 21:34:26] [INFO ] Implicit Places using invariants in 563 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 565 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 6 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 580 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-15 finished in 744 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))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(p2)))))'
[2024-05-21 21:34:27] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3873548959792081449
[2024-05-21 21:34:27] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2024-05-21 21:34:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:27] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2024-05-21 21:34:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:27] [INFO ] Applying decomposition
[2024-05-21 21:34:27] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15477573907368038779.txt' '-o' '/tmp/graph15477573907368038779.bin' '-w' '/tmp/graph15477573907368038779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15477573907368038779.bin' '-l' '-1' '-v' '-w' '/tmp/graph15477573907368038779.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:34:27] [INFO ] Decomposing Gal with order
[2024-05-21 21:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:34:27] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2024-05-21 21:34:27] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:27] [INFO ] Built C files in 194ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3873548959792081449
Running compilation step : cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 21:34:27] [INFO ] Removed a total of 1689 redundant transitions.
[2024-05-21 21:34:27] [INFO ] Flatten gal took : 66 ms
[2024-05-21 21:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-21 21:34:27] [INFO ] Time to serialize gal into /tmp/LTLFireability6727705633505796171.gal : 11 ms
[2024-05-21 21:34:27] [INFO ] Time to serialize properties into /tmp/LTLFireability474879680449028639.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6727705633505796171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability474879680449028639.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 3 LTL properties
Checking formula 0 : !((G((F("((((((((((((i15.u115.Active_92>=1)&&(i19.u171.Acknowledge_2>=1))&&((i20.u124.Acknowledge_12>=1)&&(i21.u129.Acknowledge_22>=1)...31643
Formula 0 simplified : F(G!"((((((((((((i15.u115.Active_92>=1)&&(i19.u171.Acknowledge_2>=1))&&((i20.u124.Acknowledge_12>=1)&&(i21.u129.Acknowledge_22>=1)))...31635
Compilation finished in 2901 ms.
Running link step : cd /tmp/ltsmin3873548959792081449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp3==true))||[]((<>((LTLAPp0==true))&&<>((LTLAPp4==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-21 21:54:30] [INFO ] Applying decomposition
[2024-05-21 21:54:30] [INFO ] Flatten gal took : 44 ms
[2024-05-21 21:54:30] [INFO ] Decomposing Gal with order
[2024-05-21 21:54:30] [INFO ] Rewriting arrays to variables to allow decomposition.
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp3==true))||[]((<>((LTLAPp0==true))&&<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin3873548959792081449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
[2024-05-21 21:54:30] [INFO ] Removed a total of 2140 redundant transitions.
[2024-05-21 21:54:30] [INFO ] Flatten gal took : 72 ms
[2024-05-21 21:54:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-21 21:54:30] [INFO ] Time to serialize gal into /tmp/LTLFireability7345140486506410460.gal : 7 ms
[2024-05-21 21:54:30] [INFO ] Time to serialize properties into /tmp/LTLFireability67464463412150382.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7345140486506410460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability67464463412150382.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 3 LTL properties
Checking formula 0 : !((G((F("((((((((((((sitefile92.Active_92>=1)&&(sitefile2.Acknowledge_2>=1))&&((sitefile12.Acknowledge_12>=1)&&(sitefile22.Acknowledge...33607
Formula 0 simplified : F(G!"((((((((((((sitefile92.Active_92>=1)&&(sitefile2.Acknowledge_2>=1))&&((sitefile12.Acknowledge_12>=1)&&(sitefile22.Acknowledge_2...33599

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-COL-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 r136-tall-171631131700020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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