fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r114-tall-174876423100625
Last Updated
June 24, 2025

About the Execution of ITS-Tools for LamportFastMutEx-COL-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ??TF?TTTF??F?FT? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423100625.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is LamportFastMutEx-COL-6, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423100625
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-00
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-01
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-02
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-03
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-04
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-05
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-06
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-07
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-08
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-09
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-10
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-11
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-12
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-13
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-14
FORMULA_NAME LamportFastMutEx-COL-6-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748873344421

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-02 14:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 14:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 14:09:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 14:09:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 14:09:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 673 ms
[2025-06-02 14:09:06] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2025-06-02 14:09:06] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2025-06-02 14:09:06] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40003 steps (8 resets) in 1037 ms. (38 steps per ms) remains 31/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
// Phase 1: matrix 17 rows 15 cols
[2025-06-02 14:09:07] [INFO ] Computed 2 invariants in 7 ms
[2025-06-02 14:09:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 31 solved, 0 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 31 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 31 atomic propositions for a total of 15 simplifications.
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 14:09:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-02 14:09:07] [INFO ] Flatten gal took : 17 ms
[2025-06-02 14:09:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 14:09:07] [INFO ] Flatten gal took : 2 ms
Domain [pid(7), pid(7)] 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.
[2025-06-02 14:09:07] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 26 ms.
[2025-06-02 14:09:07] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Support contains 144 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-02 14:09:07] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2025-06-02 14:09:07] [INFO ] Computed 50 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:09:08] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 14:09:08] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 14:09:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:09:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 14:09:08] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-02 14:09:08] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-02 14:09:08] [INFO ] Invariant cache hit.
[2025-06-02 14:09:08] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:09] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 17 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:09] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 8 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:09] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 8 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 7 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 7 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 4 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 5 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 3 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 20/70 constraints. Problems are: Problem set: 31 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:11] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:12] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:13] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/90 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:14] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:14] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:14] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:14] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:14] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:14] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:16] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:16] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:16] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:16] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:16] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/110 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:17] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:18] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:19] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:20] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:20] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:20] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/130 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:20] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:21] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:21] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:21] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:22] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 5/135 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:23] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:23] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/137 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:25] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 1/138 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/138 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 264/440 variables, 176/314 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 72/386 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:30] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:31] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:31] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:31] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:31] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:31] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:31] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:32] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:32] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:32] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 11/397 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/397 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 397 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 68/76 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/76 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 6/176 variables, 42/118 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 31/149 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:39] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:40] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:40] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:40] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 4/153 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:41] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:41] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:42] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:42] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 4/157 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:44] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:44] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 2/159 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/159 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 264/440 variables, 176/335 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 72/407 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 312/719 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:52] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:52] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:52] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:53] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:54] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:54] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:54] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:54] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:54] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 16/735 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:02] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 8/743 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 743 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 312/348 constraints, Known Traps: 133/133 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 36 solved, 312 unsolved
Search for dead transitions found 36 dead transitions in 60182ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/176 places, 318/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60562 ms. Remains : 176/176 places, 318/354 transitions.
Support contains 144 out of 176 places after structural reductions.
[2025-06-02 14:10:08] [INFO ] Flatten gal took : 44 ms
[2025-06-02 14:10:08] [INFO ] Flatten gal took : 26 ms
[2025-06-02 14:10:08] [INFO ] Input system was already deterministic with 318 transitions.
RANDOM walk for 40000 steps (8 resets) in 1245 ms. (32 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
[2025-06-02 14:10:09] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
// Phase 1: matrix 240 rows 176 cols
[2025-06-02 14:10:09] [INFO ] Computed 50 invariants in 5 ms
[2025-06-02 14:10:09] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/150 variables, 42/42 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 13 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 240/390 variables, 150/192 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 66/258 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/258 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/416 variables, 26/284 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 8/292 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/292 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/292 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 292 constraints, problems are : Problem set: 13 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/150 variables, 42/42 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 240/390 variables, 150/192 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 66/258 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/258 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/416 variables, 26/284 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 8/292 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 1/293 constraints. Problems are: Problem set: 13 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:10] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:10] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:10] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 5 ms to minimize.
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Int declared 416/416 variables, and 301 constraints, problems are : Problem set: 14 solved, 0 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/14 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1087ms problems are : Problem set: 14 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 14 atomic propositions for a total of 8 simplifications.
[2025-06-02 14:10:10] [INFO ] Flatten gal took : 20 ms
[2025-06-02 14:10:10] [INFO ] Flatten gal took : 21 ms
[2025-06-02 14:10:10] [INFO ] Input system was already deterministic with 318 transitions.
Support contains 126 out of 176 places (down from 132) after GAL structural reductions.
FORMULA LamportFastMutEx-COL-6-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 6 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 312
Applied a total of 12 rules in 53 ms. Remains 170 /176 variables (removed 6) and now considering 312/318 (removed 6) transitions.
[2025-06-02 14:10:10] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
// Phase 1: matrix 234 rows 170 cols
[2025-06-02 14:10:10] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:10:10] [INFO ] Implicit Places using invariants in 168 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 170 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 164/176 places, 312/318 transitions.
Applied a total of 0 rules in 14 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 237 ms. Remains : 164/176 places, 312/318 transitions.
[2025-06-02 14:10:10] [INFO ] Flatten gal took : 33 ms
[2025-06-02 14:10:10] [INFO ] Flatten gal took : 18 ms
[2025-06-02 14:10:10] [INFO ] Input system was already deterministic with 312 transitions.
[2025-06-02 14:10:10] [INFO ] Flatten gal took : 20 ms
[2025-06-02 14:10:10] [INFO ] Flatten gal took : 16 ms
[2025-06-02 14:10:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14619321377732758742.gal : 8 ms
[2025-06-02 14:10:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality12785176078991033022.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14619321377732758742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12785176078991033022.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:10:40] [INFO ] Flatten gal took : 17 ms
[2025-06-02 14:10:40] [INFO ] Applying decomposition
[2025-06-02 14:10:40] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6813101551895841391.txt' '-o' '/tmp/graph6813101551895841391.bin' '-w' '/tmp/graph6813101551895841391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6813101551895841391.bin' '-l' '-1' '-v' '-w' '/tmp/graph6813101551895841391.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:10:41] [INFO ] Decomposing Gal with order
[2025-06-02 14:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:10:41] [INFO ] Removed a total of 310 redundant transitions.
[2025-06-02 14:10:41] [INFO ] Flatten gal took : 73 ms
[2025-06-02 14:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 16 ms.
[2025-06-02 14:10:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality13661582562640373940.gal : 14 ms
[2025-06-02 14:10:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7190945490233127509.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13661582562640373940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7190945490233127509.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 14 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-02 14:11:11] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
// Phase 1: matrix 240 rows 176 cols
[2025-06-02 14:11:11] [INFO ] Computed 50 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:11:11] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 14:11:11] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
[2025-06-02 14:11:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:11:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 14:11:11] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2025-06-02 14:11:11] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
[2025-06-02 14:11:11] [INFO ] Invariant cache hit.
[2025-06-02 14:11:11] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 6/176 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:14] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:14] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:14] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:15] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:16] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:16] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:16] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:16] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:16] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:16] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:17] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:17] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:17] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:17] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:18] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:19] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:20] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:20] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:20] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:20] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:20] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:21] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:22] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:22] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:22] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:22] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:22] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:22] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:23] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:23] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:23] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:24] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:25] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:25] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:25] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:25] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:27] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:27] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:27] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:27] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:27] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:28] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:28] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:28] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 240/416 variables, 176/316 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 66/382 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:34] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:34] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:35] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:36] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:40] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:41] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/416 variables, and 388 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 6/176 variables, 42/116 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 30/146 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:43] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 240/416 variables, 176/323 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 66/389 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 312/701 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:51] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:51] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:51] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:52] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:52] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:52] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:53] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:54] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:54] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:11:54] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 19/720 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:12:03] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:12:11] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:12:11] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:12:11] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:12:11] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:12:11] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:12:11] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 727 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in LTL mode , in 1 iterations and 60616 ms. Remains : 176/176 places, 318/318 transitions.
[2025-06-02 14:12:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:12:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:12:12] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 14:12:12] [INFO ] Flatten gal took : 14 ms
[2025-06-02 14:12:12] [INFO ] Flatten gal took : 12 ms
[2025-06-02 14:12:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16959811944297235705.gal : 2 ms
[2025-06-02 14:12:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality8183526092674549969.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16959811944297235705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8183526092674549969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:12:42] [INFO ] Flatten gal took : 14 ms
[2025-06-02 14:12:42] [INFO ] Applying decomposition
[2025-06-02 14:12:42] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13968359594229488318.txt' '-o' '/tmp/graph13968359594229488318.bin' '-w' '/tmp/graph13968359594229488318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13968359594229488318.bin' '-l' '-1' '-v' '-w' '/tmp/graph13968359594229488318.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:12:42] [INFO ] Decomposing Gal with order
[2025-06-02 14:12:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:12:42] [INFO ] Removed a total of 382 redundant transitions.
[2025-06-02 14:12:42] [INFO ] Flatten gal took : 31 ms
[2025-06-02 14:12:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 9 ms.
[2025-06-02 14:12:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality10328532401873373199.gal : 3 ms
[2025-06-02 14:12:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17777619641280361784.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10328532401873373199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17777619641280361784.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 312
Applied a total of 12 rules in 23 ms. Remains 170 /176 variables (removed 6) and now considering 312/318 (removed 6) transitions.
[2025-06-02 14:13:12] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
// Phase 1: matrix 234 rows 170 cols
[2025-06-02 14:13:12] [INFO ] Computed 50 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:13:12] [INFO ] Implicit Places using invariants in 146 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 147 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 164/176 places, 312/318 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 164 transition count 306
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 158 transition count 306
Applied a total of 12 rules in 17 ms. Remains 158 /164 variables (removed 6) and now considering 306/312 (removed 6) transitions.
[2025-06-02 14:13:12] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
// Phase 1: matrix 228 rows 158 cols
[2025-06-02 14:13:12] [INFO ] Computed 44 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:13:12] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 14:13:12] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2025-06-02 14:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:13:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 14:13:12] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 158/176 places, 306/318 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 594 ms. Remains : 158/176 places, 306/318 transitions.
[2025-06-02 14:13:12] [INFO ] Flatten gal took : 22 ms
[2025-06-02 14:13:13] [INFO ] Flatten gal took : 11 ms
[2025-06-02 14:13:13] [INFO ] Input system was already deterministic with 306 transitions.
[2025-06-02 14:13:13] [INFO ] Flatten gal took : 10 ms
[2025-06-02 14:13:13] [INFO ] Flatten gal took : 10 ms
[2025-06-02 14:13:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality4184012115243065686.gal : 2 ms
[2025-06-02 14:13:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality11181310715732538272.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4184012115243065686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11181310715732538272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:13:43] [INFO ] Flatten gal took : 9 ms
[2025-06-02 14:13:43] [INFO ] Applying decomposition
[2025-06-02 14:13:43] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13649575570528392593.txt' '-o' '/tmp/graph13649575570528392593.bin' '-w' '/tmp/graph13649575570528392593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13649575570528392593.bin' '-l' '-1' '-v' '-w' '/tmp/graph13649575570528392593.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:13:43] [INFO ] Decomposing Gal with order
[2025-06-02 14:13:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:13:43] [INFO ] Removed a total of 366 redundant transitions.
[2025-06-02 14:13:43] [INFO ] Flatten gal took : 18 ms
[2025-06-02 14:13:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 9 ms.
[2025-06-02 14:13:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17753608772965482147.gal : 3 ms
[2025-06-02 14:13:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality658295276542301431.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17753608772965482147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality658295276542301431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-02 14:14:13] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
// Phase 1: matrix 240 rows 176 cols
[2025-06-02 14:14:13] [INFO ] Computed 50 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:14:13] [INFO ] Implicit Places using invariants in 137 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 151 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 318/318 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 170/176 places, 318/318 transitions.
[2025-06-02 14:14:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 14:14:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 14:14:13] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 14:14:13] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:14:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 14:14:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality16824413237241607480.gal : 2 ms
[2025-06-02 14:14:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10547397481997247570.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16824413237241607480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10547397481997247570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:14:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:14:43] [INFO ] Applying decomposition
[2025-06-02 14:14:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7205667519730936036.txt' '-o' '/tmp/graph7205667519730936036.bin' '-w' '/tmp/graph7205667519730936036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7205667519730936036.bin' '-l' '-1' '-v' '-w' '/tmp/graph7205667519730936036.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:14:43] [INFO ] Decomposing Gal with order
[2025-06-02 14:14:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:14:43] [INFO ] Removed a total of 371 redundant transitions.
[2025-06-02 14:14:43] [INFO ] Flatten gal took : 28 ms
[2025-06-02 14:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 16 ms.
[2025-06-02 14:14:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5330104681544772345.gal : 4 ms
[2025-06-02 14:14:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality567134094757881279.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5330104681544772345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality567134094757881279.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-02 14:15:13] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
[2025-06-02 14:15:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:15:13] [INFO ] Implicit Places using invariants in 154 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 167 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 318/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 170/176 places, 318/318 transitions.
[2025-06-02 14:15:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:15:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:15:14] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 14:15:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:15:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:15:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality2760008845233265759.gal : 2 ms
[2025-06-02 14:15:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4673714007717503966.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2760008845233265759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4673714007717503966.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:15:44] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:15:44] [INFO ] Applying decomposition
[2025-06-02 14:15:44] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15250432509611632661.txt' '-o' '/tmp/graph15250432509611632661.bin' '-w' '/tmp/graph15250432509611632661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15250432509611632661.bin' '-l' '-1' '-v' '-w' '/tmp/graph15250432509611632661.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:15:44] [INFO ] Decomposing Gal with order
[2025-06-02 14:15:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:15:44] [INFO ] Removed a total of 312 redundant transitions.
[2025-06-02 14:15:44] [INFO ] Flatten gal took : 19 ms
[2025-06-02 14:15:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 3 ms.
[2025-06-02 14:15:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16454179454221322697.gal : 2 ms
[2025-06-02 14:15:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality14892868913904692209.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16454179454221322697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14892868913904692209.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-02 14:16:14] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
[2025-06-02 14:16:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:16:14] [INFO ] Implicit Places using invariants in 171 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 172 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 318/318 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 170/176 places, 318/318 transitions.
[2025-06-02 14:16:14] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:16:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:16:14] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 14:16:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:16:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:16:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1870590385223204353.gal : 1 ms
[2025-06-02 14:16:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8327247967074977672.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1870590385223204353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8327247967074977672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:16:44] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:16:44] [INFO ] Applying decomposition
[2025-06-02 14:16:44] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18004676620981619518.txt' '-o' '/tmp/graph18004676620981619518.bin' '-w' '/tmp/graph18004676620981619518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18004676620981619518.bin' '-l' '-1' '-v' '-w' '/tmp/graph18004676620981619518.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:16:44] [INFO ] Decomposing Gal with order
[2025-06-02 14:16:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:16:44] [INFO ] Removed a total of 371 redundant transitions.
[2025-06-02 14:16:44] [INFO ] Flatten gal took : 19 ms
[2025-06-02 14:16:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 5 ms.
[2025-06-02 14:16:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12401366282886168396.gal : 2 ms
[2025-06-02 14:16:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5282927618931551060.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12401366282886168396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5282927618931551060.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-02 14:17:14] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
[2025-06-02 14:17:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:17:14] [INFO ] Implicit Places using invariants in 125 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 140 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 318/318 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 170/176 places, 318/318 transitions.
[2025-06-02 14:17:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:17:14] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:17:14] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 14:17:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:17:14] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:17:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality11455762803848292802.gal : 4 ms
[2025-06-02 14:17:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8529734068682968593.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11455762803848292802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8529734068682968593.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:17:44] [INFO ] Flatten gal took : 7 ms
[2025-06-02 14:17:44] [INFO ] Applying decomposition
[2025-06-02 14:17:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3615679276719779271.txt' '-o' '/tmp/graph3615679276719779271.bin' '-w' '/tmp/graph3615679276719779271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3615679276719779271.bin' '-l' '-1' '-v' '-w' '/tmp/graph3615679276719779271.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:17:45] [INFO ] Decomposing Gal with order
[2025-06-02 14:17:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:17:45] [INFO ] Removed a total of 321 redundant transitions.
[2025-06-02 14:17:45] [INFO ] Flatten gal took : 19 ms
[2025-06-02 14:17:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 6 ms.
[2025-06-02 14:17:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2852783377334957356.gal : 2 ms
[2025-06-02 14:17:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12580013912764326852.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2852783377334957356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12580013912764326852.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:18:15] [INFO ] Flatten gal took : 12 ms
[2025-06-02 14:18:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:18:15] [INFO ] Applying decomposition
[2025-06-02 14:18:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9793329384271464460.txt' '-o' '/tmp/graph9793329384271464460.bin' '-w' '/tmp/graph9793329384271464460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9793329384271464460.bin' '-l' '-1' '-v' '-w' '/tmp/graph9793329384271464460.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:18:15] [INFO ] Decomposing Gal with order
[2025-06-02 14:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:18:15] [INFO ] Removed a total of 506 redundant transitions.
[2025-06-02 14:18:15] [INFO ] Flatten gal took : 24 ms
[2025-06-02 14:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-06-02 14:18:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality13796256744730901218.gal : 2 ms
[2025-06-02 14:18:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4349620723211882402.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13796256744730901218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4349620723211882402.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 14:41:21] [INFO ] Applying decomposition
[2025-06-02 14:41:21] [INFO ] Flatten gal took : 173 ms
[2025-06-02 14:41:21] [INFO ] Decomposing Gal with order
[2025-06-02 14:41:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:41:22] [INFO ] Removed a total of 488 redundant transitions.
[2025-06-02 14:41:22] [INFO ] Flatten gal took : 325 ms
[2025-06-02 14:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 35 ms.
[2025-06-02 14:41:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8704228307138960234.gal : 46 ms
[2025-06-02 14:41:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality17205502986127136208.ctl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8704228307138960234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17205502986127136208.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:04:31] [INFO ] Flatten gal took : 198 ms
[2025-06-02 15:04:31] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 15:04:32] [INFO ] Transformed 176 places.
[2025-06-02 15:04:32] [INFO ] Transformed 318 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 15:04:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2105146723332566032.gal : 11 ms
[2025-06-02 15:04:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17422132842317640815.ctl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2105146723332566032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17422132842317640815.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-6, 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 r114-tall-174876423100625"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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