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.r504-tall-171649612400249.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is LamportFastMutEx-COL-8, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612400249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.1K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 44K 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 LamportFastMutEx-COL-8-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717226284188

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:18:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:18: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-06-01 07:18:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 07:18:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2024-06-01 07:18:06] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 07:18:06] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2024-06-01 07:18:06] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40008 steps (8 resets) in 784 ms. (50 steps per ms) remains 39/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 155 ms. (25 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 39/39 properties
// Phase 1: matrix 17 rows 15 cols
[2024-06-01 07:18:06] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 07:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/32 variables, 15/17 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/18 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/18 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/32 variables, 0/18 constraints. Problems are: Problem set: 38 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 18 constraints, problems are : Problem set: 38 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 38 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/17 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/18 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 1/19 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/19 constraints. Problems are: Problem set: 38 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/19 constraints. Problems are: Problem set: 38 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 19 constraints, problems are : Problem set: 38 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 38 solved, 1 unsolved
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 38 atomic propositions for a total of 15 simplifications.
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:18:07] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 07:18:07] [INFO ] Flatten gal took : 16 ms
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:18:07] [INFO ] Flatten gal took : 3 ms
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 07:18:07] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 35 ms.
[2024-06-01 07:18:07] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Support contains 232 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-06-01 07:18:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-06-01 07:18:07] [INFO ] Computed 82 invariants in 17 ms
[2024-06-01 07:18:07] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 07:18:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-06-01 07:18:07] [INFO ] Invariant cache hit.
[2024-06-01 07:18:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 07:18:08] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-06-01 07:18:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-06-01 07:18:08] [INFO ] Invariant cache hit.
[2024-06-01 07:18:08] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 19 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 5 solved, 571 unsolved
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 5 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 12 solved, 564 unsolved
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 4 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 16 solved, 560 unsolved
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 20 solved, 556 unsolved
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 29 solved, 547 unsolved
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/242 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD323 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/682 variables, and 262 constraints, problems are : Problem set: 38 solved, 538 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/266 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 38 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 124/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 3 (OVERLAPS) 8/266 variables, 72/206 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 56/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/282 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/302 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 3 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/322 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/342 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/362 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 20/382 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 20/402 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 20/422 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 20/442 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 20/462 constraints. Problems are: Problem set: 42 solved, 534 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 Int declared 266/682 variables, and 462 constraints, problems are : Problem set: 42 solved, 534 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/266 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/576 constraints, Known Traps: 380/380 constraints]
After SMT, in 60466ms problems are : Problem set: 42 solved, 534 unsolved
Search for dead transitions found 42 dead transitions in 60483ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 266/266 places, 542/584 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61064 ms. Remains : 266/266 places, 542/584 transitions.
Support contains 232 out of 266 places after structural reductions.
[2024-06-01 07:19:08] [INFO ] Flatten gal took : 53 ms
[2024-06-01 07:19:08] [INFO ] Flatten gal took : 49 ms
[2024-06-01 07:19:08] [INFO ] Input system was already deterministic with 542 transitions.
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1435 ms. (27 steps per ms) remains 15/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
[2024-06-01 07:19:09] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-06-01 07:19:09] [INFO ] Computed 82 invariants in 3 ms
[2024-06-01 07:19:09] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 88/232 variables, 72/72 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/72 constraints. Problems are: Problem set: 13 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 387/619 variables, 232/304 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 107/411 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 0/411 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/653 variables, 34/445 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 10/455 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 0/455 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/653 variables, 0/455 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 455 constraints, problems are : Problem set: 13 solved, 2 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 152/232 variables, 72/72 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/72 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 387/619 variables, 232/304 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 107/411 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 0/411 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/653 variables, 34/445 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 10/455 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 2/457 constraints. Problems are: Problem set: 13 solved, 2 unsolved
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 6/463 constraints. Problems are: Problem set: 13 solved, 2 unsolved
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 1/464 constraints. Problems are: Problem set: 13 solved, 2 unsolved
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 2/466 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/653 variables, 0/466 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/653 variables, 0/466 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 466 constraints, problems are : Problem set: 13 solved, 2 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 2/15 constraints, Known Traps: 9/9 constraints]
After SMT, in 2530ms problems are : Problem set: 13 solved, 2 unsolved
Parikh walk visited 0 properties in 308 ms.
Support contains 80 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 542/542 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 266 transition count 534
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 258 transition count 534
Applied a total of 16 rules in 58 ms. Remains 258 /266 variables (removed 8) and now considering 534/542 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 258/266 places, 534/542 transitions.
RANDOM walk for 40000 steps (8 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2024-06-01 07:19:12] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
// Phase 1: matrix 379 rows 258 cols
[2024-06-01 07:19:12] [INFO ] Computed 82 invariants in 7 ms
[2024-06-01 07:19:12] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/224 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/603 variables, 224/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 107/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/637 variables, 34/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 10/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/637 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 258/258 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/224 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/603 variables, 224/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 107/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/637 variables, 34/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 10/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 6/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/637 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 637/637 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 258/258 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 72 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 534/534 transitions.
Applied a total of 0 rules in 30 ms. Remains 258 /258 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 258/258 places, 534/534 transitions.
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1055180 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 1055180 steps, saw 522664 distinct states, run finished after 3004 ms. (steps per millisecond=351 ) properties seen :0
[2024-06-01 07:19:16] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
[2024-06-01 07:19:16] [INFO ] Invariant cache hit.
[2024-06-01 07:19:16] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/224 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/603 variables, 224/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 107/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/637 variables, 34/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 10/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/637 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 258/258 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/224 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/603 variables, 224/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 107/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/637 variables, 34/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 10/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 9/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/637 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 637/637 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 258/258 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1685ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 72 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 534/534 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 534/534 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 534/534 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2024-06-01 07:19:18] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
[2024-06-01 07:19:18] [INFO ] Invariant cache hit.
[2024-06-01 07:19:18] [INFO ] Implicit Places using invariants in 242 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 246 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/258 places, 534/534 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 272 ms. Remains : 250/258 places, 534/534 transitions.
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38654 steps (8 resets) in 95 ms. (402 steps per ms) remains 0/1 properties
Successfully simplified 13 atomic propositions for a total of 7 simplifications.
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 37 ms
[2024-06-01 07:19:19] [INFO ] Input system was already deterministic with 542 transitions.
Support contains 136 out of 266 places (down from 208) after GAL structural reductions.
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 8 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:19:19] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:19:19] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:19:19] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:19:19] [INFO ] Input system was already deterministic with 542 transitions.
RANDOM walk for 1006 steps (0 resets) in 8 ms. (111 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:19:19] [INFO ] Input system was already deterministic with 542 transitions.
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:19:19] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:19:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:19:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 542 transitions and 2392 arcs took 6 ms.
Total runtime 74372 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : LamportFastMutEx-COL-8-CTLCardinality-2024-03
Could not compute solution for formula : LamportFastMutEx-COL-8-CTLCardinality-2024-04
Could not compute solution for formula : LamportFastMutEx-COL-8-CTLCardinality-2024-06
Could not compute solution for formula : LamportFastMutEx-COL-8-CTLCardinality-2024-11

BK_STOP 1717226359924

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name LamportFastMutEx-COL-8-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1768/ctl_0_
ctl formula name LamportFastMutEx-COL-8-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1768/ctl_1_
ctl formula name LamportFastMutEx-COL-8-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1768/ctl_2_
ctl formula name LamportFastMutEx-COL-8-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1768/ctl_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="LamportFastMutEx-COL-8"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-8, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612400249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;