About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 50 50 1 50 ? 1 ? 50 1 1 ? 50 50 ? 1 50 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765100413.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 BridgeAndVehicles-PT-V50P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765100413
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 237K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 929K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 107K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 315K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 253K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 965K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749010218912
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 04:10:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 04:10:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 04:10:22] [INFO ] Load time of PNML (sax parser for PT used): 407 ms
[2025-06-04 04:10:22] [INFO ] Transformed 128 places.
[2025-06-04 04:10:22] [INFO ] Transformed 1328 transitions.
[2025-06-04 04:10:22] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 721 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 11
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[50, 0, 0, 0, 0, 0, 0, 1, 0, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[50, 0, 0, 0, 0, 0, 0, 1, 0, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-04 04:10:22] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2025-06-04 04:10:22] [INFO ] Computed 7 invariants in 62 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50, 0, 0, 0, 0, 0, 0, 1, 0, 50] Max Struct:[50, 50, 50, 2, 50, 50, 1, 1, 1, 50]
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (22 resets) in 361 ms. (27 steps per ms)
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (25 resets) in 216 ms. (138 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 1, 10] Max Struct:[50, 2, 50]
[2025-06-04 04:10:23] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:10:23] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2025-06-04 04:10:24] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-04 04:10:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-04 04:10:24] [INFO ] [Real]Added 22 Read/Feed constraints in 42 ms returned sat
[2025-06-04 04:10:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:10:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-04 04:10:24] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-06-04 04:10:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 45 ms returned sat
[2025-06-04 04:10:25] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 205 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:10:25] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 22 ms to minimize.
[2025-06-04 04:10:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 553 ms
[2025-06-04 04:10:25] [INFO ] Added : 10 causal constraints over 2 iterations in 965 ms. Result :sat
Minimization took 390 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:10:26] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:10:26] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-04 04:10:26] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-04 04:10:26] [INFO ] [Real]Added 22 Read/Feed constraints in 31 ms returned sat
[2025-06-04 04:10:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:10:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-04 04:10:26] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-06-04 04:10:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 50 ms returned sat
[2025-06-04 04:10:26] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 106 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:10:27] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 12 ms to minimize.
[2025-06-04 04:10:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2025-06-04 04:10:27] [INFO ] Added : 3 causal constraints over 2 iterations in 681 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 1, 10] Max Struct:[50, 1, 50]
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 354 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2025-06-04 04:10:28] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2025-06-04 04:10:28] [INFO ] Computed 5 invariants in 6 ms
[2025-06-04 04:10:28] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:10:44] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:10:53] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 6 ms to minimize.
SMT process timed out in 24539ms, After SMT, problems are : Problem set: 0 solved, 1325 unsolved
Search for dead transitions found 0 dead transitions in 24590ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24991 ms. Remains : 126/128 places, 1328/1328 transitions.
[2025-06-04 04:10:53] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:10:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2273 resets) in 6670 ms. (149 steps per ms)
BEST_FIRST walk for 2000005 steps (1680 resets) in 6248 ms. (320 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2025-06-04 04:11:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:06] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-06-04 04:11:06] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-04 04:11:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-06-04 04:11:06] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-04 04:11:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-04 04:11:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 44 ms returned sat
[2025-06-04 04:11:06] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 56 ms.
[2025-06-04 04:11:07] [INFO ] Added : 11 causal constraints over 3 iterations in 242 ms. Result :sat
Minimization took 187 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 04:11:07] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-06-04 04:11:07] [INFO ] [Real]Added 22 Read/Feed constraints in 20 ms returned sat
[2025-06-04 04:11:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 04:11:07] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-06-04 04:11:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 39 ms returned sat
[2025-06-04 04:11:07] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 48 ms.
[2025-06-04 04:11:08] [INFO ] Added : 12 causal constraints over 10 iterations in 318 ms. Result :sat
Minimization took 180 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 115 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 126/126 places, 1328/1328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 144 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2025-06-04 04:11:09] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:11:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:11:10] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-04 04:11:10] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:11:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:11:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-04 04:11:11] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1822 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 144 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2117 ms. Remains : 124/126 places, 1328/1328 transitions.
[2025-06-04 04:11:11] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2025-06-04 04:11:11] [INFO ] Computed 5 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2273 resets) in 6953 ms. (143 steps per ms)
BEST_FIRST walk for 2000008 steps (1680 resets) in 6544 ms. (305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2025-06-04 04:11:25] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:11:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:25] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-06-04 04:11:25] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-06-04 04:11:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-04 04:11:25] [INFO ] [Real]Added 22 Read/Feed constraints in 26 ms returned sat
[2025-06-04 04:11:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 04:11:25] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-06-04 04:11:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 40 ms returned sat
[2025-06-04 04:11:25] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 42 ms.
[2025-06-04 04:11:25] [INFO ] Added : 10 causal constraints over 2 iterations in 217 ms. Result :sat
Minimization took 294 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:26] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 04:11:26] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-06-04 04:11:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:11:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-06-04 04:11:26] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-06-04 04:11:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:11:27] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 6 ms to minimize.
[2025-06-04 04:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2025-06-04 04:11:27] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 43 ms.
[2025-06-04 04:11:27] [INFO ] Added : 12 causal constraints over 10 iterations in 368 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 76 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 124/124 places, 1328/1328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 70 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2025-06-04 04:11:28] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:11:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:11:29] [INFO ] Implicit Places using invariants in 438 ms returned []
[2025-06-04 04:11:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:11:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-04 04:11:30] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:11:30] [INFO ] Redundant transitions in 88 ms returned []
Running 1325 sub problems to find dead transitions.
[2025-06-04 04:11:30] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-06-04 04:11:30] [INFO ] Invariant cache hit.
[2025-06-04 04:11:30] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:11:43] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:11:55] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 5 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/7 constraints. Problems are: Problem set: 63 solved, 1262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/374 variables, and 7 constraints, problems are : Problem set: 63 solved, 1262 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 63 solved, 1262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 63 solved, 1262 unsolved
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/374 variables, 124/131 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 22/153 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 102 solved, 1223 unsolved in 32011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1260/1224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66357ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 66364ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) removed 102 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 1226/1328 transitions.
Applied a total of 0 rules in 63 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:12:37] [INFO ] Redundant transitions in 75 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68491 ms. Remains : 124/124 places, 1226/1328 transitions.
[2025-06-04 04:12:37] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2025-06-04 04:12:37] [INFO ] Computed 5 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2273 resets) in 5197 ms. (192 steps per ms)
BEST_FIRST walk for 2000001 steps (1678 resets) in 3754 ms. (532 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2025-06-04 04:12:46] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:12:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:12:46] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-06-04 04:12:46] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-06-04 04:12:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:12:46] [INFO ] [Real]Added 20 Read/Feed constraints in 17 ms returned sat
[2025-06-04 04:12:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:12:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 04:12:46] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-04 04:12:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 39 ms returned sat
[2025-06-04 04:12:46] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 34 ms.
[2025-06-04 04:12:46] [INFO ] Added : 10 causal constraints over 2 iterations in 247 ms. Result :sat
Minimization took 373 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:12:47] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 04:12:47] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-06-04 04:12:47] [INFO ] [Real]Added 20 Read/Feed constraints in 27 ms returned sat
[2025-06-04 04:12:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:12:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 04:12:47] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-06-04 04:12:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 42 ms returned sat
[2025-06-04 04:12:47] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 39 ms.
[2025-06-04 04:12:48] [INFO ] Added : 11 causal constraints over 10 iterations in 391 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 56 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 81 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-06-04 04:12:49] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:12:49] [INFO ] Implicit Places using invariants in 358 ms returned []
[2025-06-04 04:12:49] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:12:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:12:50] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:12:50] [INFO ] Redundant transitions in 32 ms returned []
Running 1223 sub problems to find dead transitions.
[2025-06-04 04:12:50] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:12:50] [INFO ] Invariant cache hit.
[2025-06-04 04:12:50] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:13:02] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SMT process timed out in 62965ms, After SMT, problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 62969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64215 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 1799 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 589 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40006 steps (32 resets) in 660 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 353 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 352 ms. (113 steps per ms) remains 4/4 properties
[2025-06-04 04:13:54] [INFO ] Flatten gal took : 493 ms
[2025-06-04 04:13:54] [INFO ] Flatten gal took : 194 ms
[2025-06-04 04:13:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14472411490602115722.gal : 118 ms
[2025-06-04 04:13:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12632298877708214097.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/ReachabilityCardinality14472411490602115722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12632298877708214097.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 ...330
Loading property file /tmp/ReachabilityCardinality12632298877708214097.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 34
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :34 after 68
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :68 after 205
Interrupted probabilistic random walk after 227150 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 4
Probabilistic random walk after 227150 steps, saw 62562 distinct states, run finished after 3007 ms. (steps per millisecond=75 ) properties seen :0
[2025-06-04 04:13:57] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:13:57] [INFO ] Invariant cache hit.
[2025-06-04 04:13:57] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:13:58] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:13:58] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 12 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 151 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1772 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 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: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 155 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6797ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 747 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 56 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2025-06-04 04:14:05] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:14:05] [INFO ] Invariant cache hit.
[2025-06-04 04:14:05] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :205 after 2550
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:14:15] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2550 after 12899
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :12899 after 13039
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :13039 after 13372
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :13372 after 13993
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :13993 after 15103
Detected timeout of ITS tools.
[2025-06-04 04:14:45] [INFO ] Flatten gal took : 83 ms
[2025-06-04 04:14:45] [INFO ] Applying decomposition
[2025-06-04 04:14:45] [INFO ] Flatten gal took : 76 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/graph18307175884035457614.txt' '-o' '/tmp/graph18307175884035457614.bin' '-w' '/tmp/graph18307175884035457614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18307175884035457614.bin' '-l' '-1' '-v' '-w' '/tmp/graph18307175884035457614.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:14:45] [INFO ] Decomposing Gal with order
[2025-06-04 04:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:14:46] [INFO ] Removed a total of 3070 redundant transitions.
[2025-06-04 04:14:46] [INFO ] Flatten gal took : 595 ms
[2025-06-04 04:14:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 427 labels/synchronizations in 55 ms.
[2025-06-04 04:14:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15146962332936819029.gal : 6 ms
[2025-06-04 04:14:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18059406985479831850.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/ReachabilityCardinality15146962332936819029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18059406985479831850.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 ...309
Loading property file /tmp/ReachabilityCardinality18059406985479831850.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 37
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :204 after 1662
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15452 after 24752
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :85628 after 97927
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :271402 after 303660
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :743382 after 864098
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 timeout
0)
(s30 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42877ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 42886ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42952 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 474 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (32 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :9.30316e+06 after 9.73208e+06
Interrupted probabilistic random walk after 240344 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 4
Probabilistic random walk after 240344 steps, saw 66111 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2025-06-04 04:14:51] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:14:51] [INFO ] Invariant cache hit.
[2025-06-04 04:14:51] [INFO ] State equation strengthened by 20 read => feed constraints.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:14:52] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:14:52] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 11 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 151 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 155 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8346ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1206 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 63 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 53 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-06-04 04:15:01] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:15:01] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-06-04 04:15:01] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:15:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:15:02] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:15:02] [INFO ] Redundant transitions in 53 ms returned []
Running 1223 sub problems to find dead transitions.
[2025-06-04 04:15:02] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:15:02] [INFO ] Invariant cache hit.
[2025-06-04 04:15:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :7.25449e+07 after 7.31669e+07
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:15:12] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Detected timeout of ITS tools.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 31838 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64922ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 64927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66168 ms. Remains : 124/124 places, 1226/1226 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 10] Max Struct:[50, 50]
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2025-06-04 04:16:07] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:16:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (22 resets) in 59 ms. (166 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-06-04 04:16:07] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:16:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:16:07] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 04:16:07] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-06-04 04:16:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:16:07] [INFO ] [Real]Added 20 Read/Feed constraints in 19 ms returned sat
[2025-06-04 04:16:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:16:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 04:16:07] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-06-04 04:16:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 27 ms returned sat
[2025-06-04 04:16:07] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 39 ms.
[2025-06-04 04:16:08] [INFO ] Added : 10 causal constraints over 2 iterations in 200 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 156 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:16:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2025-06-04 04:16:08] [INFO ] Computed 5 invariants in 4 ms
[2025-06-04 04:16:08] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:16:19] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 50)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43343ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43510 ms. Remains : 123/124 places, 1225/1226 transitions.
[2025-06-04 04:16:52] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:16:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 5692 ms. (175 steps per ms)
BEST_FIRST walk for 1000000 steps (1087 resets) in 2283 ms. (437 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-06-04 04:17:00] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:17:00] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-06-04 04:17:00] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-06-04 04:17:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:17:00] [INFO ] [Real]Added 20 Read/Feed constraints in 31 ms returned sat
[2025-06-04 04:17:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:17:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 04:17:00] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-04 04:17:00] [INFO ] [Nat]Added 20 Read/Feed constraints in 49 ms returned sat
[2025-06-04 04:17:00] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 37 ms.
[2025-06-04 04:17:00] [INFO ] Added : 11 causal constraints over 3 iterations in 187 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 53 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 55 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-06-04 04:17:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:17:01] [INFO ] Implicit Places using invariants in 454 ms returned []
[2025-06-04 04:17:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:17:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:17:03] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:17:03] [INFO ] Redundant transitions in 20 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:17:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:17:03] [INFO ] Invariant cache hit.
[2025-06-04 04:17:03] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:17:14] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31499 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64890ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64893ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66576 ms. Remains : 123/123 places, 1225/1225 transitions.
[2025-06-04 04:18:08] [INFO ] Flatten gal took : 187 ms
RANDOM walk for 40000 steps (104 resets) in 732 ms. (54 steps per ms) remains 2/2 properties
[2025-06-04 04:18:08] [INFO ] Flatten gal took : 105 ms
[2025-06-04 04:18:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4066746010719852171.gal : 43 ms
[2025-06-04 04:18:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4059089231818610981.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/ReachabilityCardinality4066746010719852171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4059089231818610981.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 40003 steps (41 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4059089231818610981.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 233
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
Interrupted probabilistic random walk after 293603 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 293603 steps, saw 81368 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2025-06-04 04:18:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:18:11] [INFO ] Invariant cache hit.
[2025-06-04 04:18:11] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:18:12] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:18:12] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1014
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2758 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3974ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 635 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 85 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:18:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:18:16] [INFO ] Invariant cache hit.
[2025-06-04 04:18:16] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1014 after 4275
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:18:25] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :32724 after 32735
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :32735 after 33348
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :33348 after 34963
Detected timeout of ITS tools.
[2025-06-04 04:18:58] [INFO ] Flatten gal took : 55 ms
[2025-06-04 04:18:58] [INFO ] Applying decomposition
[2025-06-04 04:18:58] [INFO ] Flatten gal took : 51 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/graph16297579564885220060.txt' '-o' '/tmp/graph16297579564885220060.bin' '-w' '/tmp/graph16297579564885220060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16297579564885220060.bin' '-l' '-1' '-v' '-w' '/tmp/graph16297579564885220060.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:18:58] [INFO ] Decomposing Gal with order
[2025-06-04 04:18:58] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 43036ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43130 ms. Remains : 123/123 places, 1225/1225 transitions.
[2025-06-04 04:18:59] [INFO ] Removed a total of 2651 redundant transitions.
[2025-06-04 04:18:59] [INFO ] Flatten gal took : 365 ms
[2025-06-04 04:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 311 labels/synchronizations in 31 ms.
[2025-06-04 04:18:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality102688779091483082.gal : 7 ms
[2025-06-04 04:18:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4589807051080608714.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/ReachabilityCardinality102688779091483082.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4589807051080608714.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 ...306
Loading property file /tmp/ReachabilityCardinality4589807051080608714.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 308
RANDOM walk for 40000 steps (104 resets) in 822 ms. (48 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :308 after 2673
BEST_FIRST walk for 40009 steps (42 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2673 after 5197
BEST_FIRST walk for 40001 steps (41 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5197 after 8054
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8054 after 31104
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :31104 after 71345
Interrupted probabilistic random walk after 287767 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287767 steps, saw 79792 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-06-04 04:19:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:19:02] [INFO ] Invariant cache hit.
[2025-06-04 04:19:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :490170 after 541041
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:19:03] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:19:03] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2672 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3974ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6.73752e+06 after 6.93608e+06
Parikh walk visited 0 properties in 1090 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 52 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 52 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-06-04 04:19:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:19:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:19:08] [INFO ] Implicit Places using invariants in 582 ms returned []
[2025-06-04 04:19:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:19:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:19:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:19:10] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:19:10] [INFO ] Redundant transitions in 34 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:19:10] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:19:10] [INFO ] Invariant cache hit.
[2025-06-04 04:19:10] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.87142e+07 after 4.21445e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:19:21] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31687 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64927ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64931ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67702 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-04 in 248189 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2025-06-04 04:20:15] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2025-06-04 04:20:15] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (22 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-06-04 04:20:15] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 04:20:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:20:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 04:20:15] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-04 04:20:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:20:15] [INFO ] [Real]Added 20 Read/Feed constraints in 16 ms returned sat
[2025-06-04 04:20:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:20:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 04:20:15] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-04 04:20:15] [INFO ] [Nat]Added 20 Read/Feed constraints in 27 ms returned sat
[2025-06-04 04:20:15] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 29 ms.
[2025-06-04 04:20:16] [INFO ] Added : 11 causal constraints over 10 iterations in 388 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 67 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:20:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2025-06-04 04:20:16] [INFO ] Computed 5 invariants in 3 ms
[2025-06-04 04:20:16] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:20:28] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42934ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43009 ms. Remains : 123/124 places, 1225/1226 transitions.
[2025-06-04 04:20:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:20:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 5757 ms. (173 steps per ms)
BEST_FIRST walk for 1000001 steps (1028 resets) in 2160 ms. (462 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-06-04 04:21:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:21:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:21:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 04:21:07] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-04 04:21:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:21:07] [INFO ] [Real]Added 20 Read/Feed constraints in 20 ms returned sat
[2025-06-04 04:21:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 04:21:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 04:21:08] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-04 04:21:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 29 ms returned sat
[2025-06-04 04:21:08] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 28 ms.
[2025-06-04 04:21:08] [INFO ] Added : 12 causal constraints over 10 iterations in 294 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-06-04 04:21:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:21:09] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-04 04:21:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:21:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:21:10] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:21:10] [INFO ] Redundant transitions in 20 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:21:10] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:21:10] [INFO ] Invariant cache hit.
[2025-06-04 04:21:10] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:21:21] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31701 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64995ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66143 ms. Remains : 123/123 places, 1225/1225 transitions.
[2025-06-04 04:22:15] [INFO ] Flatten gal took : 67 ms
[2025-06-04 04:22:15] [INFO ] Flatten gal took : 105 ms
RANDOM walk for 40000 steps (104 resets) in 628 ms. (63 steps per ms) remains 2/2 properties
[2025-06-04 04:22:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10591734460359131991.gal : 31 ms
[2025-06-04 04:22:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5623569014895352023.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/ReachabilityCardinality10591734460359131991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5623569014895352023.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 ...329
BEST_FIRST walk for 40004 steps (40 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5623569014895352023.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 72
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :72 after 159
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :159 after 467
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :467 after 1223
Interrupted probabilistic random walk after 251347 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 251347 steps, saw 72855 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2025-06-04 04:22:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:22:18] [INFO ] Invariant cache hit.
[2025-06-04 04:22:18] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:22:18] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6324 after 6392
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2089 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2953ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6392 after 6828
Parikh walk visited 0 properties in 129 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:22:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:22:21] [INFO ] Invariant cache hit.
[2025-06-04 04:22:21] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6828 after 7656
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7656 after 9045
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:22:31] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9045 after 9813
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43020ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43023ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43085 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 469 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-04 04:23:05] [INFO ] Flatten gal took : 41 ms
[2025-06-04 04:23:05] [INFO ] Applying decomposition
[2025-06-04 04:23:05] [INFO ] Flatten gal took : 41 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/graph5274862345909354296.txt' '-o' '/tmp/graph5274862345909354296.bin' '-w' '/tmp/graph5274862345909354296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5274862345909354296.bin' '-l' '-1' '-v' '-w' '/tmp/graph5274862345909354296.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:23:05] [INFO ] Decomposing Gal with order
[2025-06-04 04:23:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:23:05] [INFO ] Removed a total of 3132 redundant transitions.
[2025-06-04 04:23:06] [INFO ] Flatten gal took : 198 ms
[2025-06-04 04:23:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 434 labels/synchronizations in 30 ms.
[2025-06-04 04:23:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17070646925680326849.gal : 3 ms
[2025-06-04 04:23:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7524485899311835484.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/ReachabilityCardinality17070646925680326849.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7524485899311835484.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/ReachabilityCardinality7524485899311835484.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 37
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :37 after 1173
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1173 after 4538
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4538 after 15402
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :15402 after 25700
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :25700 after 63093
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :580792 after 609394
Interrupted probabilistic random walk after 250764 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 250764 steps, saw 72666 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2025-06-04 04:23:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:23:07] [INFO ] Invariant cache hit.
[2025-06-04 04:23:07] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:23:08] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :2.61539e+06 after 2.74794e+06
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3412ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 222 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 72 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 71 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-06-04 04:23:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:23:12] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-06-04 04:23:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:23:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 04:23:13] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:23:13] [INFO ] Redundant transitions in 29 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-04 04:23:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-04 04:23:13] [INFO ] Invariant cache hit.
[2025-06-04 04:23:13] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.88283e+06 after 7.36108e+06
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:23:24] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.32219e+07 after 1.56198e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31774 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65281ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66876 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-06 in 242998 ms.
[2025-06-04 04:24:18] [INFO ] Flatten gal took : 61 ms
[2025-06-04 04:24:18] [INFO ] Applying decomposition
[2025-06-04 04:24:18] [INFO ] Flatten gal took : 62 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/graph7666078231895347757.txt' '-o' '/tmp/graph7666078231895347757.bin' '-w' '/tmp/graph7666078231895347757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7666078231895347757.bin' '-l' '-1' '-v' '-w' '/tmp/graph7666078231895347757.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:24:18] [INFO ] Decomposing Gal with order
[2025-06-04 04:24:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:24:19] [INFO ] Removed a total of 2986 redundant transitions.
[2025-06-04 04:24:19] [INFO ] Flatten gal took : 285 ms
[2025-06-04 04:24:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 531 labels/synchronizations in 45 ms.
[2025-06-04 04:24:19] [INFO ] Time to serialize gal into /tmp/UpperBounds13805473744442833639.gal : 3 ms
[2025-06-04 04:24:19] [INFO ] Time to serialize properties into /tmp/UpperBounds2291649188852083722.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/UpperBounds13805473744442833639.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2291649188852083722.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 ...284
Loading property file /tmp/UpperBounds2291649188852083722.prop.
Detected timeout of ITS tools.
[2025-06-04 04:48:58] [INFO ] Flatten gal took : 37 ms
[2025-06-04 04:48:58] [INFO ] Time to serialize gal into /tmp/UpperBounds5210013783101010048.gal : 10 ms
[2025-06-04 04:48:58] [INFO ] Time to serialize properties into /tmp/UpperBounds11618722353139358192.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/UpperBounds5210013783101010048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11618722353139358192.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 ...305
Loading property file /tmp/UpperBounds11618722353139358192.prop.
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="BridgeAndVehicles-PT-V50P50N10"
export BK_EXAMINATION="UpperBounds"
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 BridgeAndVehicles-PT-V50P50N10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-smll-174853765100413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N10.tgz
mv BridgeAndVehicles-PT-V50P50N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;