Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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 450K 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-d1m18-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749157741199

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-d1m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 21:09:02] [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-05 21:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 21:09:02] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-06-05 21:09:02] [INFO ] Transformed 1295 places.
[2025-06-05 21:09:02] [INFO ] Transformed 749 transitions.
[2025-06-05 21:09:02] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 315 place count 184 transition count 238
Iterating global reduction 1 with 58 rules applied. Total rules applied 373 place count 184 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 379 place count 184 transition count 232
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 419 place count 144 transition count 192
Iterating global reduction 2 with 40 rules applied. Total rules applied 459 place count 144 transition count 192
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 474 place count 144 transition count 177
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 497 place count 121 transition count 154
Iterating global reduction 3 with 23 rules applied. Total rules applied 520 place count 121 transition count 154
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 532 place count 121 transition count 142
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 538 place count 115 transition count 134
Iterating global reduction 4 with 6 rules applied. Total rules applied 544 place count 115 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 550 place count 109 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 556 place count 109 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 559 place count 106 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 562 place count 106 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 563 place count 106 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 566 place count 103 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 569 place count 103 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 571 place count 101 transition count 118
Iterating global reduction 5 with 2 rules applied. Total rules applied 573 place count 101 transition count 118
Applied a total of 573 rules in 80 ms. Remains 101 /259 variables (removed 158) and now considering 118/749 (removed 631) transitions.
// Phase 1: matrix 118 rows 101 cols
[2025-06-05 21:09:02] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:09:03] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-06-05 21:09:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:09:03] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 21:09:03] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-05 21:09:03] [INFO ] Invariant cache hit.
[2025-06-05 21:09:03] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:04] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:04] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/219 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 48/156 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:06] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:07] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:07] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 159 constraints, problems are : Problem set: 0 solved, 117 unsolved in 7754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/219 variables, 101/111 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 48/159 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:17] [INFO ] Deduced a trap along path composed of 4 places in 39 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:19] [INFO ] Deduced a trap along path composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 278 constraints, problems are : Problem set: 0 solved, 117 unsolved in 25176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33070ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 33087ms
Starting structural reductions in LTL mode, iteration 1 : 101/259 places, 118/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33781 ms. Remains : 101/259 places, 118/749 transitions.
Support contains 7 out of 101 places after structural reductions.
[2025-06-05 21:09:36] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2025-06-05 21:09:36] [INFO ] Flatten gal took : 27 ms
[2025-06-05 21:09:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 21:09:36] [INFO ] Flatten gal took : 17 ms
[2025-06-05 21:09:36] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 4 out of 101 places (down from 7) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8899 resets) in 1351 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4177 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4122 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4201 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4179 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 735702 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :1 out of 4
Probabilistic random walk after 735702 steps, saw 325320 distinct states, run finished after 3009 ms. (steps per millisecond=244 ) properties seen :1
[2025-06-05 21:09:40] [INFO ] Invariant cache hit.
[2025-06-05 21:09:40] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/84 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 105/189 variables, 84/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 35/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (OVERLAPS) 30/219 variables, 17/141 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 13/154 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 2 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 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: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/66 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/83 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:40] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 104/187 variables, 83/89 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 34/123 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/219 variables, 18/142 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 14/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/219 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 156 constraints, problems are : Problem set: 2 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 541 steps, including 45 resets, run visited all 1 properties in 4 ms. (steps per millisecond=135 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 21:09:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 21:09:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 21:09:40] [INFO ] Input system was already deterministic with 118 transitions.
Computed a total of 26 stabilizing places and 35 stable transitions
Graph (complete) has 324 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 95 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 91 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 91 transition count 103
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 91 transition count 101
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 87 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 85 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 83 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 45 place count 81 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 77 transition count 81
Applied a total of 55 rules in 16 ms. Remains 77 /101 variables (removed 24) and now considering 81/118 (removed 37) transitions.
// Phase 1: matrix 81 rows 77 cols
[2025-06-05 21:09:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:09:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 21:09:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:09:40] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 21:09:40] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-05 21:09:40] [INFO ] Invariant cache hit.
[2025-06-05 21:09:40] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:41] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:41] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:42] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:42] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:42] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:42] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 121 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/201 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:09:46] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 202 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14797ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 14798ms
Starting structural reductions in LTL mode, iteration 1 : 77/101 places, 81/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15040 ms. Remains : 77/101 places, 81/118 transitions.
[2025-06-05 21:09:55] [INFO ] Flatten gal took : 10 ms
[2025-06-05 21:09:55] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:09:55] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-05 21:09:55] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:09:55] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:09:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality53039936476186167.gal : 2 ms
[2025-06-05 21:09:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16089505769685557130.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/CTLCardinality53039936476186167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16089505769685557130.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99172e+09,5.08694,150532,2,11856,5,640406,6,0,389,407411,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t59, t60, t61, t62, t63, t64, t65, t66, t69, t70, t73, t74, t76, t77, t78, t79, t80, In...250
Detected timeout of ITS tools.
[2025-06-05 21:10:25] [INFO ] Flatten gal took : 7 ms
[2025-06-05 21:10:25] [INFO ] Applying decomposition
[2025-06-05 21:10:25] [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/graph5253572470357437742.txt' '-o' '/tmp/graph5253572470357437742.bin' '-w' '/tmp/graph5253572470357437742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5253572470357437742.bin' '-l' '-1' '-v' '-w' '/tmp/graph5253572470357437742.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:10:25] [INFO ] Decomposing Gal with order
[2025-06-05 21:10:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:10:25] [INFO ] Removed a total of 76 redundant transitions.
[2025-06-05 21:10:25] [INFO ] Flatten gal took : 36 ms
[2025-06-05 21:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 5 ms.
[2025-06-05 21:10:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality11251466549612684472.gal : 3 ms
[2025-06-05 21:10:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality6191714266493572305.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/CTLCardinality11251466549612684472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6191714266493572305.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 : 101/101 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 111
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 97 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 95 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 95 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 93 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 93 transition count 105
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 93 transition count 103
Applied a total of 19 rules in 14 ms. Remains 93 /101 variables (removed 8) and now considering 103/118 (removed 15) transitions.
// Phase 1: matrix 103 rows 93 cols
[2025-06-05 21:10:56] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:10:56] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-05 21:10:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:10:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 21:10:56] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-06-05 21:10:56] [INFO ] Invariant cache hit.
[2025-06-05 21:10:56] [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/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:57] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:57] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/196 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:58] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:59] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:59] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:59] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:59] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:59] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:10:59] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 7/148 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:00] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:00] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 150 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6873 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:03] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/196 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 102/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:07] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:07] [INFO ] Deduced a trap along path composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 255 constraints, problems are : Problem set: 0 solved, 102 unsolved in 19148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 26065ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 26066ms
Starting structural reductions in LTL mode, iteration 1 : 93/101 places, 103/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26420 ms. Remains : 93/101 places, 103/118 transitions.
[2025-06-05 21:11:22] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:11:22] [INFO ] Flatten gal took : 6 ms
[2025-06-05 21:11:22] [INFO ] Input system was already deterministic with 103 transitions.
[2025-06-05 21:11:22] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:11:22] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:11:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16218886016097379845.gal : 1 ms
[2025-06-05 21:11:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality9761091956991273117.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/CTLCardinality16218886016097379845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9761091956991273117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64229e+10,4.7255,133200,2,14155,5,539386,6,0,475,506192,0


Converting to forward existential form...Done !
original formula: EX(EG((AF((p17<=0)) + (p62>0))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(EG(!((p17<=0)))) + (p62>0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t19, t23, t26, t27, t28, t29, t46, t47, t55, t58, t68, t75, t76, t77, t78, t79, t80, t81,...321
(forward)formula 0,1,11.7721,250064,1,0,238,946784,232,98,3362,767146,267
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 95 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 91 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 91 transition count 103
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 91 transition count 101
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 87 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 85 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 83 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 45 place count 81 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 77 transition count 81
Applied a total of 55 rules in 9 ms. Remains 77 /101 variables (removed 24) and now considering 81/118 (removed 37) transitions.
// Phase 1: matrix 81 rows 77 cols
[2025-06-05 21:11:34] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:11:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 21:11:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:11:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 21:11:34] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-05 21:11:34] [INFO ] Invariant cache hit.
[2025-06-05 21:11:34] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:35] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:35] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:36] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:36] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:36] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:36] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:36] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 121 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3804 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/201 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:11:40] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 202 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14814ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 14815ms
Starting structural reductions in LTL mode, iteration 1 : 77/101 places, 81/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15039 ms. Remains : 77/101 places, 81/118 transitions.
[2025-06-05 21:11:49] [INFO ] Flatten gal took : 8 ms
[2025-06-05 21:11:49] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:11:49] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-05 21:11:49] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:11:49] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:11:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality10479009905600644159.gal : 0 ms
[2025-06-05 21:11:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7192097653775845948.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/CTLCardinality10479009905600644159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7192097653775845948.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99172e+09,5.1446,151320,2,11856,5,640406,6,0,389,407411,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t59, t60, t61, t62, t63, t64, t65, t66, t69, t70, t73, t74, t76, t77, t78, t79, t80, In...250
Detected timeout of ITS tools.
[2025-06-05 21:12:19] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:12:19] [INFO ] Applying decomposition
[2025-06-05 21:12:19] [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/graph8432659864539439646.txt' '-o' '/tmp/graph8432659864539439646.bin' '-w' '/tmp/graph8432659864539439646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8432659864539439646.bin' '-l' '-1' '-v' '-w' '/tmp/graph8432659864539439646.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:12:19] [INFO ] Decomposing Gal with order
[2025-06-05 21:12:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:12:19] [INFO ] Removed a total of 77 redundant transitions.
[2025-06-05 21:12:19] [INFO ] Flatten gal took : 10 ms
[2025-06-05 21:12:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 3 ms.
[2025-06-05 21:12:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16418344559560159989.gal : 2 ms
[2025-06-05 21:12:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14271545172399262760.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/CTLCardinality16418344559560159989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14271545172399262760.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 : 101/101 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 95 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 91 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 91 transition count 103
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 91 transition count 101
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 87 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 85 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 83 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 45 place count 81 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 77 transition count 81
Applied a total of 55 rules in 15 ms. Remains 77 /101 variables (removed 24) and now considering 81/118 (removed 37) transitions.
[2025-06-05 21:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:12:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 21:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:12:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 21:12:49] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-05 21:12:49] [INFO ] Invariant cache hit.
[2025-06-05 21:12:49] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:50] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:51] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:51] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:51] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:51] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 121 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3859 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/201 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:55] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 202 constraints, problems are : Problem set: 0 solved, 80 unsolved in 11006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14893ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 14893ms
Starting structural reductions in LTL mode, iteration 1 : 77/101 places, 81/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15149 ms. Remains : 77/101 places, 81/118 transitions.
[2025-06-05 21:13:04] [INFO ] Flatten gal took : 6 ms
[2025-06-05 21:13:04] [INFO ] Flatten gal took : 6 ms
[2025-06-05 21:13:04] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-05 21:13:04] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:13:04] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:13:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality17108935241288538266.gal : 0 ms
[2025-06-05 21:13:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality15862411274424475093.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/CTLCardinality17108935241288538266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15862411274424475093.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99172e+09,5.26629,150828,2,11856,5,640406,6,0,389,407411,0


Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,5.45942,150828,1,0,6,640406,7,1,832,407411,1
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-05 21:13:10] [INFO ] Flatten gal took : 6 ms
[2025-06-05 21:13:10] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:13:10] [INFO ] Applying decomposition
[2025-06-05 21:13:10] [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/graph13417914414873812913.txt' '-o' '/tmp/graph13417914414873812913.bin' '-w' '/tmp/graph13417914414873812913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13417914414873812913.bin' '-l' '-1' '-v' '-w' '/tmp/graph13417914414873812913.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:13:10] [INFO ] Decomposing Gal with order
[2025-06-05 21:13:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:13:10] [INFO ] Removed a total of 113 redundant transitions.
[2025-06-05 21:13:10] [INFO ] Flatten gal took : 11 ms
[2025-06-05 21:13:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 3 ms.
[2025-06-05 21:13:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality6540490869072652200.gal : 2 ms
[2025-06-05 21:13:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality1887736766277656023.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/CTLCardinality6540490869072652200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1887736766277656023.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 2 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.64885e+10,90.8848,1047360,3338,1068,912047,148042,343,6.06163e+06,101,1.0928e+06,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t29, t51, t61, t64, t70, t74, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, t103, t1...343
ITS-tools command line returned an error code 139
[2025-06-05 21:18:48] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:18:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6974837677436903809.gal : 1 ms
[2025-06-05 21:18:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3867836290131740825.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/CTLCardinality6974837677436903809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3867836290131740825.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 2 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.64885e+10,6.47144,171200,2,15798,5,702076,6,0,522,682892,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t24, t27, t28, t29, t30, t32, t33, t51, t52, t53, t61, t64, t74, t87, t88, t89, t90,...350
(forward)formula 0,0,124.121,2214272,1,0,1850,1.1634e+07,13,1167,1745,1.38716e+07,234
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
(forward)formula 1,0,216.06,2436048,1,0,1915,1.328e+07,13,1274,1748,1.6002e+07,260
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Total runtime 803348 ms.

BK_STOP 1749158545753

--------------------
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-d1m18"
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-d1m18, 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-174901994300417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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