Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063700193.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 Dekker-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063700193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 Dekker-PT-050-CTLCardinality-2023-12
FORMULA_NAME Dekker-PT-050-CTLCardinality-2023-13
FORMULA_NAME Dekker-PT-050-CTLCardinality-2023-14
FORMULA_NAME Dekker-PT-050-CTLCardinality-2023-15
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-00
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-01
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-02
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-03
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-04
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-05
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-06
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-07
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-08
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-09
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-10
FORMULA_NAME Dekker-PT-050-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748641159247

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 21:39:21] [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-05-30 21:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 21:39:22] [INFO ] Load time of PNML (sax parser for PT used): 737 ms
[2025-05-30 21:39:22] [INFO ] Transformed 250 places.
[2025-05-30 21:39:22] [INFO ] Transformed 2600 transitions.
[2025-05-30 21:39:22] [INFO ] Found NUPN structural information;
[2025-05-30 21:39:22] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 1011 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
FORMULA Dekker-PT-050-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 132 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:39:22] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2025-05-30 21:39:22] [INFO ] Computed 150 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:39:24] [INFO ] Implicit Places using invariants in 2123 ms returned [103, 109, 112, 115, 118, 121, 124, 130, 133, 136, 145, 148, 151, 154, 157, 169, 172, 178, 184, 187, 190, 193, 196, 202, 205, 211, 214, 217, 223, 226, 229, 241, 247]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 2191 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 217/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 29 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2384 ms. Remains : 217/250 places, 2600/2600 transitions.
Support contains 83 out of 217 places after structural reductions.
[2025-05-30 21:39:25] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-30 21:39:25] [INFO ] Flatten gal took : 360 ms
FORMULA Dekker-PT-050-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 21:39:25] [INFO ] Flatten gal took : 222 ms
[2025-05-30 21:39:26] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 67 out of 217 places (down from 83) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (8 resets) in 2525 ms. (15 steps per ms) remains 9/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
[2025-05-30 21:39:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 217 cols
[2025-05-30 21:39:27] [INFO ] Computed 117 invariants in 4 ms
[2025-05-30 21:39:27] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 32/47 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 9/56 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/61 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 56/117 variables, 61/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 72/189 variables, 50/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 192/381 variables, 120/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/381 variables, 120/445 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/381 variables, 24/469 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 36/417 variables, 48/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 36/553 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 12/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/417 variables, 36/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/417 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/417 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 601 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1015 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 217/217 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 32/47 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:29] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 8/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 9/56 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:31] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:32] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:32] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 15/127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 5/61 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/61 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/61 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 56/117 variables, 61/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 72/189 variables, 50/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 192/381 variables, 120/368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/381 variables, 120/488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/381 variables, 24/512 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/381 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:33] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:33] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:33] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:33] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:33] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:33] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:33] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 4 ms to minimize.
SMT process timed out in 6156ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 6 properties in 552 ms.
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 245 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 217/217 places, 2600/2600 transitions.
RANDOM walk for 40000 steps (8 resets) in 993 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 438855 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 438855 steps, saw 360086 distinct states, run finished after 3008 ms. (steps per millisecond=145 ) properties seen :0
[2025-05-30 21:39:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:39:38] [INFO ] Invariant cache hit.
[2025-05-30 21:39:38] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/17 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/41 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/41 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/131 variables, 50/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/131 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 241/372 variables, 151/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 151/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 29/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/372 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 45/417 variables, 61/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 45/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 16/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/417 variables, 45/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/417 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/417 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 217/217 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/17 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:38] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/20 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:38] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/21 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/21 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/41 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/41 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 90/131 variables, 50/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/131 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 241/372 variables, 151/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/372 variables, 151/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/372 variables, 29/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/372 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:39] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 10/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 45/417 variables, 61/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/417 variables, 45/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/417 variables, 16/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/417 variables, 45/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/417 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/417 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1556 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 217/217 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1872ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 388 ms.
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 143 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 217/217 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 124 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:39:40] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:39:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:39:41] [INFO ] Implicit Places using invariants in 1221 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1226 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 81 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1432 ms. Remains : 200/217 places, 2600/2600 transitions.
RANDOM walk for 40000 steps (8 resets) in 702 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 569772 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569772 steps, saw 465562 distinct states, run finished after 3003 ms. (steps per millisecond=189 ) properties seen :0
[2025-05-30 21:39:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2025-05-30 21:39:45] [INFO ] Computed 100 invariants in 4 ms
[2025-05-30 21:39:45] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/20 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/40 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 90/130 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 225/355 variables, 135/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 135/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 45/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 45/400 variables, 45/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 45/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 45/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/400 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:45] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:45] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:45] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/20 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/40 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 90/130 variables, 50/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 225/355 variables, 135/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 135/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 45/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:46] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:47] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:39:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/355 variables, 13/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 45/400 variables, 45/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/400 variables, 45/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/400 variables, 45/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/400 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/400 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 569 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1804 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2087ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 84 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 200/200 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 83 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:39:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:39:48] [INFO ] Implicit Places using invariants in 819 ms returned []
[2025-05-30 21:39:48] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:39:48] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 21:39:49] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:39:49] [INFO ] Redundant transitions in 285 ms returned []
Running 2550 sub problems to find dead transitions.
[2025-05-30 21:39:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:39:49] [INFO ] Invariant cache hit.
[2025-05-30 21:39:49] [INFO ] State equation strengthened by 50 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/400 variables, and 340 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30121 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 0/200 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2550/2500 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 40/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:27] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:29] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:32] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:32] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:32] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:32] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:33] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:36] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:36] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:36] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:41] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:41] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:41] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:41] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:44] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:44] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:45] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:46] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:47] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:48] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:49] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:50] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:40:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/400 variables, and 454 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30052 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 0/200 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 50/2500 constraints, Known Traps: 154/154 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61657ms problems are : Problem set: 0 solved, 2550 unsolved
Search for dead transitions found 0 dead transitions in 61699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63853 ms. Remains : 200/200 places, 2600/2600 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 300 edges and 200 vertex of which 20 are kept as prefixes of interest. Removing 180 places using SCC suffix rule.2 ms
Discarding 180 places :
Also discarding 2340 output transitions
Drop transitions (Output transitions of discarded places.) removed 2340 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 20 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 250 place count 14 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 253 place count 14 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 254 place count 14 transition count 13
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 257 place count 12 transition count 12
Applied a total of 257 rules in 40 ms. Remains 12 /200 variables (removed 188) and now considering 12/2600 (removed 2588) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 12 cols
[2025-05-30 21:40:51] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 21:40:51] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 21:40:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-30 21:40:51] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 21:40:51] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 21:40:51] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 138 ms.
[2025-05-30 21:40:51] [INFO ] Flatten gal took : 139 ms
[2025-05-30 21:40:51] [INFO ] Flatten gal took : 139 ms
[2025-05-30 21:40:52] [INFO ] Input system was already deterministic with 2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:40:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 217 cols
[2025-05-30 21:40:52] [INFO ] Computed 117 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:40:53] [INFO ] Implicit Places using invariants in 964 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 970 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 26 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1014 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:40:53] [INFO ] Flatten gal took : 161 ms
[2025-05-30 21:40:53] [INFO ] Flatten gal took : 163 ms
[2025-05-30 21:40:53] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:40:53] [INFO ] Flatten gal took : 102 ms
[2025-05-30 21:40:54] [INFO ] Flatten gal took : 162 ms
[2025-05-30 21:40:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14705171987505216029.gal : 103 ms
[2025-05-30 21:40:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality12935104863893950512.ctl : 3 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/CTLCardinality14705171987505216029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12935104863893950512.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.33626,36060,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EF((EG(AX(FALSE)) * EX((((((p3_31==1)||(p3_14==0))||(p1_15==1))&&(flag_0_43==0))&&(p3_1==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EG(!(EX(!(FALSE)))))) * (((((p3_31==1)||(p3_14==0))||(p1_15==1))&&(flag_0_43==0))&&(p3_1...171
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,7.12473,150972,1,0,5261,975925,5223,2604,35334,476612,5209
FORMULA Dekker-PT-050-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 323 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:41:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:41:02] [INFO ] Implicit Places using invariants in 1098 ms returned [100, 105, 129, 132, 148, 151, 158, 163, 183, 192, 204, 207, 212]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1103 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 204/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 121 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1550 ms. Remains : 204/217 places, 2600/2600 transitions.
[2025-05-30 21:41:03] [INFO ] Flatten gal took : 91 ms
[2025-05-30 21:41:03] [INFO ] Flatten gal took : 109 ms
[2025-05-30 21:41:03] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:41:03] [INFO ] Flatten gal took : 101 ms
[2025-05-30 21:41:03] [INFO ] Flatten gal took : 102 ms
[2025-05-30 21:41:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2067818959792218362.gal : 22 ms
[2025-05-30 21:41:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality5069858126246571916.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/CTLCardinality2067818959792218362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5069858126246571916.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.41573,36216,2,658,5,47919,6,0,3419,15196,0


Converting to forward existential form...Done !
original formula: AF((AF((((((((p0_44==0)&&(p1_20==1))||(p3_0==0))||(p3_28==1))&&(p3_35==0))&&((p0_33==1)&&(flag_1_21==0)))&&(((flag_1_8==1)&&(p1_41==0))&&...234
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((((((p0_44==0)&&(p1_20==1))||(p3_0==0))||(p3_28==1))&&(p3_35==0))&&((p0_33==1)&&(flag_1_2...291
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,8.25579,166204,1,0,5266,1.10478e+06,5234,2610,35884,541886,5225
FORMULA Dekker-PT-050-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 24 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:41:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:41:13] [INFO ] Implicit Places using invariants in 1048 ms returned [100, 105, 120, 129, 145, 148, 151, 158, 163, 176, 183, 192, 201, 207, 212]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1058 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1102 ms. Remains : 202/217 places, 2600/2600 transitions.
[2025-05-30 21:41:13] [INFO ] Flatten gal took : 80 ms
[2025-05-30 21:41:13] [INFO ] Flatten gal took : 107 ms
[2025-05-30 21:41:13] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:41:13] [INFO ] Flatten gal took : 116 ms
[2025-05-30 21:41:13] [INFO ] Flatten gal took : 95 ms
[2025-05-30 21:41:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality15938730528277839945.gal : 27 ms
[2025-05-30 21:41:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality8752249510532512772.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/CTLCardinality15938730528277839945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8752249510532512772.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.42802,36168,2,650,5,47376,6,0,3411,15058,0


Converting to forward existential form...Done !
original formula: AX(EG(EX(((EX(((p0_14==0)||(p1_41==1))) * EF(((p3_35==0)||(p0_45==1)))) * EX(((p1_5==0)&&(p1_33==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX(((EX(((p0_14==0)||(p1_41==1))) * E(TRUE U ((p3_35==0)||(p0_45==1)))) * EX(((p1_5==0)&&(p1_3...176
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.52036,166484,1,0,5274,1.10496e+06,5231,2614,35906,542203,5233
FORMULA Dekker-PT-050-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 115 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:41:22] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:41:23] [INFO ] Implicit Places using invariants in 893 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 899 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 115 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1131 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:41:23] [INFO ] Flatten gal took : 83 ms
[2025-05-30 21:41:23] [INFO ] Flatten gal took : 93 ms
[2025-05-30 21:41:23] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:41:24] [INFO ] Flatten gal took : 98 ms
[2025-05-30 21:41:24] [INFO ] Flatten gal took : 99 ms
[2025-05-30 21:41:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality180375538351006195.gal : 15 ms
[2025-05-30 21:41:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12657346597281404718.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/CTLCardinality180375538351006195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12657346597281404718.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.43126,36104,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AG(EF((flag_1_29==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (flag_1_29==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,7.40282,151004,1,0,5260,1.00307e+06,5221,2602,35278,483892,5210
FORMULA Dekker-PT-050-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:41:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:41:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:41:32] [INFO ] Implicit Places using invariants in 964 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 201, 204, 207, 212]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 968 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 23 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1006 ms. Remains : 201/217 places, 2600/2600 transitions.
[2025-05-30 21:41:32] [INFO ] Flatten gal took : 148 ms
[2025-05-30 21:41:32] [INFO ] Flatten gal took : 164 ms
[2025-05-30 21:41:33] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:41:33] [INFO ] Flatten gal took : 156 ms
[2025-05-30 21:41:33] [INFO ] Flatten gal took : 135 ms
[2025-05-30 21:41:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9528737856379294647.gal : 22 ms
[2025-05-30 21:41:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11917281288497748039.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/CTLCardinality9528737856379294647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11917281288497748039.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.20553,35992,2,646,5,47154,6,0,3407,14998,0


Converting to forward existential form...Done !
original formula: EF((EX(((((p0_40==0)||(p1_43==1))&&(flag_0_35==0)) * (EG((flag_1_31==1)) * EX(((flag_0_27==0)&&(flag_1_34==1)))))) * AX(((flag_1_48==0)&&...169
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(((((p0_40==0)||(p1_43==1))&&(flag_0_35==0)) * (EG((flag_1_31==1)) * EX(((flag_0_27==0)&&...227
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,6.84089,152016,1,0,5260,998801,5217,2603,35289,488078,5207
FORMULA Dekker-PT-050-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 22 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:41:40] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:41:41] [INFO ] Implicit Places using invariants in 1266 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1269 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1307 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:41:41] [INFO ] Flatten gal took : 94 ms
[2025-05-30 21:41:41] [INFO ] Flatten gal took : 87 ms
[2025-05-30 21:41:42] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:41:42] [INFO ] Flatten gal took : 103 ms
[2025-05-30 21:41:42] [INFO ] Flatten gal took : 105 ms
[2025-05-30 21:41:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7482763495200246278.gal : 13 ms
[2025-05-30 21:41:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14266084202546956830.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/CTLCardinality7482763495200246278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14266084202546956830.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.13219,35972,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AX((((flag_1_37==1)||(p3_12==1)) + EX((((flag_0_37==0)||(p3_20==1)) * AX(EF((flag_1_5==1)))))))
=> equivalent forward existential formula: [((EY(Init) * !(((flag_1_37==1)||(p3_12==1)))) * !(EX((((flag_0_37==0)||(p3_20==1)) * !(EX(!(E(TRUE U (flag_1_5=...175
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,7.1302,151248,1,0,5263,1.01796e+06,5222,2605,35370,493657,5215
FORMULA Dekker-PT-050-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 94 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:41:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:41:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:41:50] [INFO ] Implicit Places using invariants in 1072 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1076 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 156 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1327 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:41:50] [INFO ] Flatten gal took : 137 ms
[2025-05-30 21:41:51] [INFO ] Flatten gal took : 155 ms
[2025-05-30 21:41:51] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:41:51] [INFO ] Flatten gal took : 157 ms
[2025-05-30 21:41:51] [INFO ] Flatten gal took : 135 ms
[2025-05-30 21:41:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12602958288465369743.gal : 21 ms
[2025-05-30 21:41:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality11032343096118750927.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/CTLCardinality12602958288465369743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11032343096118750927.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.37466,36104,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EF(AG(((p3_47==0)||((flag_0_37==0)&&(p1_11==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p3_47==0)||((flag_0_37==0)&&(p1_11==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,7.05251,151176,1,0,5262,1.00678e+06,5222,2604,35293,487534,5213
FORMULA Dekker-PT-050-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:41:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:41:59] [INFO ] Implicit Places using invariants in 1042 ms returned [100, 105, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 22 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1083 ms. Remains : 201/217 places, 2600/2600 transitions.
[2025-05-30 21:42:00] [INFO ] Flatten gal took : 142 ms
[2025-05-30 21:42:00] [INFO ] Flatten gal took : 152 ms
[2025-05-30 21:42:00] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:42:00] [INFO ] Flatten gal took : 134 ms
[2025-05-30 21:42:00] [INFO ] Flatten gal took : 97 ms
[2025-05-30 21:42:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8228819472679826159.gal : 14 ms
[2025-05-30 21:42:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality5905504742304878207.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/CTLCardinality8228819472679826159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5905504742304878207.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.26313,36140,2,646,5,46813,6,0,3407,14936,0


Converting to forward existential form...Done !
original formula: AF(EX((((flag_1_44==1) * EF((((p0_9==0)||(p3_43==1))||((p1_27==0)||(p3_14==1))))) * AF((p1_13==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((flag_1_44==1) * E(TRUE U (((p0_9==0)||(p3_43==1))||((p1_27==0)||(p3_14==1))))) * !(EG(!((p1_1...176
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,16.0072,311164,1,0,5369,2.2175e+06,5234,2711,35583,974506,5326
FORMULA Dekker-PT-050-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:42:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:42:17] [INFO ] Implicit Places using invariants in 924 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 928 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 955 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:42:17] [INFO ] Flatten gal took : 86 ms
[2025-05-30 21:42:18] [INFO ] Flatten gal took : 100 ms
[2025-05-30 21:42:18] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:42:18] [INFO ] Flatten gal took : 101 ms
[2025-05-30 21:42:18] [INFO ] Flatten gal took : 113 ms
[2025-05-30 21:42:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality1243957129202086005.gal : 14 ms
[2025-05-30 21:42:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5507954616421748625.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/CTLCardinality1243957129202086005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5507954616421748625.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.30713,36112,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p1_22==0)||(p1_15==1))) * AF((p3_44==1))) * (AG(A(((flag_1_13==0)||(flag_0_39==1)) U ((flag_1_40==0)||(p1_43==1)))) * AX(((EG((...299
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (!(EG(!(((p1_22==0)||(p1_15==1))))) * !(EG(!((p3_44==1)))))) * !(E(TRUE U !(!((E(!(((flag_...529
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,20.1155,394764,1,0,5534,2.30488e+06,5238,2823,35335,1.19082e+06,5495
FORMULA Dekker-PT-050-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 19 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:42:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:42:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:42:40] [INFO ] Implicit Places using invariants in 1452 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1457 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 25 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1502 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:42:40] [INFO ] Flatten gal took : 131 ms
[2025-05-30 21:42:40] [INFO ] Flatten gal took : 152 ms
[2025-05-30 21:42:40] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:42:41] [INFO ] Flatten gal took : 166 ms
[2025-05-30 21:42:41] [INFO ] Flatten gal took : 136 ms
[2025-05-30 21:42:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality12127594891714791765.gal : 23 ms
[2025-05-30 21:42:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1031704446181118676.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12127594891714791765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1031704446181118676.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.46695,36104,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AF(!(A((p3_14==1) U EX(((AG(((flag_1_31==0)||(p1_31==1))) * ((flag_0_38==0)||(p1_47==1))) * ((p1_36==0)||(p1_7==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(EX(((!(E(TRUE U !(((flag_1_31==0)||(p1_31==1))))) * ((flag_0_38==0)||(p1_47==1))) * ((p1_3...442
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,8.12795,154784,1,0,5265,1.03726e+06,5233,2608,35544,502990,5226
FORMULA Dekker-PT-050-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 23 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:42:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:42:50] [INFO ] Implicit Places using invariants in 1359 ms returned [100, 120, 132, 145, 151, 176, 183, 192, 201, 204, 207, 212]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1365 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 25 ms. Remains 205 /205 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1414 ms. Remains : 205/217 places, 2600/2600 transitions.
[2025-05-30 21:42:50] [INFO ] Flatten gal took : 128 ms
[2025-05-30 21:42:51] [INFO ] Flatten gal took : 148 ms
[2025-05-30 21:42:51] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:42:51] [INFO ] Flatten gal took : 179 ms
[2025-05-30 21:42:51] [INFO ] Flatten gal took : 94 ms
[2025-05-30 21:42:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5910782516687830480.gal : 14 ms
[2025-05-30 21:42:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7122200754465841137.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/CTLCardinality5910782516687830480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7122200754465841137.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.64885,36260,2,662,5,47734,6,0,3423,15182,0


Converting to forward existential form...Done !
original formula: (EX(EX((!(A((p0_21==1) U ((p0_13==0)||(flag_0_40==1)))) + (p3_13==1)))) + AF(!(E(((E((p1_37==1) U (p0_2==1)) * EX(TRUE)) * (p0_27!=1)) U ...173
=> equivalent forward existential formula: [FwdG((Init * !(EX(EX((!(!((E(!(((p0_13==0)||(flag_0_40==1))) U (!((p0_21==1)) * !(((p0_13==0)||(flag_0_40==1)))...312
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,9.38138,184260,1,0,5294,1.1739e+06,5247,2633,35654,610387,5266
FORMULA Dekker-PT-050-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:43:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:43:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:43:02] [INFO ] Implicit Places using invariants in 1452 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1457 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 23 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1496 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:43:02] [INFO ] Flatten gal took : 125 ms
[2025-05-30 21:43:02] [INFO ] Flatten gal took : 186 ms
[2025-05-30 21:43:03] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:43:03] [INFO ] Flatten gal took : 159 ms
[2025-05-30 21:43:03] [INFO ] Flatten gal took : 150 ms
[2025-05-30 21:43:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15323892799213579309.gal : 22 ms
[2025-05-30 21:43:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6046192020182575960.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/CTLCardinality15323892799213579309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6046192020182575960.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.37982,36108,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EX(EX((flag_1_5==1)))
=> equivalent forward existential formula: [(EY(EY(Init)) * (flag_1_5==1))] != FALSE
(forward)formula 0,1,1.61425,36108,1,0,10,46701,8,1,7823,14896,3
FORMULA Dekker-PT-050-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 217 /217 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:43:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:43:06] [INFO ] Implicit Places using invariants in 1228 ms returned [100, 105, 120, 129, 132, 145, 148, 151, 158, 163, 176, 183, 192, 201, 204, 207, 212]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1245 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/217 places, 2600/2600 transitions.
Applied a total of 0 rules in 24 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1286 ms. Remains : 200/217 places, 2600/2600 transitions.
[2025-05-30 21:43:06] [INFO ] Flatten gal took : 130 ms
[2025-05-30 21:43:06] [INFO ] Flatten gal took : 154 ms
[2025-05-30 21:43:07] [INFO ] Input system was already deterministic with 2600 transitions.
[2025-05-30 21:43:07] [INFO ] Flatten gal took : 143 ms
[2025-05-30 21:43:07] [INFO ] Flatten gal took : 147 ms
[2025-05-30 21:43:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality15769506766249641504.gal : 23 ms
[2025-05-30 21:43:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6112997590633775282.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/CTLCardinality15769506766249641504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6112997590633775282.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,1.38967,36108,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AG(AX(AX(((p3_5==0)&&(flag_1_9==0)))))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,TRUE))) * !(((p3_5==0)&&(flag_1_9==0))))] = FALSE
(forward)formula 0,0,1.7157,36108,1,0,8,47453,9,2,7879,16182,2
FORMULA Dekker-PT-050-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-05-30 21:43:09] [INFO ] Flatten gal took : 155 ms
[2025-05-30 21:43:09] [INFO ] Flatten gal took : 145 ms
Total runtime 228095 ms.

BK_STOP 1748641389479

--------------------
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="Dekker-PT-050"
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 Dekker-PT-050, 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 r058-smll-174854063700193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 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 ;