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-171649612400247.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-7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612400247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Apr 13 07:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 07:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 13 07:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:34 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.2K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:44 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 43K 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-7-ReachabilityFireability-2024-00
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-01
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-02
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-03
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-04
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-05
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-06
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-07
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-08
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-09
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-10
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-11
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-12
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-13
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-14
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717226218066

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:16:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:16:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:16:59] [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:16:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 07:17:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 653 ms
[2024-06-01 07:17:00] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:17:00] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-06-01 07:17:00] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Remains 1 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 24750 steps (5 resets) in 182 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 07:17:00] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:17:00] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Domain [pid(8), pid(8)] 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:17:00] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 38 ms.
[2024-06-01 07:17:00] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
RANDOM walk for 40000 steps (8 resets) in 1801 ms. (22 steps per ms) remains 1/14 properties
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1698 ms. (23 steps per ms) remains 1/1 properties
[2024-06-01 07:17:01] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2024-06-01 07:17:01] [INFO ] Computed 65 invariants in 12 ms
[2024-06-01 07:17:01] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 336/555 variables, 219/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 91/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 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/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 10 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 336/555 variables, 219/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 91/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2134 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3305ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 198 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 21 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 219/219 places, 462/462 transitions.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1449 ms. (27 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 969169 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 1
Probabilistic random walk after 969169 steps, saw 423059 distinct states, run finished after 3005 ms. (steps per millisecond=322 ) properties seen :0
[2024-06-01 07:17:08] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:17:08] [INFO ] Invariant cache hit.
[2024-06-01 07:17:08] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 336/555 variables, 219/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 91/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 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/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 336/555 variables, 219/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 91/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2270ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 198 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 219/219 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-06-01 07:17:10] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:17:10] [INFO ] Invariant cache hit.
[2024-06-01 07:17:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 07:17:10] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:17:10] [INFO ] Invariant cache hit.
[2024-06-01 07:17:10] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 07:17:10] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-06-01 07:17:10] [INFO ] Redundant transitions in 31 ms returned []
Running 455 sub problems to find dead transitions.
[2024-06-01 07:17:10] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:17:10] [INFO ] Invariant cache hit.
[2024-06-01 07:17:10] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 6 solved, 449 unsolved
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 5 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 9 solved, 446 unsolved
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 17 solved, 438 unsolved
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/165 constraints. Problems are: Problem set: 23 solved, 432 unsolved
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/185 constraints. Problems are: Problem set: 41 solved, 414 unsolved
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/205 constraints. Problems are: Problem set: 41 solved, 414 unsolved
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/225 constraints. Problems are: Problem set: 41 solved, 414 unsolved
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/245 constraints. Problems are: Problem set: 42 solved, 413 unsolved
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/265 constraints. Problems are: Problem set: 42 solved, 413 unsolved
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
SMT process timed out in 30266ms, After SMT, problems are : Problem set: 42 solved, 413 unsolved
Search for dead transitions found 42 dead transitions in 30273ms
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 REACHABILITY mode, iteration 1 : 219/219 places, 420/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-01 07:17:41] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30605 ms. Remains : 219/219 places, 420/462 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1368 ms. (29 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1116678 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :0 out of 1
Probabilistic random walk after 1116678 steps, saw 479535 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
[2024-06-01 07:17:44] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2024-06-01 07:17:44] [INFO ] Computed 65 invariants in 9 ms
[2024-06-01 07:17:44] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 308/527 variables, 219/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 84/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/527 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 84/84 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/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 9 places in 523 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 308/527 variables, 219/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 84/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/527 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2492ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 198 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 219/219 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-01 07:17:47] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-06-01 07:17:47] [INFO ] Invariant cache hit.
[2024-06-01 07:17:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 07:17:47] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-06-01 07:17:47] [INFO ] Invariant cache hit.
[2024-06-01 07:17:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-01 07:17:47] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-06-01 07:17:47] [INFO ] Redundant transitions in 4 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-01 07:17:47] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-06-01 07:17:47] [INFO ] Invariant cache hit.
[2024-06-01 07:17:47] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 5 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/527 variables, and 265 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/84 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 200/200 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/219 variables, 56/172 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 93/265 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 4 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 3 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 4 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/405 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/425 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 20/445 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
SMT process timed out in 60226ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60499 ms. Remains : 219/219 places, 420/420 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 219 transition count 308
Applied a total of 112 rules in 12 ms. Remains 219 /219 variables (removed 0) and now considering 308/420 (removed 112) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 308 rows 219 cols
[2024-06-01 07:18:47] [INFO ] Computed 65 invariants in 6 ms
[2024-06-01 07:18:47] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2024-06-01 07:18:47] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:18:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2024-06-01 07:18:48] [INFO ] After 801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
TRAPS : Iteration 1
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
TRAPS : Iteration 2
[2024-06-01 07:18:51] [INFO ] After 3232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:18:51] [INFO ] After 4020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 4229 ms.
[2024-06-01 07:18:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 07:18:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 420 transitions and 1848 arcs took 6 ms.
[2024-06-01 07:18:52] [INFO ] Flatten gal took : 53 ms
Total runtime 112835 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-7-ReachabilityFireability-2024-04

BK_STOP 1717226332346

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name LamportFastMutEx-COL-7-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/2365/inv_0_
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-7"
export BK_EXAMINATION="ReachabilityFireability"
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-7, examination is ReachabilityFireability"
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-171649612400247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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