Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400473.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 SieveSingleMsgMbox-PT-d2m36, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749181871972

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 03:51:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 03:51:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 03:51:13] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2025-06-06 03:51:13] [INFO ] Transformed 2398 places.
[2025-06-06 03:51:13] [INFO ] Transformed 1954 transitions.
[2025-06-06 03:51:13] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 1984 places in 27 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 969 place count 273 transition count 393
Iterating global reduction 1 with 116 rules applied. Total rules applied 1085 place count 273 transition count 393
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1095 place count 273 transition count 383
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 1184 place count 184 transition count 294
Iterating global reduction 2 with 89 rules applied. Total rules applied 1273 place count 184 transition count 294
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1306 place count 184 transition count 261
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1342 place count 148 transition count 213
Iterating global reduction 3 with 36 rules applied. Total rules applied 1378 place count 148 transition count 213
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1403 place count 148 transition count 188
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1409 place count 142 transition count 179
Iterating global reduction 4 with 6 rules applied. Total rules applied 1415 place count 142 transition count 179
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1421 place count 136 transition count 173
Iterating global reduction 4 with 6 rules applied. Total rules applied 1427 place count 136 transition count 173
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1430 place count 133 transition count 169
Iterating global reduction 4 with 3 rules applied. Total rules applied 1433 place count 133 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1435 place count 133 transition count 167
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1438 place count 130 transition count 164
Iterating global reduction 5 with 3 rules applied. Total rules applied 1441 place count 130 transition count 164
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1443 place count 128 transition count 162
Iterating global reduction 5 with 2 rules applied. Total rules applied 1445 place count 128 transition count 162
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1446 place count 127 transition count 161
Iterating global reduction 5 with 1 rules applied. Total rules applied 1447 place count 127 transition count 161
Applied a total of 1447 rules in 105 ms. Remains 127 /414 variables (removed 287) and now considering 161/1954 (removed 1793) transitions.
// Phase 1: matrix 161 rows 127 cols
[2025-06-06 03:51:13] [INFO ] Computed 5 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:51:14] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-06 03:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:51:14] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 03:51:14] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-06 03:51:14] [INFO ] Invariant cache hit.
[2025-06-06 03:51:14] [INFO ] State equation strengthened by 70 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:51:18] [INFO ] Deduced a trap composed of 38 places in 1831 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:51:18] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 161/288 variables, 127/134 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 70/204 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 160 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/288 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 204 constraints, problems are : Problem set: 0 solved, 160 unsolved in 16103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 127/127 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 161/288 variables, 127/134 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 70/204 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 160/364 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:51:38] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:51:39] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:51:39] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 4 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 3/367 constraints. Problems are: Problem set: 3 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:51:49] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:51:50] [INFO ] Deduced a trap along path composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 2/369 constraints. Problems are: Problem set: 3 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/288 variables, and 369 constraints, problems are : Problem set: 3 solved, 157 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 127/127 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46360ms problems are : Problem set: 3 solved, 157 unsolved
Search for dead transitions found 3 dead transitions in 46375ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 127/414 places, 158/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 158
Applied a total of 3 rules in 3 ms. Remains 124 /127 variables (removed 3) and now considering 158/158 (removed 0) transitions.
// Phase 1: matrix 158 rows 124 cols
[2025-06-06 03:52:01] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:01] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-06 03:52:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:01] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 03:52:01] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/414 places, 158/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47894 ms. Remains : 124/414 places, 158/1954 transitions.
Support contains 5 out of 124 places after structural reductions.
[2025-06-06 03:52:01] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-06 03:52:01] [INFO ] Flatten gal took : 31 ms
[2025-06-06 03:52:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 03:52:01] [INFO ] Flatten gal took : 14 ms
[2025-06-06 03:52:01] [INFO ] Input system was already deterministic with 158 transitions.
Support contains 2 out of 124 places (down from 5) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8920 resets) in 1374 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4088 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4175 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1008653 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 2
Probabilistic random walk after 1008653 steps, saw 419372 distinct states, run finished after 3005 ms. (steps per millisecond=335 ) properties seen :0
[2025-06-06 03:52:05] [INFO ] Invariant cache hit.
[2025-06-06 03:52:05] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/95 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 128/223 variables, 95/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 39/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/282 variables, 29/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 30/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/282 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 197 constraints, problems are : Problem set: 1 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/63 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/70 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/95 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/223 variables, 95/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 39/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/282 variables, 29/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 30/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/282 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 198 constraints, problems are : Problem set: 1 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 158/158 transitions.
Graph (complete) has 367 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 123 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 119 transition count 141
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 119 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 119 transition count 140
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 115 transition count 135
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 115 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 115 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 111 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 111 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 111 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 35 place count 108 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 108 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 41 place count 105 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 44 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 46 place count 103 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 103 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 102 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 101 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 100 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 99 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 99 transition count 110
Applied a total of 56 rules in 41 ms. Remains 99 /124 variables (removed 25) and now considering 110/158 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 99/124 places, 110/158 transitions.
RANDOM walk for 40000 steps (8952 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4172 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2811532 steps, run timeout after 3001 ms. (steps per millisecond=936 ) properties seen :0 out of 1
Probabilistic random walk after 2811532 steps, saw 1238814 distinct states, run finished after 3001 ms. (steps per millisecond=936 ) properties seen :0
// Phase 1: matrix 110 rows 99 cols
[2025-06-06 03:52:09] [INFO ] Computed 3 invariants in 4 ms
[2025-06-06 03:52:09] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/55 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/123 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 43/166 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 24/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 43/209 variables, 25/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 18/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/55 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/123 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 43/166 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 24/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 43/209 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 18/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 189 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 99/99 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-06-06 03:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:09] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-06 03:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-06 03:52:09] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:52:09] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-06 03:52:09] [INFO ] Invariant cache hit.
[2025-06-06 03:52:09] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 5 (OVERLAPS) 110/209 variables, 99/102 constraints. Problems are: Problem set: 3 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 42/144 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 144 constraints, problems are : Problem set: 3 solved, 106 unsolved in 4257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 109/205 variables, 96/99 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 41/140 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 13/153 constraints. Problems are: Problem set: 3 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:52:15] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/154 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 4/209 variables, 3/157 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 93/251 constraints. Problems are: Problem set: 3 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:52:22] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 1/252 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/252 constraints. Problems are: Problem set: 3 solved, 106 unsolved
At refinement iteration 15 (OVERLAPS) 0/209 variables, 0/252 constraints. Problems are: Problem set: 3 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 252 constraints, problems are : Problem set: 3 solved, 106 unsolved in 26325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 106/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30674ms problems are : Problem set: 3 solved, 106 unsolved
Search for dead transitions found 3 dead transitions in 30675ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/99 places, 107/110 transitions.
Graph (complete) has 273 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 96 /99 variables (removed 3) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 96 cols
[2025-06-06 03:52:40] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 03:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 03:52:40] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/99 places, 107/110 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31226 ms. Remains : 96/99 places, 107/110 transitions.
RANDOM walk for 40000 steps (8975 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4190 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3051855 steps, run timeout after 3001 ms. (steps per millisecond=1016 ) properties seen :0 out of 1
Probabilistic random walk after 3051855 steps, saw 1344574 distinct states, run finished after 3001 ms. (steps per millisecond=1016 ) properties seen :0
[2025-06-06 03:52:43] [INFO ] Invariant cache hit.
[2025-06-06 03:52:43] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/123 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/163 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 24/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/203 variables, 23/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 17/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:52:43] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/123 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/163 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 24/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/203 variables, 23/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/203 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 116 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 96/96 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 03:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:44] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 03:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:52:44] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 03:52:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:52:44] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-06 03:52:44] [INFO ] Invariant cache hit.
[2025-06-06 03:52:44] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 140 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3464 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 106/246 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:52:52] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:53:03] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/203 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/203 variables, and 248 constraints, problems are : Problem set: 0 solved, 106 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33516ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 33516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33773 ms. Remains : 96/96 places, 107/107 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 96 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 90 transition count 99
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 14 place count 90 transition count 84
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 44 place count 75 transition count 84
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 70 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 69 transition count 88
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 69 transition count 88
Applied a total of 57 rules in 15 ms. Remains 69 /96 variables (removed 27) and now considering 88/107 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 69 cols
[2025-06-06 03:53:17] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 03:53:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 03:53:17] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-06 03:53:18] [INFO ] After 68ms 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-06-06 03:53:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 03:53:18] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-06 03:53:18] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:53:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:53:18] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:53:18] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 5 ms to minimize.
[2025-06-06 03:53:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
TRAPS : Iteration 1
[2025-06-06 03:53:18] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 03:53:18] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 338 ms.
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 03:53:18] [INFO ] Flatten gal took : 9 ms
[2025-06-06 03:53:18] [INFO ] Flatten gal took : 9 ms
[2025-06-06 03:53:18] [INFO ] Input system was already deterministic with 158 transitions.
Computed a total of 35 stabilizing places and 46 stable transitions
Graph (complete) has 409 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 158/158 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 142
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 116 transition count 137
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 116 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 116 transition count 135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 112 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 112 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 112 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 109 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 109 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 106 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 106 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 43 place count 104 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 104 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 103 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 103 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 102 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 101 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 100 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 100 transition count 112
Applied a total of 53 rules in 13 ms. Remains 100 /124 variables (removed 24) and now considering 112/158 (removed 46) transitions.
// Phase 1: matrix 112 rows 100 cols
[2025-06-06 03:53:18] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:53:18] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 03:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:53:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 03:53:18] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2025-06-06 03:53:18] [INFO ] Invariant cache hit.
[2025-06-06 03:53:18] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 5 (OVERLAPS) 112/212 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 44/148 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 148 constraints, problems are : Problem set: 3 solved, 108 unsolved in 4310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 2/99 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 112/211 variables, 99/103 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 44/147 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 16/163 constraints. Problems are: Problem set: 3 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:53:25] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 1/164 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 1/212 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 92/257 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/257 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 15 (OVERLAPS) 0/212 variables, 0/257 constraints. Problems are: Problem set: 3 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 257 constraints, problems are : Problem set: 3 solved, 108 unsolved in 23747 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 108/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28103ms problems are : Problem set: 3 solved, 108 unsolved
Search for dead transitions found 3 dead transitions in 28104ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 100/124 places, 109/158 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 109
Applied a total of 3 rules in 5 ms. Remains 97 /100 variables (removed 3) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-06-06 03:53:46] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:53:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 03:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:53:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 03:53:46] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/124 places, 109/158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28667 ms. Remains : 97/124 places, 109/158 transitions.
[2025-06-06 03:53:47] [INFO ] Flatten gal took : 10 ms
[2025-06-06 03:53:47] [INFO ] Flatten gal took : 6 ms
[2025-06-06 03:53:47] [INFO ] Input system was already deterministic with 109 transitions.
[2025-06-06 03:53:47] [INFO ] Flatten gal took : 5 ms
[2025-06-06 03:53:47] [INFO ] Flatten gal took : 6 ms
[2025-06-06 03:53:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11163115106391867315.gal : 3 ms
[2025-06-06 03:53:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10120811722249639004.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/CTLCardinality11163115106391867315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10120811722249639004.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 03:54:17] [INFO ] Flatten gal took : 7 ms
[2025-06-06 03:54:17] [INFO ] Applying decomposition
[2025-06-06 03:54:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8934511930946713747.txt' '-o' '/tmp/graph8934511930946713747.bin' '-w' '/tmp/graph8934511930946713747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8934511930946713747.bin' '-l' '-1' '-v' '-w' '/tmp/graph8934511930946713747.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:54:17] [INFO ] Decomposing Gal with order
[2025-06-06 03:54:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:54:17] [INFO ] Removed a total of 97 redundant transitions.
[2025-06-06 03:54:17] [INFO ] Flatten gal took : 40 ms
[2025-06-06 03:54:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 7 ms.
[2025-06-06 03:54:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13428608032973237186.gal : 4 ms
[2025-06-06 03:54:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality13157121818255277320.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/CTLCardinality13428608032973237186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13157121818255277320.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 158/158 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 114 transition count 133
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 114 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 114 transition count 131
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 109 transition count 123
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 109 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 109 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 39 place count 106 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 106 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 103 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 103 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 100 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 100 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 100 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 57 place count 98 transition count 109
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 97 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 96 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 95 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 95 transition count 104
Applied a total of 65 rules in 16 ms. Remains 95 /124 variables (removed 29) and now considering 104/158 (removed 54) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 03:54:47] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:54:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 03:54:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:54:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 03:54:47] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 03:54:47] [INFO ] Invariant cache hit.
[2025-06-06 03:54:47] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3864 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:54:54] [INFO ] Deduced a trap along path composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:55:06] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33907ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 33909ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/124 places, 101/158 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 1 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 03:55:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:55:21] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 03:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:55:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 03:55:21] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/124 places, 101/158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34472 ms. Remains : 92/124 places, 101/158 transitions.
[2025-06-06 03:55:21] [INFO ] Flatten gal took : 7 ms
[2025-06-06 03:55:21] [INFO ] Flatten gal took : 6 ms
[2025-06-06 03:55:21] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 03:55:21] [INFO ] Flatten gal took : 5 ms
[2025-06-06 03:55:21] [INFO ] Flatten gal took : 4 ms
[2025-06-06 03:55:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality18445464961531531596.gal : 1 ms
[2025-06-06 03:55:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality17574233966930611446.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/CTLCardinality18445464961531531596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17574233966930611446.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 03:55:51] [INFO ] Flatten gal took : 5 ms
[2025-06-06 03:55:51] [INFO ] Applying decomposition
[2025-06-06 03:55:51] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15081593541584503347.txt' '-o' '/tmp/graph15081593541584503347.bin' '-w' '/tmp/graph15081593541584503347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15081593541584503347.bin' '-l' '-1' '-v' '-w' '/tmp/graph15081593541584503347.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:55:51] [INFO ] Decomposing Gal with order
[2025-06-06 03:55:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:55:51] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-06 03:55:51] [INFO ] Flatten gal took : 12 ms
[2025-06-06 03:55:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2025-06-06 03:55:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10275254364294029618.gal : 4 ms
[2025-06-06 03:55:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7415925418155554974.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/CTLCardinality10275254364294029618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7415925418155554974.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 158/158 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 114 transition count 133
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 114 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 114 transition count 131
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 109 transition count 123
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 109 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 109 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 39 place count 106 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 106 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 103 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 103 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 100 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 100 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 100 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 57 place count 98 transition count 109
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 97 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 96 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 95 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 95 transition count 104
Applied a total of 65 rules in 10 ms. Remains 95 /124 variables (removed 29) and now considering 104/158 (removed 54) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 03:56:22] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:56:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 03:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:56:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 03:56:22] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 03:56:22] [INFO ] Invariant cache hit.
[2025-06-06 03:56:22] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 4019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:56:28] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:56:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34068ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 34069ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/124 places, 101/158 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 1 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 03:56:56] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:56:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 03:56:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:56:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 03:56:56] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/124 places, 101/158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34614 ms. Remains : 92/124 places, 101/158 transitions.
[2025-06-06 03:56:56] [INFO ] Flatten gal took : 6 ms
[2025-06-06 03:56:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 03:56:56] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 03:56:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 03:56:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 03:56:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality953439857093405038.gal : 2 ms
[2025-06-06 03:56:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9806674968482178373.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/CTLCardinality953439857093405038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9806674968482178373.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 03:57:26] [INFO ] Flatten gal took : 4 ms
[2025-06-06 03:57:26] [INFO ] Applying decomposition
[2025-06-06 03:57:26] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4581838057836723134.txt' '-o' '/tmp/graph4581838057836723134.bin' '-w' '/tmp/graph4581838057836723134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4581838057836723134.bin' '-l' '-1' '-v' '-w' '/tmp/graph4581838057836723134.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:57:26] [INFO ] Decomposing Gal with order
[2025-06-06 03:57:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:57:26] [INFO ] Removed a total of 104 redundant transitions.
[2025-06-06 03:57:26] [INFO ] Flatten gal took : 10 ms
[2025-06-06 03:57:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 3 ms.
[2025-06-06 03:57:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality5039311624326905658.gal : 2 ms
[2025-06-06 03:57:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9167938154511113000.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/CTLCardinality5039311624326905658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9167938154511113000.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 03:57:56] [INFO ] Flatten gal took : 6 ms
[2025-06-06 03:57:56] [INFO ] Flatten gal took : 8 ms
[2025-06-06 03:57:56] [INFO ] Applying decomposition
[2025-06-06 03:57:56] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2812574745005240645.txt' '-o' '/tmp/graph2812574745005240645.bin' '-w' '/tmp/graph2812574745005240645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2812574745005240645.bin' '-l' '-1' '-v' '-w' '/tmp/graph2812574745005240645.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:57:56] [INFO ] Decomposing Gal with order
[2025-06-06 03:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:57:56] [INFO ] Removed a total of 137 redundant transitions.
[2025-06-06 03:57:56] [INFO ] Flatten gal took : 14 ms
[2025-06-06 03:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2025-06-06 03:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality8842991103457456925.gal : 2 ms
[2025-06-06 03:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5692889962093984151.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/CTLCardinality8842991103457456925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5692889962093984151.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 04:20:11] [INFO ] Flatten gal took : 7 ms
[2025-06-06 04:20:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5898986758681580586.gal : 1 ms
[2025-06-06 04:20:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12525285394949190097.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/CTLCardinality5898986758681580586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12525285394949190097.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 3 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,7.79262e+15,362.861,5755744,2,51112,5,2.22657e+07,6,0,654,1.90234e+07,0


Converting to forward existential form...Done !
original formula: EX((l1705<10))
=> equivalent forward existential formula: [(EY(Init) * (l1705<10))] != FALSE
(forward)formula 0,1,362.899,5755744,1,0,8,2.22657e+07,8,1,884,1.90234e+07,2
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(AX(AF(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EG(!(EX(TRUE)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t22, t27, t59, t62, t63, t64, t65, t74, t79, t80, t81, t84, t86, t87, t100, t101, t1...439
Using saturation style SCC detection
(forward)formula 1,1,379.243,5755744,1,0,293,2.22657e+07,324,115,4769,1.90234e+07,358
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(TRUE)))] = FALSE
(forward)formula 2,1,379.243,5755744,1,0,293,2.22657e+07,324,116,4769,1.90234e+07,358
FORMULA SieveSingleMsgMbox-PT-d2m36-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Total runtime 2120269 ms.

BK_STOP 1749183993569

--------------------
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="SieveSingleMsgMbox-PT-d2m36"
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 SieveSingleMsgMbox-PT-d2m36, 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 r212-tall-174901994400473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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