Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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-d1m04-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749156287973

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 20:44:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:44:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:44:49] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-06-05 20:44:49] [INFO ] Transformed 1295 places.
[2025-06-05 20:44:49] [INFO ] Transformed 749 transitions.
[2025-06-05 20:44:49] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 64 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 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 286 place count 213 transition count 466
Iterating global reduction 1 with 29 rules applied. Total rules applied 315 place count 213 transition count 466
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 324 place count 213 transition count 457
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 331 place count 206 transition count 450
Iterating global reduction 2 with 7 rules applied. Total rules applied 338 place count 206 transition count 450
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 343 place count 206 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 348 place count 201 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 353 place count 201 transition count 440
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 370 place count 201 transition count 423
Applied a total of 370 rules in 67 ms. Remains 201 /259 variables (removed 58) and now considering 423/749 (removed 326) transitions.
// Phase 1: matrix 423 rows 201 cols
[2025-06-05 20:44:49] [INFO ] Computed 5 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:49] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-05 20:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-05 20:44:50] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-06-05 20:44:50] [INFO ] Invariant cache hit.
[2025-06-05 20:44:50] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:54] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:55] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:56] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:03] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:07] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:07] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:08] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:08] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:10] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Problem TDEAD69 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 10 (OVERLAPS) 423/624 variables, 201/221 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/624 variables, 284/505 constraints. Problems are: Problem set: 32 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/624 variables, and 505 constraints, problems are : Problem set: 32 solved, 390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 201/201 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 3/3 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 6/171 variables, 2/5 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/6 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/7 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 26/197 variables, 2/9 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 11/20 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 422/619 variables, 197/217 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/619 variables, 283/500 constraints. Problems are: Problem set: 32 solved, 390 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 24/524 constraints. Problems are: Problem set: 32 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:38] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 1/525 constraints. Problems are: Problem set: 32 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/624 variables, and 525 constraints, problems are : Problem set: 32 solved, 390 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 197/201 constraints, ReadFeed: 283/284 constraints, PredecessorRefiner: 24/422 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60611ms problems are : Problem set: 32 solved, 390 unsolved
Search for dead transitions found 32 dead transitions in 60624ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 201/259 places, 391/749 transitions.
Reduce places removed 34 places and 204 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 167 transition count 178
Reduce places removed 16 places and 17 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 59 place count 151 transition count 161
Reduce places removed 10 places and 16 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 69 place count 141 transition count 145
Reduce places removed 4 places and 26 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 73 place count 137 transition count 119
Reduce places removed 11 places and 16 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 84 place count 126 transition count 103
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 84 rules in 7 ms. Remains 126 /201 variables (removed 75) and now considering 103/391 (removed 288) transitions.
// Phase 1: matrix 103 rows 126 cols
[2025-06-05 20:45:51] [INFO ] Computed 45 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:51] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-05 20:45:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:51] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-05 20:45:51] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 126/259 places, 103/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62169 ms. Remains : 126/259 places, 103/749 transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Support contains 6 out of 85 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:45:51] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-05 20:45:51] [INFO ] Flatten gal took : 27 ms
[2025-06-05 20:45:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:45:51] [INFO ] Flatten gal took : 24 ms
[2025-06-05 20:45:51] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 3 out of 85 places (down from 6) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8940 resets) in 1140 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1643 steps, run visited all 2 properties in 15 ms. (steps per millisecond=109 )
Probabilistic random walk after 1643 steps, saw 731 distinct states, run finished after 19 ms. (steps per millisecond=86 ) properties seen :2
[2025-06-05 20:45:52] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:45:52] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:45:52] [INFO ] Input system was already deterministic with 103 transitions.
Computed a total of 85 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 103/103 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 83 transition count 102
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 72 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 72 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 29 place count 72 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 64 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 64 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 64 transition count 69
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 54 place count 58 transition count 63
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 58 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 58 transition count 61
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 65 place count 55 transition count 57
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 55 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 55 transition count 55
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 72 place count 53 transition count 53
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 53 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 52 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 52 transition count 51
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 51 transition count 50
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 51 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 50 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 50 transition count 49
Applied a total of 80 rules in 11 ms. Remains 50 /85 variables (removed 35) and now considering 49/103 (removed 54) transitions.
// Phase 1: matrix 49 rows 50 cols
[2025-06-05 20:45:52] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 20:45:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:45:52] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-05 20:45:52] [INFO ] Invariant cache hit.
[2025-06-05 20:45:52] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD46 is UNSAT
At refinement iteration 4 (OVERLAPS) 49/99 variables, 50/53 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 18/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 71 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 49/98 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 18/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 12/82 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/99 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 35/118 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 118 constraints, problems are : Problem set: 1 solved, 47 unsolved in 3550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4938ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 4939ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 50/85 places, 48/103 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 48
Applied a total of 1 rules in 3 ms. Remains 49 /50 variables (removed 1) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 49 cols
[2025-06-05 20:45:57] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-05 20:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:45:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/85 places, 48/103 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5178 ms. Remains : 49/85 places, 48/103 transitions.
[2025-06-05 20:45:57] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:45:57] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:45:57] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-05 20:45:57] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:45:57] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:45:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17719577232919759595.gal : 2 ms
[2025-06-05 20:45:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4219327579168719165.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/CTLFireability17719577232919759595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4219327579168719165.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,693,0.032419,4524,2,596,5,3614,6,0,246,2691,0


Converting to forward existential form...Done !
original formula: EF(AG(!(A(AX(((s1>=1)&&(l157>=1))) U ((s1>=1)&&(l213>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(!((E(!(((s1>=1)&&(l213>=1))) U (!(!(EX(!(((s1>=1)&&(l157>=1)))))) * !(((s1>=1...218
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t21, t22, t34, t36, t37, t38, t39, t40, t41, t42, t45, t46, Intersection with reach...229
(forward)formula 0,1,0.149819,10412,1,0,187,30964,125,83,1607,26306,207
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 103/103 transitions.
Graph (complete) has 264 edges and 85 vertex of which 83 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 83 transition count 102
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 71 transition count 81
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 71 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 30 place count 71 transition count 77
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 39 place count 62 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 48 place count 62 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 62 transition count 66
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 55 transition count 59
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 55 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 55 transition count 56
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 70 place count 52 transition count 52
Iterating global reduction 4 with 3 rules applied. Total rules applied 73 place count 52 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 52 transition count 51
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 76 place count 50 transition count 49
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 49 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 49 transition count 47
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 81 place count 48 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 48 transition count 46
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 83 place count 47 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 84 place count 47 transition count 45
Applied a total of 84 rules in 25 ms. Remains 47 /85 variables (removed 38) and now considering 45/103 (removed 58) transitions.
// Phase 1: matrix 45 rows 47 cols
[2025-06-05 20:45:57] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 20:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:45:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 20:45:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:45:57] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-05 20:45:57] [INFO ] Invariant cache hit.
[2025-06-05 20:45:57] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD42 is UNSAT
At refinement iteration 4 (OVERLAPS) 45/92 variables, 47/50 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 16/66 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 66 constraints, problems are : Problem set: 1 solved, 43 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 45/91 variables, 46/49 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 16/65 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 11/76 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 32/109 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 109 constraints, problems are : Problem set: 1 solved, 43 unsolved in 2676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 43/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3768ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 3768ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 47/85 places, 44/103 transitions.
Graph (complete) has 135 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 46 /47 variables (removed 1) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 46 cols
[2025-06-05 20:46:01] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 20:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 20:46:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/85 places, 44/103 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4000 ms. Remains : 46/85 places, 44/103 transitions.
[2025-06-05 20:46:01] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:46:01] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:46:01] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-05 20:46:01] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:46:01] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:46:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3119262469351855249.gal : 1 ms
[2025-06-05 20:46:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1536183468003439352.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/CTLFireability3119262469351855249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1536183468003439352.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,627,0.019132,4600,2,527,5,3010,6,0,230,2353,0


Converting to forward existential form...Done !
original formula: AG(AF(((s1>=1)&&(l213>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((s1>=1)&&(l213>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/44
(forward)formula 0,0,0.070822,7288,1,0,46,14624,19,2,1167,10520,45
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 103/103 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 83 transition count 102
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 71 transition count 81
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 71 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 71 transition count 77
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 40 place count 62 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 62 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 62 transition count 66
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 58 place count 55 transition count 59
Iterating global reduction 3 with 7 rules applied. Total rules applied 65 place count 55 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 55 transition count 56
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 71 place count 52 transition count 52
Iterating global reduction 4 with 3 rules applied. Total rules applied 74 place count 52 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 52 transition count 51
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 77 place count 50 transition count 49
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 80 place count 49 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 49 transition count 47
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 82 place count 48 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 48 transition count 46
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 84 place count 47 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 47 transition count 45
Applied a total of 85 rules in 12 ms. Remains 47 /85 variables (removed 38) and now considering 45/103 (removed 58) transitions.
// Phase 1: matrix 45 rows 47 cols
[2025-06-05 20:46:01] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 20:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 20:46:01] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-05 20:46:01] [INFO ] Invariant cache hit.
[2025-06-05 20:46:01] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD42 is UNSAT
At refinement iteration 4 (OVERLAPS) 45/92 variables, 47/50 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 16/66 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 66 constraints, problems are : Problem set: 1 solved, 43 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 45/91 variables, 46/49 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 16/65 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 11/76 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 32/109 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 109 constraints, problems are : Problem set: 1 solved, 43 unsolved in 2626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 43/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3675ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 3676ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 47/85 places, 44/103 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 44
Applied a total of 1 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 46 cols
[2025-06-05 20:46:05] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 20:46:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 20:46:05] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/85 places, 44/103 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3906 ms. Remains : 46/85 places, 44/103 transitions.
[2025-06-05 20:46:05] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:46:05] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:46:05] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-05 20:46:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:46:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:46:05] [INFO ] Time to serialize gal into /tmp/CTLFireability18198134023821491306.gal : 0 ms
[2025-06-05 20:46:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10639340635562488119.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/CTLFireability18198134023821491306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10639340635562488119.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,627,0.019448,4592,2,527,5,3010,6,0,230,2353,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.019985,4592,1,0,6,3010,7,1,310,2353,1
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-05 20:46:05] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:46:05] [INFO ] Flatten gal took : 5 ms
Total runtime 76648 ms.

BK_STOP 1749156365853

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-d1m04"
export BK_EXAMINATION="CTLFireability"
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-d1m04, examination is CTLFireability"
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-174901994300402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;