Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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-d2m96-ReachabilityCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749198886023

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-06 08:34:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 08:34:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 08:34:47] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-06-06 08:34:47] [INFO ] Transformed 2398 places.
[2025-06-06 08:34:47] [INFO ] Transformed 1954 transitions.
[2025-06-06 08:34:47] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 28 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8835 resets) in 3234 ms. (12 steps per ms) remains 4/4 properties
[2025-06-06 08:34:48] [INFO ] Flatten gal took : 388 ms
BEST_FIRST walk for 40001 steps (3685 resets) in 810 ms. (49 steps per ms) remains 4/4 properties
[2025-06-06 08:34:48] [INFO ] Flatten gal took : 183 ms
[2025-06-06 08:34:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3962868566617380074.gal : 78 ms
BEST_FIRST walk for 40002 steps (3694 resets) in 555 ms. (71 steps per ms) remains 4/4 properties
[2025-06-06 08:34:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3088308452853181656.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3962868566617380074.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3088308452853181656.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (3631 resets) in 646 ms. (61 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality3088308452853181656.prop.
BEST_FIRST walk for 40001 steps (3700 resets) in 581 ms. (68 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 65
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :65 after 346
Interrupted probabilistic random walk after 233633 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 4
Probabilistic random walk after 233633 steps, saw 106876 distinct states, run finished after 3006 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1954 rows 414 cols
[2025-06-06 08:34:52] [INFO ] Computed 6 invariants in 96 ms
[2025-06-06 08:34:52] [INFO ] State equation strengthened by 1674 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-03 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 147/153 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/205 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-04 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 209/414 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :346 after 3801
At refinement iteration 8 (INCLUDED_ONLY) 0/2368 variables, 1674/2094 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2209 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 150/152 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/204 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 210/414 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:55] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3801 after 4523
[2025-06-06 08:34:55] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:56] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 23 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4523 after 8299
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:56] [INFO ] Deduced a trap composed of 102 places in 227 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:56] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:56] [INFO ] Deduced a trap composed of 239 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:57] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:57] [INFO ] Deduced a trap composed of 242 places in 197 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 8/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1954/2368 variables, 414/428 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2368 variables, 1674/2102 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2368 variables, 2/2104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:58] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:59] [INFO ] Deduced a trap composed of 125 places in 209 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:59] [INFO ] Deduced a trap composed of 134 places in 220 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:00] [INFO ] Deduced a trap composed of 243 places in 252 ms of which 68 ms to minimize.
SMT process timed out in 7719ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.13 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 374
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 374
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1078 place count 270 transition count 363
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1169 place count 179 transition count 272
Iterating global reduction 2 with 91 rules applied. Total rules applied 1260 place count 179 transition count 272
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1295 place count 179 transition count 237
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1333 place count 141 transition count 184
Iterating global reduction 3 with 38 rules applied. Total rules applied 1371 place count 141 transition count 184
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1394 place count 141 transition count 161
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1403 place count 132 transition count 148
Iterating global reduction 4 with 9 rules applied. Total rules applied 1412 place count 132 transition count 148
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1421 place count 123 transition count 139
Iterating global reduction 4 with 9 rules applied. Total rules applied 1430 place count 123 transition count 139
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1435 place count 118 transition count 133
Iterating global reduction 4 with 5 rules applied. Total rules applied 1440 place count 118 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1442 place count 118 transition count 131
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1447 place count 113 transition count 126
Iterating global reduction 5 with 5 rules applied. Total rules applied 1452 place count 113 transition count 126
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1455 place count 110 transition count 123
Iterating global reduction 5 with 3 rules applied. Total rules applied 1458 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1459 place count 109 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 1460 place count 109 transition count 122
Applied a total of 1460 rules in 122 ms. Remains 109 /414 variables (removed 305) and now considering 122/1954 (removed 1832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 109/414 places, 122/1954 transitions.
RANDOM walk for 40000 steps (9045 resets) in 328 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4068 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4090 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1290886 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 2
Probabilistic random walk after 1290886 steps, saw 605552 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
// Phase 1: matrix 122 rows 109 cols
[2025-06-06 08:35:03] [INFO ] Computed 4 invariants in 2 ms
[2025-06-06 08:35:03] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 90/166 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 36/202 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 32/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 29/231 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/231 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 159 constraints, problems are : Problem set: 0 solved, 2 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Reachability property SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-13 is true.
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityCardinality-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :8299 after 64243
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/68 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/76 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/166 variables, 76/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/202 variables, 18/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 32/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 29/231 variables, 15/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 14/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/231 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 160 constraints, problems are : Problem set: 1 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 729ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 107 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 106 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 105 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 105 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 104 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 104 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 103 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 102 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 101 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 100 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 100 transition count 109
Applied a total of 19 rules in 29 ms. Remains 100 /109 variables (removed 9) and now considering 109/122 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 100/109 places, 109/122 transitions.
RANDOM walk for 40000 steps (9018 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4106 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2868299 steps, run timeout after 3001 ms. (steps per millisecond=955 ) properties seen :0 out of 1
Probabilistic random walk after 2868299 steps, saw 1334796 distinct states, run finished after 3001 ms. (steps per millisecond=955 ) properties seen :0
// Phase 1: matrix 109 rows 100 cols
[2025-06-06 08:35:07] [INFO ] Computed 4 invariants in 2 ms
[2025-06-06 08:35:07] [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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/67 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/144 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/180 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 27/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 29/209 variables, 15/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 14/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/67 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/144 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/180 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 27/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 29/209 variables, 15/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/209 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 100/100 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-06-06 08:35:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :64243 after 94393
[2025-06-06 08:35:08] [INFO ] Implicit Places using invariants in 511 ms returned []
[2025-06-06 08:35:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 08:35:08] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:35:08] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-06 08:35:08] [INFO ] Invariant cache hit.
[2025-06-06 08:35:08] [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/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/209 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 41/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :94393 after 111831
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/209 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 41/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 108/253 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:16] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/254 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:32] [INFO ] Deduced a trap along path composed of 5 places in 32 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/209 variables, 1/255 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 209/209 variables, and 255 constraints, problems are : Problem set: 3 solved, 105 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34347ms problems are : Problem set: 3 solved, 105 unsolved
Search for dead transitions found 3 dead transitions in 34348ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/100 places, 106/109 transitions.
Graph (complete) has 276 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 97 /100 variables (removed 3) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 97 cols
[2025-06-06 08:35:42] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:43] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-06 08:35:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 08:35:43] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/100 places, 106/109 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35394 ms. Remains : 97/100 places, 106/109 transitions.
RANDOM walk for 40000 steps (8997 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4097 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :111831 after 2.17668e+06
Interrupted probabilistic random walk after 2539036 steps, run timeout after 3001 ms. (steps per millisecond=846 ) properties seen :0 out of 1
Probabilistic random walk after 2539036 steps, saw 1181727 distinct states, run finished after 3001 ms. (steps per millisecond=846 ) properties seen :0
[2025-06-06 08:35:46] [INFO ] Invariant cache hit.
[2025-06-06 08:35:46] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/119 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/162 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/203 variables, 24/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 17/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 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 90.0 s and query timeout 9000.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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/119 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/162 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/203 variables, 24/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/203 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 97/97 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-06 08:35:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:46] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-06 08:35:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 08:35:46] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:35:46] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-06 08:35:46] [INFO ] Invariant cache hit.
[2025-06-06 08:35:46] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 4 (OVERLAPS) 106/203 variables, 97/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 40/140 constraints. Problems are: Problem set: 3 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 140 constraints, problems are : Problem set: 3 solved, 102 unsolved in 3339 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 105/199 variables, 94/97 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/136 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 13/149 constraints. Problems are: Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:51] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/150 constraints. Problems are: Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:52] [INFO ] Deduced a trap along path composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 4/203 variables, 3/154 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 89/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:36:01] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 1/245 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 0/245 constraints. Problems are: Problem set: 3 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/203 variables, and 245 constraints, problems are : Problem set: 3 solved, 102 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 102/105 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33405ms problems are : Problem set: 3 solved, 102 unsolved
Search for dead transitions found 3 dead transitions in 33406ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/97 places, 103/106 transitions.
Graph (complete) has 267 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 94 /97 variables (removed 3) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 94 cols
[2025-06-06 08:36:20] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:36:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 08:36:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:36:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 08:36:20] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 94/97 places, 103/106 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34006 ms. Remains : 94/97 places, 103/106 transitions.
RANDOM walk for 40000 steps (8963 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4124 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2970803 steps, run timeout after 3001 ms. (steps per millisecond=989 ) properties seen :0 out of 1
Probabilistic random walk after 2970803 steps, saw 1380338 distinct states, run finished after 3001 ms. (steps per millisecond=989 ) properties seen :0
[2025-06-06 08:36:23] [INFO ] Invariant cache hit.
[2025-06-06 08:36:23] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/119 variables, 54/57 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 08:36:23] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/159 variables, 18/76 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, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/197 variables, 22/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 16/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/197 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/119 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/159 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/197 variables, 22/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 16/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 21 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2025-06-06 08:36:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:36:24] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-06 08:36:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:36:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 08:36:24] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:36:24] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-06 08:36:24] [INFO ] Invariant cache hit.
[2025-06-06 08:36:24] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/197 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 39/136 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 136 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/197 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 39/136 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 102/238 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 238 constraints, problems are : Problem set: 0 solved, 102 unsolved in 17419 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20266ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 20267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20670 ms. Remains : 94/94 places, 103/103 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 94 transition count 96
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 89 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 12 place count 89 transition count 80
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 44 place count 73 transition count 80
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 52 place count 69 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 68 transition count 85
Applied a total of 54 rules in 26 ms. Remains 68 /94 variables (removed 26) and now considering 85/103 (removed 18) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 85 rows 68 cols
[2025-06-06 08:36:44] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:36:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 08:36:44] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-06 08:36:44] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:36:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 08:36:44] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-06 08:36:44] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:36:44] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:36:44] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 3 ms to minimize.
[2025-06-06 08:36:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
TRAPS : Iteration 1
[2025-06-06 08:36:44] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 08:36:44] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-06 08:36:44] [INFO ] Flatten gal took : 8 ms
[2025-06-06 08:36:44] [INFO ] Flatten gal took : 8 ms
[2025-06-06 08:36:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16615065001637283965.gal : 1 ms
[2025-06-06 08:36:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality826051369514787389.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16615065001637283965.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality826051369514787389.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality826051369514787389.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 151
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :151 after 207
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :207 after 861
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :861 after 1701
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1701 after 8887
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8887 after 59361
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :59361 after 421047
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :421047 after 2.53221e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.53221e+06 after 1.77457e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.77457e+07 after 1.14751e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.14751e+08 after 7.07595e+08
Detected timeout of ITS tools.
[2025-06-06 08:36:59] [INFO ] Flatten gal took : 8 ms
[2025-06-06 08:36:59] [INFO ] Applying decomposition
[2025-06-06 08:36:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6075542417619929528.txt' '-o' '/tmp/graph6075542417619929528.bin' '-w' '/tmp/graph6075542417619929528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6075542417619929528.bin' '-l' '-1' '-v' '-w' '/tmp/graph6075542417619929528.weights' '-q' '0' '-e' '0.001'
[2025-06-06 08:37:00] [INFO ] Decomposing Gal with order
[2025-06-06 08:37:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 08:37:00] [INFO ] Removed a total of 67 redundant transitions.
[2025-06-06 08:37:00] [INFO ] Flatten gal took : 320 ms
[2025-06-06 08:37:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 11 ms.
[2025-06-06 08:37:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3329439929227819228.gal : 2 ms
[2025-06-06 08:37:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6099374122476764177.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3329439929227819228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6099374122476764177.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6099374122476764177.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 193
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :193 after 201
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :201 after 375
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :375 after 375
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :375 after 1181
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1181 after 1.80811e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30923 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 08:37:15] [INFO ] Flatten gal took : 66 ms
[2025-06-06 08:37:15] [INFO ] Applying decomposition
[2025-06-06 08:37:15] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4127420447446007775.txt' '-o' '/tmp/graph4127420447446007775.bin' '-w' '/tmp/graph4127420447446007775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4127420447446007775.bin' '-l' '-1' '-v' '-w' '/tmp/graph4127420447446007775.weights' '-q' '0' '-e' '0.001'
[2025-06-06 08:37:16] [INFO ] Decomposing Gal with order
[2025-06-06 08:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 08:37:16] [INFO ] Removed a total of 627 redundant transitions.
[2025-06-06 08:37:16] [INFO ] Flatten gal took : 136 ms
[2025-06-06 08:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 982 labels/synchronizations in 54 ms.
[2025-06-06 08:37:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4273173844753528232.gal : 21 ms
[2025-06-06 08:37:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6776714486814722192.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4273173844753528232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6776714486814722192.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6776714486814722192.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 337
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9655 after 12015
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12015 after 12767
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12767 after 12767
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12767 after 12767
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :12767 after 12767
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12767 after 12767
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12767 after 12767
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :12767 after 14815
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :14815 after 18175
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.99964e+08 after 2.99964e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.53306e+08 after 9.53306e+08
Detected timeout of ITS tools.
[2025-06-06 09:07:18] [INFO ] Flatten gal took : 160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15609451065598374087
[2025-06-06 09:07:19] [INFO ] Applying decomposition
[2025-06-06 09:07:19] [INFO ] Flatten gal took : 40 ms
[2025-06-06 09:07:19] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2025-06-06 09:07:19] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:07:19] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2025-06-06 09:07:19] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:07:19] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2025-06-06 09:07:19] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:07:20] [INFO ] Built C files in 731ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15609451065598374087
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8873557459840387605.txt' '-o' '/tmp/graph8873557459840387605.bin' '-w' '/tmp/graph8873557459840387605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8873557459840387605.bin' '-l' '-1' '-v' '-w' '/tmp/graph8873557459840387605.weights' '-q' '0' '-e' '0.001'
[2025-06-06 09:07:20] [INFO ] Decomposing Gal with order
Running compilation step : cd /tmp/ltsmin15609451065598374087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-06-06 09:07:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 09:07:20] [INFO ] Removed a total of 93 redundant transitions.
[2025-06-06 09:07:20] [INFO ] Flatten gal took : 56 ms
[2025-06-06 09:07:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 28 ms.
[2025-06-06 09:07:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2189846482972945227.gal : 3 ms
[2025-06-06 09:07:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11172273821084395367.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2189846482972945227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11172273821084395367.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11172273821084395367.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 423
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4848 after 6016
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :102315 after 121867
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin15609451065598374087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15609451065598374087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true'
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.6269e+06 after 8.76573e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.46511e+09 after 3.86294e+09
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: Initializing POR dependencies: labels 104, guards 103
pins2lts-mc-linux64( 1/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.059: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 0.066: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.066: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.066: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.067: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.067: There are 104 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.067: State length is 94, there are 103 groups
pins2lts-mc-linux64( 0/ 8), 0.067: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.067: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.067: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.067: Visible groups: 0 / 103, labels: 1 / 104
pins2lts-mc-linux64( 0/ 8), 0.067: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.067: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.067: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.066: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.067: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.067: "SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.483: ~17 levels ~960 states ~1312 transitions
pins2lts-mc-linux64( 0/ 8), 1.493: ~26 levels ~1920 states ~2640 transitions
pins2lts-mc-linux64( 4/ 8), 2.673: ~22 levels ~3840 states ~5128 transitions
pins2lts-mc-linux64( 6/ 8), 2.927: ~23 levels ~7680 states ~13376 transitions
pins2lts-mc-linux64( 6/ 8), 3.417: ~26 levels ~15360 states ~25664 transitions
pins2lts-mc-linux64( 3/ 8), 4.637: ~39 levels ~30720 states ~47032 transitions
pins2lts-mc-linux64( 7/ 8), 5.999: ~61 levels ~61440 states ~85192 transitions
pins2lts-mc-linux64( 6/ 8), 8.042: ~41 levels ~122880 states ~207256 transitions
pins2lts-mc-linux64( 6/ 8), 9.519: ~49 levels ~245760 states ~382576 transitions
pins2lts-mc-linux64( 4/ 8), 18.640: ~102 levels ~491520 states ~822904 transitions
pins2lts-mc-linux64( 4/ 8), 23.602: ~113 levels ~983040 states ~1542376 transitions
pins2lts-mc-linux64( 1/ 8), 30.872: ~89 levels ~1966080 states ~3077008 transitions
pins2lts-mc-linux64( 3/ 8), 39.347: ~110 levels ~3932160 states ~6438184 transitions
pins2lts-mc-linux64( 3/ 8), 55.862: ~125 levels ~7864320 states ~12658728 transitions
pins2lts-mc-linux64( 1/ 8), 90.492: ~129 levels ~15728640 states ~24943352 transitions
pins2lts-mc-linux64( 1/ 8), 155.932: ~146 levels ~31457280 states ~50761776 transitions
pins2lts-mc-linux64( 1/ 8), 291.983: ~161 levels ~62914560 states ~100665936 transitions
pins2lts-mc-linux64( 6/ 8), 398.898: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 399.014:
pins2lts-mc-linux64( 0/ 8), 399.014: mean standard work distribution: 1.4% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 399.014:
pins2lts-mc-linux64( 0/ 8), 399.014: Explored 83884891 states 139102279 transitions, fanout: 1.658
pins2lts-mc-linux64( 0/ 8), 399.014: Total exploration time 398.930 sec (398.840 sec minimum, 398.887 sec on average)
pins2lts-mc-linux64( 0/ 8), 399.014: States per second: 210275, Transitions per second: 348688
pins2lts-mc-linux64( 0/ 8), 399.014: Ignoring proviso: 1
pins2lts-mc-linux64( 0/ 8), 399.014:
pins2lts-mc-linux64( 0/ 8), 399.014: Queue width: 8B, total height: 3880730, memory: 29.61MB
pins2lts-mc-linux64( 0/ 8), 399.014: Tree memory: 923.4MB, 11.1 B/state, compr.: 2.9%
pins2lts-mc-linux64( 0/ 8), 399.014: Tree fill ratio (roots/leafs): 65.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 399.014: Stored 103 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 399.014: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 399.014: Est. total memory use: 953.0MB (~1053.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15609451065598374087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15609451065598374087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'SieveSingleMsgMboxPTd2m96ReachabilityCardinality202501==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.46687e+11 after 1.46687e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.36066e+11 after 4.36072e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.72846e+12 after 1.72846e+12

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-d2m96"
export BK_EXAMINATION="ReachabilityCardinality"
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-d2m96, examination is ReachabilityCardinality"
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-174901994500494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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