MCC'2024- Execution of r223-tall-171649611000225

About the Execution of GreatSPN+red for LamportFastMutEx-COL-5

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3072.084	278491.00	382343.00	812.20	TTFFFFFFTTTFFFFT	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611000225.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LamportFastMutEx-COL-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611000225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.6K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:41 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 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 41K 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-5-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-5-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716523939059

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 04:12:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 04:12:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:12:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 04:12:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 04:12:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2024-05-24 04:12:20] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-24 04:12:21] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 8 ms.
[2024-05-24 04:12:21] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 15 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 40032 steps (8 resets) in 1071 ms. (37 steps per ms) remains 44/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 04:12:21] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 04:12:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 43 solved, 0 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 43 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 43 atomic propositions for a total of 15 simplifications.
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 04:12:22] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-24 04:12:22] [INFO ] Flatten gal took : 14 ms
[2024-05-24 04:12:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 04:12:22] [INFO ] Flatten gal took : 2 ms
Domain [pid(6), pid(6)] 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-05-24 04:12:22] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 29 ms.
[2024-05-24 04:12:22] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Support contains 105 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-24 04:12:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-05-24 04:12:22] [INFO ] Computed 37 invariants in 7 ms
[2024-05-24 04:12:22] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-24 04:12:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 04:12:22] [INFO ] Invariant cache hit.
[2024-05-24 04:12:22] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-24 04:12:22] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-24 04:12:23] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 04:12:23] [INFO ] Invariant cache hit.
[2024-05-24 04:12:23] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-24 04:12:24] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 13 ms to minimize.
[2024-05-24 04:12:24] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2024-05-24 04:12:24] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-24 04:12:24] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-24 04:12:24] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 11 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 12 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:12:25] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-24 04:12:26] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:12:26] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:12:26] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 8 solved, 247 unsolved
[2024-05-24 04:12:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 04:12:26] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:12:26] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-24 04:12:26] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:12:29] [INFO ] Deduced a trap composed of 13 places in 2943 ms of which 32 ms to minimize.
[2024-05-24 04:12:29] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:12:29] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 04:12:29] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-24 04:12:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-24 04:12:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-24 04:12:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-24 04:12:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-24 04:12:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-24 04:12:30] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 15 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 12 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 29 solved, 226 unsolved
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-24 04:12:31] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 4 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:12:32] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:33] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 6 ms to minimize.
[2024-05-24 04:12:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-24 04:12:33] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:33] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:12:33] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:12:34] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:35] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/117 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:12:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/137 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:12:37] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:12:38] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-24 04:12:38] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:12:38] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:12:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:12:38] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:12:38] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:12:38] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:12:39] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:12:39] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:12:39] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:12:39] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:12:39] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:12:39] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 16/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 200/337 variables, 137/290 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 55/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:45] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:12:45] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/337 variables, 2/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 347 constraints, problems are : Problem set: 30 solved, 225 unsolved in 27735 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 62/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/99 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 56/155 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 16/171 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:12:54] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:12:54] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 3/174 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:54] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 10/184 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:12:56] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:12:57] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:12:57] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:12:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:12:57] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-05-24 04:12:57] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:12:57] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 200/337 variables, 137/341 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 55/396 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 225/621 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:13:03] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:13:03] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:13:03] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:13:03] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:13:04] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:13:04] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:13:04] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:13:04] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:13:04] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 9/630 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:13:09] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:13:09] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:13:09] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:13:10] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:13:11] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:13:11] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:13:11] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:13:11] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 19/649 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 8/657 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 657 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 225/255 constraints, Known Traps: 203/203 constraints]
After SMT, in 57923ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 57956ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 137/137 places, 230/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58344 ms. Remains : 137/137 places, 230/260 transitions.
Support contains 105 out of 137 places after structural reductions.
[2024-05-24 04:13:21] [INFO ] Flatten gal took : 25 ms
[2024-05-24 04:13:21] [INFO ] Flatten gal took : 21 ms
[2024-05-24 04:13:21] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (8 resets) in 1596 ms. (25 steps per ms) remains 14/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 14/14 properties
[2024-05-24 04:13:22] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2024-05-24 04:13:22] [INFO ] Computed 37 invariants in 2 ms
[2024-05-24 04:13:22] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/115 variables, 30/30 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/30 constraints. Problems are: Problem set: 13 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 180/295 variables, 115/145 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 50/195 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/195 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/317 variables, 22/217 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 7/224 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/224 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/224 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 224 constraints, problems are : Problem set: 13 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/115 variables, 30/30 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/30 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 180/295 variables, 115/145 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 50/195 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/195 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/317 variables, 22/217 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 7/224 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/225 constraints. Problems are: Problem set: 13 solved, 1 unsolved
[2024-05-24 04:13:22] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 1/226 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/226 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/226 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 226 constraints, problems are : Problem set: 13 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 422ms problems are : Problem set: 13 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 230/230 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 225
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 220
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 220
Applied a total of 20 rules in 34 ms. Remains 127 /137 variables (removed 10) and now considering 220/230 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 127/137 places, 220/230 transitions.
RANDOM walk for 40000 steps (8 resets) in 396 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1594475 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :0 out of 1
Probabilistic random walk after 1594475 steps, saw 414770 distinct states, run finished after 3004 ms. (steps per millisecond=530 ) properties seen :0
[2024-05-24 04:13:25] [INFO ] Flow matrix only has 170 transitions (discarded 50 similar events)
// Phase 1: matrix 170 rows 127 cols
[2024-05-24 04:13:25] [INFO ] Computed 37 invariants in 4 ms
[2024-05-24 04:13:25] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/105 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 170/275 variables, 105/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 50/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/297 variables, 22/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 127/127 constraints, ReadFeed: 50/50 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/105 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 170/275 variables, 105/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 50/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/297 variables, 22/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:13:25] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 127/127 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 299ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 10 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 220/220 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 127/127 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 220/220 transitions.
Applied a total of 0 rules in 8 ms. Remains 127 /127 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-24 04:13:26] [INFO ] Flow matrix only has 170 transitions (discarded 50 similar events)
[2024-05-24 04:13:26] [INFO ] Invariant cache hit.
[2024-05-24 04:13:26] [INFO ] Implicit Places using invariants in 127 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 129 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/127 places, 220/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 145 ms. Remains : 122/127 places, 220/220 transitions.
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1565357 steps, run timeout after 3001 ms. (steps per millisecond=521 ) properties seen :0 out of 1
Probabilistic random walk after 1565357 steps, saw 410289 distinct states, run finished after 3001 ms. (steps per millisecond=521 ) properties seen :0
[2024-05-24 04:13:29] [INFO ] Flow matrix only has 170 transitions (discarded 50 similar events)
// Phase 1: matrix 170 rows 122 cols
[2024-05-24 04:13:29] [INFO ] Computed 32 invariants in 8 ms
[2024-05-24 04:13:29] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/100 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 25/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/292 variables, 22/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/292 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 122/122 constraints, ReadFeed: 25/25 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/100 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 25/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/292 variables, 22/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:13:29] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/292 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 122/122 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7865 steps, including 441 resets, run visited all 1 properties in 19 ms. (steps per millisecond=413 )
Parikh walk visited 1 properties in 23 ms.
Successfully simplified 13 atomic propositions for a total of 6 simplifications.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 15 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 16 ms
[2024-05-24 04:13:29] [INFO ] Input system was already deterministic with 230 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 14 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 15 ms
[2024-05-24 04:13:29] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 15 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 14 ms
[2024-05-24 04:13:29] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 12 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 12 ms
[2024-05-24 04:13:29] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 225
Applied a total of 10 rules in 13 ms. Remains 132 /137 variables (removed 5) and now considering 225/230 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 132/137 places, 225/230 transitions.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 12 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 12 ms
[2024-05-24 04:13:29] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 16 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 11 ms
[2024-05-24 04:13:29] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 10 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 10 ms
[2024-05-24 04:13:29] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 9 ms
[2024-05-24 04:13:29] [INFO ] Flatten gal took : 9 ms
[2024-05-24 04:13:29] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-24 04:13:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 230 transitions and 1000 arcs took 5 ms.
Total runtime 69822 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-5

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 137
TRANSITIONS: 230
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]

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

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

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

Process ID: 1200
MODEL NAME: /home/mcc/execution/413/model
137 places, 230 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716524217550

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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