About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d2m64
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 337622.00 | 0.00 | 0.00 | TFTTTTFTFFTFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400483.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-d2m64, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400483
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749190244845
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 06:10:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 06:10:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 06:10:46] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-06-06 06:10:46] [INFO ] Transformed 2398 places.
[2025-06-06 06:10:46] [INFO ] Transformed 1954 transitions.
[2025-06-06 06:10:46] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 27 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 971 place count 271 transition count 375
Iterating global reduction 1 with 118 rules applied. Total rules applied 1089 place count 271 transition count 375
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1099 place count 271 transition count 365
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1190 place count 180 transition count 274
Iterating global reduction 2 with 91 rules applied. Total rules applied 1281 place count 180 transition count 274
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1316 place count 180 transition count 239
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1354 place count 142 transition count 187
Iterating global reduction 3 with 38 rules applied. Total rules applied 1392 place count 142 transition count 187
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1415 place count 142 transition count 164
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1423 place count 134 transition count 152
Iterating global reduction 4 with 8 rules applied. Total rules applied 1431 place count 134 transition count 152
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1439 place count 126 transition count 144
Iterating global reduction 4 with 8 rules applied. Total rules applied 1447 place count 126 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1451 place count 122 transition count 139
Iterating global reduction 4 with 4 rules applied. Total rules applied 1455 place count 122 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1456 place count 122 transition count 138
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1460 place count 118 transition count 134
Iterating global reduction 5 with 4 rules applied. Total rules applied 1464 place count 118 transition count 134
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1467 place count 115 transition count 131
Iterating global reduction 5 with 3 rules applied. Total rules applied 1470 place count 115 transition count 131
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1471 place count 114 transition count 130
Iterating global reduction 5 with 1 rules applied. Total rules applied 1472 place count 114 transition count 130
Applied a total of 1472 rules in 92 ms. Remains 114 /414 variables (removed 300) and now considering 130/1954 (removed 1824) transitions.
// Phase 1: matrix 130 rows 114 cols
[2025-06-06 06:10:46] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:10:46] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-06-06 06:10:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:10:46] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-06 06:10:47] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-06-06 06:10:47] [INFO ] Invariant cache hit.
[2025-06-06 06:10:47] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:10:49] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:10:49] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/244 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 50/171 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 171 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8692 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/244 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 50/171 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 129/300 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:00] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:00] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:00] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/303 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 303 constraints, problems are : Problem set: 3 solved, 126 unsolved in 26855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35718ms problems are : Problem set: 3 solved, 126 unsolved
Search for dead transitions found 3 dead transitions in 35740ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 114/414 places, 127/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 127
Applied a total of 3 rules in 3 ms. Remains 111 /114 variables (removed 3) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 111 cols
[2025-06-06 06:11:23] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:11:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-06 06:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:11:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-06 06:11:23] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/414 places, 127/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36917 ms. Remains : 111/414 places, 127/1954 transitions.
Support contains 2 out of 111 places after structural reductions.
[2025-06-06 06:11:23] [INFO ] Flatten gal took : 26 ms
[2025-06-06 06:11:23] [INFO ] Flatten gal took : 12 ms
[2025-06-06 06:11:23] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 40000 steps (8948 resets) in 1122 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4062 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4143 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2515983 steps, run timeout after 3001 ms. (steps per millisecond=838 ) properties seen :1 out of 2
Probabilistic random walk after 2515983 steps, saw 1236489 distinct states, run finished after 3006 ms. (steps per millisecond=836 ) properties seen :1
[2025-06-06 06:11:27] [INFO ] Invariant cache hit.
[2025-06-06 06:11:27] [INFO ] State equation strengthened by 49 read => feed constraints.
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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/84 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 110/194 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/238 variables, 27/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/84 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:27] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 110/194 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/238 variables, 27/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:27] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/238 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 127/127 transitions.
Graph (complete) has 316 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 109 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 108 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 108 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 107 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 106 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 105 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 105 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 104 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 104 transition count 116
Applied a total of 17 rules in 30 ms. Remains 104 /111 variables (removed 7) and now considering 116/127 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 104/111 places, 116/127 transitions.
RANDOM walk for 40000 steps (8923 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4085 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2846757 steps, run timeout after 3014 ms. (steps per millisecond=944 ) properties seen :0 out of 1
Probabilistic random walk after 2846757 steps, saw 1323375 distinct states, run finished after 3015 ms. (steps per millisecond=944 ) properties seen :0
// Phase 1: matrix 116 rows 104 cols
[2025-06-06 06:11:30] [INFO ] Computed 3 invariants in 5 ms
[2025-06-06 06:11:30] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/63 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/140 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/181 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/220 variables, 23/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 16/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/63 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/140 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:30] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/181 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 39/220 variables, 23/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 16/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/220 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 104/104 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2025-06-06 06:11:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:11:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 06:11:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:11:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 06:11:31] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:11:31] [INFO ] Redundant transitions in 4 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-06 06:11:31] [INFO ] Invariant cache hit.
[2025-06-06 06:11:31] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 4 (OVERLAPS) 116/220 variables, 104/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 43/150 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 150 constraints, problems are : Problem set: 3 solved, 112 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 112 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: 3 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 115/216 variables, 101/104 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 42/146 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 14/160 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:37] [INFO ] Deduced a trap along path composed of 24 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/161 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 4/220 variables, 3/164 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 98/263 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:48] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 4 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:11:49] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 2/265 constraints. Problems are: Problem set: 6 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 220/220 variables, and 265 constraints, problems are : Problem set: 6 solved, 109 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 112/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34182ms problems are : Problem set: 6 solved, 109 unsolved
Search for dead transitions found 6 dead transitions in 34183ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 110/116 transitions.
Graph (complete) has 282 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 98 /104 variables (removed 6) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 98 cols
[2025-06-06 06:12:05] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:12:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 06:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:12:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:12:05] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/104 places, 110/116 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34798 ms. Remains : 98/104 places, 110/116 transitions.
RANDOM walk for 40000 steps (8974 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4225 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2814079 steps, run timeout after 3001 ms. (steps per millisecond=937 ) properties seen :0 out of 1
Probabilistic random walk after 2814079 steps, saw 1311967 distinct states, run finished after 3001 ms. (steps per millisecond=937 ) properties seen :0
[2025-06-06 06:12:08] [INFO ] Invariant cache hit.
[2025-06-06 06:12:08] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/208 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/208 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-06-06 06:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:12:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 06:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:12:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:12:09] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:12:09] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-06 06:12:09] [INFO ] Invariant cache hit.
[2025-06-06 06:12:09] [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/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/208 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:12:11] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 142 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/208 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 109/251 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:12:35] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/208 variables, and 252 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37541ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 37542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37814 ms. Remains : 98/98 places, 110/110 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 102
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 92 transition count 85
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 75 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 71 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 89
Applied a total of 58 rules in 14 ms. Remains 70 /98 variables (removed 28) and now considering 89/110 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 70 cols
[2025-06-06 06:12:46] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:12:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:12:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 06:12:46] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 06:12:46] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-06 06:12:46] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 107 ms.
Computed a total of 25 stabilizing places and 31 stable transitions
Graph (complete) has 353 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 127/127 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 109 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 108 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 108 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 107 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 107 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 106 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 106 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 105 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 105 transition count 118
Applied a total of 14 rules in 6 ms. Remains 105 /111 variables (removed 6) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 105 cols
[2025-06-06 06:12:47] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:12:47] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 06:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:12:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-06 06:12:47] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-06 06:12:47] [INFO ] Invariant cache hit.
[2025-06-06 06:12:47] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 5 (OVERLAPS) 118/223 variables, 105/109 constraints. Problems are: Problem set: 3 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 45/154 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 154 constraints, problems are : Problem set: 3 solved, 114 unsolved in 4815 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 2/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 118/222 variables, 104/108 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 45/153 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 17/170 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:12:54] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/171 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:12:57] [INFO ] Deduced a trap along path composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 1/223 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 97/270 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:13:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:13:07] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 4 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 2/272 constraints. Problems are: Problem set: 6 solved, 111 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 0/272 constraints. Problems are: Problem set: 6 solved, 111 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/223 variables, and 272 constraints, problems are : Problem set: 6 solved, 111 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 114/117 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34876ms problems are : Problem set: 6 solved, 111 unsolved
Search for dead transitions found 6 dead transitions in 34876ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/111 places, 112/127 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 99 transition count 112
Applied a total of 6 rules in 3 ms. Remains 99 /105 variables (removed 6) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 99 cols
[2025-06-06 06:13:22] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:13:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 06:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:13:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 06:13:22] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/111 places, 112/127 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35487 ms. Remains : 99/111 places, 112/127 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLCardinality-03
Product exploration explored 100000 steps with 28595 reset in 249 ms.
Product exploration explored 100000 steps with 28568 reset in 146 ms.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 313 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 26 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (8978 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4140 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2809536 steps, run timeout after 3001 ms. (steps per millisecond=936 ) properties seen :0 out of 1
Probabilistic random walk after 2809536 steps, saw 1306855 distinct states, run finished after 3001 ms. (steps per millisecond=936 ) properties seen :0
[2025-06-06 06:13:26] [INFO ] Invariant cache hit.
[2025-06-06 06:13:26] [INFO ] State equation strengthened by 43 read => feed constraints.
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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/167 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 28/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 44/211 variables, 29/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/167 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 28/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/211 variables, 29/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 112/112 transitions.
Graph (complete) has 280 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 110
Applied a total of 3 rules in 4 ms. Remains 98 /99 variables (removed 1) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/99 places, 110/112 transitions.
RANDOM walk for 40000 steps (8981 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4166 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2915232 steps, run timeout after 3001 ms. (steps per millisecond=971 ) properties seen :0 out of 1
Probabilistic random walk after 2915232 steps, saw 1358825 distinct states, run finished after 3001 ms. (steps per millisecond=971 ) properties seen :0
// Phase 1: matrix 110 rows 98 cols
[2025-06-06 06:13:29] [INFO ] Computed 2 invariants in 3 ms
[2025-06-06 06:13:29] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/208 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/208 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-06-06 06:13:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:13:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 06:13:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:13:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:13:30] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:13:30] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-06 06:13:30] [INFO ] Invariant cache hit.
[2025-06-06 06:13:30] [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/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/208 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:13:32] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 142 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/208 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 109/251 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:13:56] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/208 variables, and 252 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37776ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 37777ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38052 ms. Remains : 98/98 places, 110/110 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 102
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 92 transition count 85
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 75 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 71 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 89
Applied a total of 58 rules in 12 ms. Remains 70 /98 variables (removed 28) and now considering 89/110 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 70 cols
[2025-06-06 06:14:08] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:14:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 06:14:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 06:14:08] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 06:14:08] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-06 06:14:08] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 112/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 99 cols
[2025-06-06 06:14:08] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:14:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 06:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:14:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 06:14:08] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2025-06-06 06:14:08] [INFO ] Invariant cache hit.
[2025-06-06 06:14:08] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/211 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 145 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3949 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/211 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 111/256 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:14:16] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:14:23] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 258 constraints, problems are : Problem set: 0 solved, 111 unsolved in 26389 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30378ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 30379ms
Finished structural reductions in LTL mode , in 1 iterations and 30665 ms. Remains : 99/99 places, 112/112 transitions.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 313 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 26 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (8923 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4132 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2820933 steps, run timeout after 3001 ms. (steps per millisecond=939 ) properties seen :0 out of 1
Probabilistic random walk after 2820933 steps, saw 1311847 distinct states, run finished after 3001 ms. (steps per millisecond=939 ) properties seen :0
[2025-06-06 06:14:42] [INFO ] Invariant cache hit.
[2025-06-06 06:14:42] [INFO ] State equation strengthened by 43 read => feed constraints.
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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/167 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 28/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 44/211 variables, 29/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/167 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 28/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/211 variables, 29/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 112/112 transitions.
Graph (complete) has 280 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 110
Applied a total of 3 rules in 4 ms. Remains 98 /99 variables (removed 1) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/99 places, 110/112 transitions.
RANDOM walk for 40000 steps (8970 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4269 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2892283 steps, run timeout after 3001 ms. (steps per millisecond=963 ) properties seen :0 out of 1
Probabilistic random walk after 2892283 steps, saw 1347170 distinct states, run finished after 3001 ms. (steps per millisecond=963 ) properties seen :0
// Phase 1: matrix 110 rows 98 cols
[2025-06-06 06:14:45] [INFO ] Computed 2 invariants in 1 ms
[2025-06-06 06:14:45] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/208 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/208 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-06-06 06:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:14:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 06:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:14:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:14:46] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:14:46] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-06 06:14:46] [INFO ] Invariant cache hit.
[2025-06-06 06:14:46] [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/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/208 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:14:48] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 142 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/208 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 109/251 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:15:12] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/208 variables, and 252 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37721ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 37722ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37979 ms. Remains : 98/98 places, 110/110 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 102
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 92 transition count 85
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 75 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 71 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 89
Applied a total of 58 rules in 11 ms. Remains 70 /98 variables (removed 28) and now considering 89/110 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 70 cols
[2025-06-06 06:15:24] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:15:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 06:15:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 06:15:24] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 06:15:24] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-06 06:15:24] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 28557 reset in 103 ms.
Product exploration explored 100000 steps with 28564 reset in 106 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 112/112 transitions.
Applied a total of 0 rules in 9 ms. Remains 99 /99 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:15:25] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
// Phase 1: matrix 112 rows 99 cols
[2025-06-06 06:15:25] [INFO ] Computed 3 invariants in 6 ms
[2025-06-06 06:15:25] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/211 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:15:27] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 146 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5645 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/211 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 43/146 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 111/257 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:15:35] [INFO ] Deduced a trap along path composed of 24 places in 31 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 258 constraints, problems are : Problem set: 0 solved, 111 unsolved in 23559 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29246ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 29246ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29274 ms. Remains : 99/99 places, 112/112 transitions.
Built C files in :
/tmp/ltsmin4381528844095539234
[2025-06-06 06:15:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4381528844095539234
Running compilation step : cd /tmp/ltsmin4381528844095539234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin4381528844095539234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4381528844095539234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17288666814417363061.hoa' '--buchi-type=spotba'
LTSmin run took 189 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLCardinality-03 finished in 188038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 127/127 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 108 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 108 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 107 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 107 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 106 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 106 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 105 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 105 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 104 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 104 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 103 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 103 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 102 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 101 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 101 transition count 113
Applied a total of 21 rules in 26 ms. Remains 101 /111 variables (removed 10) and now considering 113/127 (removed 14) transitions.
// Phase 1: matrix 113 rows 101 cols
[2025-06-06 06:15:55] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:15:55] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 06:15:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:15:55] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 06:15:55] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:15:55] [INFO ] Redundant transitions in 1 ms returned []
Running 112 sub problems to find dead transitions.
[2025-06-06 06:15:55] [INFO ] Invariant cache hit.
[2025-06-06 06:15:55] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/214 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 44/149 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 149 constraints, problems are : Problem set: 3 solved, 109 unsolved in 5244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 2/100 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 113/213 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 44/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 17/165 constraints. Problems are: Problem set: 3 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:16:03] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 1/214 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 92/259 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 15 (OVERLAPS) 0/214 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 259 constraints, problems are : Problem set: 3 solved, 109 unsolved in 21390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 109/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26673ms problems are : Problem set: 3 solved, 109 unsolved
Search for dead transitions found 3 dead transitions in 26673ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/111 places, 110/127 transitions.
Graph (complete) has 311 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 98 /101 variables (removed 3) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 98 cols
[2025-06-06 06:16:22] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:16:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 06:16:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:16:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 06:16:22] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/111 places, 110/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27295 ms. Remains : 98/111 places, 110/127 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLCardinality-13 finished in 27361 ms.
All properties solved by simple procedures.
Total runtime 336351 ms.
BK_STOP 1749190582467
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-d2m64"
export BK_EXAMINATION="LTLCardinality"
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-d2m64, examination is LTLCardinality"
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-174901994400483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;