Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813600238.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 CANConstruction-PT-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813600238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 12M 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 booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2023-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748718713004

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 19:11:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 19:11:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 19:11:57] [INFO ] Load time of PNML (sax parser for PT used): 1510 ms
[2025-05-31 19:11:57] [INFO ] Transformed 17282 places.
[2025-05-31 19:11:57] [INFO ] Transformed 33120 transitions.
[2025-05-31 19:11:57] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 1928 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (24 resets) in 7019 ms. (5 steps per ms) remains 12/16 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1104 ms. (36 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
// Phase 1: matrix 33120 rows 17282 cols
[2025-05-31 19:12:02] [INFO ] Computed 181 invariants in 837 ms
[2025-05-31 19:12:02] [INFO ] Flatten gal took : 2970 ms
[2025-05-31 19:12:02] [INFO ] State equation strengthened by 16110 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 19:12:03] [INFO ] Flatten gal took : 1112 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-05-31 19:12:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11496074933308125653.gal : 391 ms
[2025-05-31 19:12:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8796093479186385645.prop : 3 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/ReachabilityCardinality11496074933308125653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8796093479186385645.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
Problem CANConstruction-PT-090-ReachabilityCardinality-2025-04 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 17037/17168 variables, 68/68 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17168/50402 variables, and 68 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 68/91 constraints, Generalized P Invariants (flows): 0/90 constraints, State Equation: 0/17282 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 12/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem CANConstruction-PT-090-ReachabilityCardinality-2025-10 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 17038/17168 variables, 68/68 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality8796093479186385645.prop.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:13:18] [INFO ] Deduced a trap composed of 5 places in 64809 ms of which 547 ms to minimize.
SMT process timed out in 76668ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 129 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 619 transitions
Trivial Post-agglo rules discarded 619 transitions
Performed 619 trivial Post agglomeration. Transition count delta: 619
Iterating post reduction 0 with 619 rules applied. Total rules applied 619 place count 17282 transition count 32501
Reduce places removed 619 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 622 rules applied. Total rules applied 1241 place count 16663 transition count 32498
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1244 place count 16660 transition count 32498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1244 place count 16660 transition count 32497
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1246 place count 16659 transition count 32497
Discarding 7853 places :
Symmetric choice reduction at 3 with 7853 rule applications. Total rules 9099 place count 8806 transition count 16791
Iterating global reduction 3 with 7853 rules applied. Total rules applied 16952 place count 8806 transition count 16791
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 8 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 17126 place count 8719 transition count 16704
Free-agglomeration rule applied 84 times.
Iterating global reduction 3 with 84 rules applied. Total rules applied 17210 place count 8719 transition count 16620
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 17294 place count 8635 transition count 16620
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 17297 place count 8635 transition count 16617
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 17300 place count 8632 transition count 16617
Partial Free-agglomeration rule applied 97 times.
Drop transitions (Partial Free agglomeration) removed 97 transitions
Iterating global reduction 5 with 97 rules applied. Total rules applied 17397 place count 8632 transition count 16617
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 17400 place count 8632 transition count 16617
Applied a total of 17400 rules in 30184 ms. Remains 8632 /17282 variables (removed 8650) and now considering 16617/33120 (removed 16503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30200 ms. Remains : 8632/17282 places, 16617/33120 transitions.
RANDOM walk for 40000 steps (61 resets) in 1892 ms. (21 steps per ms) remains 5/10 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
// Phase 1: matrix 16617 rows 8632 cols
[2025-05-31 19:13:49] [INFO ] Computed 181 invariants in 145 ms
[2025-05-31 19:13:49] [INFO ] State equation strengthened by 16241 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANConstruction-PT-090-ReachabilityCardinality-2025-02 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 8400/8514 variables, 64/64 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8514 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/8541 variables, 27/91 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8541 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 90/8631 variables, 90/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8631 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 16617/25248 variables, 8631/8812 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25248 variables, 16241/25053 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25248 variables, 0/25053 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/25249 variables, 1/25054 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25249/25249 variables, and 25054 constraints, problems are : Problem set: 1 solved, 4 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8632/8632 constraints, ReadFeed: 16241/16241 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8433/8490 variables, 40/40 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:14:57] [INFO ] Deduced a trap composed of 2 places in 20723 ms of which 215 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:15:02] [INFO ] Deduced a trap composed of 93 places in 5227 ms of which 522 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:15:08] [INFO ] Deduced a trap composed of 93 places in 5551 ms of which 616 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:15:13] [INFO ] Deduced a trap composed of 93 places in 4917 ms of which 528 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:15:18] [INFO ] Deduced a trap composed of 93 places in 4442 ms of which 428 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:15:22] [INFO ] Deduced a trap composed of 93 places in 4697 ms of which 524 ms to minimize.
SMT process timed out in 93718ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 57 out of 8632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8632/8632 places, 16617/16617 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 8626 transition count 16605
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 8626 transition count 16605
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 68 place count 8598 transition count 16577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 80 place count 8592 transition count 16577
Applied a total of 80 rules in 17479 ms. Remains 8592 /8632 variables (removed 40) and now considering 16577/16617 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17479 ms. Remains : 8592/8632 places, 16577/16617 transitions.
RANDOM walk for 40000 steps (60 resets) in 1967 ms. (20 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
// Phase 1: matrix 16577 rows 8592 cols
[2025-05-31 19:15:41] [INFO ] Computed 181 invariants in 219 ms
[2025-05-31 19:15:41] [INFO ] State equation strengthened by 16281 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8393/8448 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8448 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 53/8501 variables, 53/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8501 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 90/8591 variables, 90/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8591 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16577/25168 variables, 8591/8772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25168 variables, 16281/25053 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25168 variables, 0/25053 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/25169 variables, 1/25054 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25169 variables, 0/25054 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/25169 variables, 0/25054 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25169/25169 variables, and 25054 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56212 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8592/8592 constraints, ReadFeed: 16281/16281 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8393/8448 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:00] [INFO ] Deduced a trap composed of 2 places in 20644 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:05] [INFO ] Deduced a trap composed of 93 places in 4755 ms of which 422 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:09] [INFO ] Deduced a trap composed of 93 places in 4373 ms of which 415 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:15] [INFO ] Deduced a trap composed of 93 places in 4976 ms of which 422 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:19] [INFO ] Deduced a trap composed of 93 places in 4133 ms of which 412 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:23] [INFO ] Deduced a trap composed of 93 places in 3931 ms of which 377 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:27] [INFO ] Deduced a trap composed of 93 places in 3631 ms of which 380 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:31] [INFO ] Deduced a trap composed of 93 places in 3606 ms of which 374 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:34] [INFO ] Deduced a trap composed of 93 places in 3580 ms of which 379 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:39] [INFO ] Deduced a trap composed of 93 places in 4802 ms of which 556 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:44] [INFO ] Deduced a trap composed of 93 places in 4883 ms of which 526 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:49] [INFO ] Deduced a trap composed of 93 places in 4924 ms of which 534 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:17:54] [INFO ] Deduced a trap composed of 93 places in 4568 ms of which 423 ms to minimize.
SMT process timed out in 133318ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 55 out of 8592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8592/8592 places, 16577/16577 transitions.
Applied a total of 0 rules in 4339 ms. Remains 8592 /8592 variables (removed 0) and now considering 16577/16577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4339 ms. Remains : 8592/8592 places, 16577/16577 transitions.
RANDOM walk for 40000 steps (62 resets) in 2474 ms. (16 steps per ms) remains 2/3 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
[2025-05-31 19:17:59] [INFO ] Invariant cache hit.
[2025-05-31 19:18:00] [INFO ] State equation strengthened by 16281 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8403/8438 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8438 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/8501 variables, 63/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8501 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/8591 variables, 90/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8591 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16577/25168 variables, 8591/8772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25168 variables, 16281/25053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25168 variables, 0/25053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/25169 variables, 1/25054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25169 variables, 0/25054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/25169 variables, 0/25054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25169/25169 variables, and 25054 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31426 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8592/8592 constraints, ReadFeed: 16281/16281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8403/8438 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:18:56] [INFO ] Deduced a trap composed of 2 places in 23048 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:18:58] [INFO ] Deduced a trap composed of 93 places in 2417 ms of which 250 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:01] [INFO ] Deduced a trap composed of 96 places in 2364 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:04] [INFO ] Deduced a trap composed of 95 places in 2541 ms of which 252 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:06] [INFO ] Deduced a trap composed of 96 places in 2719 ms of which 310 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:09] [INFO ] Deduced a trap composed of 96 places in 2458 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:12] [INFO ] Deduced a trap composed of 96 places in 2330 ms of which 233 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:14] [INFO ] Deduced a trap composed of 96 places in 2285 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:16] [INFO ] Deduced a trap composed of 96 places in 2059 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:19] [INFO ] Deduced a trap composed of 96 places in 2219 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:21] [INFO ] Deduced a trap composed of 96 places in 1873 ms of which 261 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:23] [INFO ] Deduced a trap composed of 96 places in 1964 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:25] [INFO ] Deduced a trap composed of 96 places in 1982 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:27] [INFO ] Deduced a trap composed of 96 places in 1792 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:29] [INFO ] Deduced a trap composed of 96 places in 2200 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:32] [INFO ] Deduced a trap composed of 96 places in 2161 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:34] [INFO ] Deduced a trap composed of 96 places in 2008 ms of which 268 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:36] [INFO ] Deduced a trap composed of 96 places in 1725 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:37] [INFO ] Deduced a trap composed of 96 places in 1624 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:40] [INFO ] Deduced a trap composed of 96 places in 2047 ms of which 171 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8438 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:42] [INFO ] Deduced a trap composed of 96 places in 2542 ms of which 271 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:44] [INFO ] Deduced a trap composed of 96 places in 1942 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:46] [INFO ] Deduced a trap composed of 96 places in 1311 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:48] [INFO ] Deduced a trap composed of 96 places in 1503 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:49] [INFO ] Deduced a trap composed of 93 places in 1602 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:51] [INFO ] Deduced a trap composed of 96 places in 1297 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:53] [INFO ] Deduced a trap composed of 96 places in 1618 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:54] [INFO ] Deduced a trap composed of 96 places in 1284 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:55] [INFO ] Deduced a trap composed of 96 places in 1216 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:57] [INFO ] Deduced a trap composed of 93 places in 1612 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:19:59] [INFO ] Deduced a trap composed of 93 places in 1684 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:20:01] [INFO ] Deduced a trap composed of 96 places in 1329 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:20:02] [INFO ] Deduced a trap composed of 96 places in 1126 ms of which 25 ms to minimize.
SMT process timed out in 122382ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 8592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8592/8592 places, 16577/16577 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8591 transition count 16575
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8591 transition count 16575
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 18 place count 8583 transition count 16567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 20 place count 8582 transition count 16567
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 8582 transition count 16566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 8581 transition count 16566
Applied a total of 22 rules in 20208 ms. Remains 8581 /8592 variables (removed 11) and now considering 16566/16577 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20213 ms. Remains : 8581/8592 places, 16566/16577 transitions.
RANDOM walk for 40000 steps (60 resets) in 1795 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 93643 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 2
Probabilistic random walk after 93643 steps, saw 88763 distinct states, run finished after 3011 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 16566 rows 8581 cols
[2025-05-31 19:20:26] [INFO ] Computed 181 invariants in 151 ms
[2025-05-31 19:20:26] [INFO ] State equation strengthened by 16291 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8392/8427 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8427 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/8490 variables, 63/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8490 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/8580 variables, 90/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8580 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16566/25146 variables, 8580/8761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25146 variables, 16291/25052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25146 variables, 0/25052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/25147 variables, 1/25053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25147 variables, 0/25053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/25147 variables, 0/25053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25147/25147 variables, and 25053 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24375 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8581/8581 constraints, ReadFeed: 16291/16291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8392/8427 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:21:14] [INFO ] Deduced a trap composed of 2 places in 21712 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:21:35] [INFO ] Deduced a trap composed of 2 places in 20829 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:21:56] [INFO ] Deduced a trap composed of 2 places in 21214 ms of which 181 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:22:17] [INFO ] Deduced a trap composed of 2 places in 20348 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:22:37] [INFO ] Deduced a trap composed of 2 places in 20144 ms of which 181 ms to minimize.
SMT process timed out in 131210ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 8581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8581/8581 places, 16566/16566 transitions.
Applied a total of 0 rules in 4306 ms. Remains 8581 /8581 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4307 ms. Remains : 8581/8581 places, 16566/16566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8581/8581 places, 16566/16566 transitions.
Applied a total of 0 rules in 4263 ms. Remains 8581 /8581 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
[2025-05-31 19:22:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:23:08] [INFO ] Implicit Places using invariants in 22879 ms returned [5, 11, 15, 21, 27, 31, 37, 41, 47, 53, 57, 63, 69, 73, 79, 85, 91, 95, 99, 103, 107, 113, 119, 125, 131, 136, 142, 148, 154, 158, 164, 170, 176, 182, 186, 190, 194, 200, 204, 210, 216, 222, 228, 234, 240, 246, 250, 254, 258, 262, 266, 270, 274, 278, 283, 289, 293, 297, 303, 307, 313, 319, 323, 327, 331, 337, 341, 347, 351, 357, 363, 369, 375, 381, 385, 391, 395, 399, 405, 411, 417, 421, 425, 429, 433, 439, 443, 447, 453, 459]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 22926 ms to find 90 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 8491/8581 places, 16566/16566 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 8491 transition count 16552
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 8477 transition count 16552
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 8475 transition count 16550
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 8475 transition count 16550
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 4 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 188 place count 8397 transition count 16472
Applied a total of 188 rules in 15717 ms. Remains 8397 /8491 variables (removed 94) and now considering 16472/16566 (removed 94) transitions.
// Phase 1: matrix 16472 rows 8397 cols
[2025-05-31 19:23:25] [INFO ] Computed 91 invariants in 504 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:23:47] [INFO ] Implicit Places using invariants in 22981 ms returned []
Implicit Place search using SMT only with invariants took 22982 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8397/8581 places, 16472/16566 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65889 ms. Remains : 8397/8581 places, 16472/16566 transitions.
RANDOM walk for 40000 steps (61 resets) in 1599 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 93624 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 2
Probabilistic random walk after 93624 steps, saw 89260 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2025-05-31 19:23:51] [INFO ] Invariant cache hit.
[2025-05-31 19:23:51] [INFO ] State equation strengthened by 16158 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8298/8333 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8333 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/8396 variables, 63/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8396 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16472/24868 variables, 8396/8487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24868 variables, 16158/24645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24868 variables, 0/24645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/24869 variables, 1/24646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24869 variables, 0/24646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/24869 variables, 0/24646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24869/24869 variables, and 24646 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23107 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 8397/8397 constraints, ReadFeed: 16158/16158 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8298/8333 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 92
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :92 after 93
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :93 after 95
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :95 after 98
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :98 after 104
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :104 after 115
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :115 after 137
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :137 after 180
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :180 after 187
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :187 after 200
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :200 after 220
[2025-05-31 19:24:37] [INFO ] Deduced a trap composed of 2 places in 21167 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:40] [INFO ] Deduced a trap composed of 93 places in 2479 ms of which 281 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:42] [INFO ] Deduced a trap composed of 93 places in 2368 ms of which 269 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :220 after 260
[2025-05-31 19:24:45] [INFO ] Deduced a trap composed of 93 places in 2327 ms of which 268 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:47] [INFO ] Deduced a trap composed of 93 places in 2678 ms of which 262 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:50] [INFO ] Deduced a trap composed of 93 places in 2193 ms of which 248 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:52] [INFO ] Deduced a trap composed of 94 places in 2240 ms of which 251 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:54] [INFO ] Deduced a trap composed of 94 places in 2106 ms of which 218 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:57] [INFO ] Deduced a trap composed of 93 places in 2355 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:24:59] [INFO ] Deduced a trap composed of 93 places in 2138 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:02] [INFO ] Deduced a trap composed of 93 places in 2375 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:04] [INFO ] Deduced a trap composed of 93 places in 2142 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:06] [INFO ] Deduced a trap composed of 93 places in 2106 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:08] [INFO ] Deduced a trap composed of 94 places in 1691 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:10] [INFO ] Deduced a trap composed of 94 places in 1570 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:12] [INFO ] Deduced a trap composed of 93 places in 2099 ms of which 236 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:14] [INFO ] Deduced a trap composed of 93 places in 2082 ms of which 236 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:16] [INFO ] Deduced a trap composed of 93 places in 1887 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:18] [INFO ] Deduced a trap composed of 93 places in 1828 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:20] [INFO ] Deduced a trap composed of 94 places in 1465 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8333 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:22] [INFO ] Deduced a trap composed of 93 places in 1638 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:23] [INFO ] Deduced a trap composed of 93 places in 1525 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:25] [INFO ] Deduced a trap composed of 93 places in 1334 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:27] [INFO ] Deduced a trap composed of 93 places in 1536 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:28] [INFO ] Deduced a trap composed of 93 places in 1320 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:30] [INFO ] Deduced a trap composed of 93 places in 1346 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:31] [INFO ] Deduced a trap composed of 93 places in 1331 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:33] [INFO ] Deduced a trap composed of 93 places in 1294 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:34] [INFO ] Deduced a trap composed of 93 places in 1417 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:35] [INFO ] Deduced a trap composed of 94 places in 884 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:37] [INFO ] Deduced a trap composed of 93 places in 1842 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:39] [INFO ] Deduced a trap composed of 93 places in 2099 ms of which 254 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:41] [INFO ] Deduced a trap composed of 93 places in 1690 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:43] [INFO ] Deduced a trap composed of 93 places in 1564 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:44] [INFO ] Deduced a trap composed of 93 places in 1275 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:46] [INFO ] Deduced a trap composed of 93 places in 1303 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:48] [INFO ] Deduced a trap composed of 93 places in 1508 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:49] [INFO ] Deduced a trap composed of 93 places in 1495 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:51] [INFO ] Deduced a trap composed of 94 places in 1703 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:53] [INFO ] Deduced a trap composed of 93 places in 1483 ms of which 150 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/8333 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:55] [INFO ] Deduced a trap composed of 94 places in 1869 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:56] [INFO ] Deduced a trap composed of 94 places in 1581 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:58] [INFO ] Deduced a trap composed of 93 places in 1226 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:25:59] [INFO ] Deduced a trap composed of 93 places in 1238 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:01] [INFO ] Deduced a trap composed of 93 places in 1234 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:02] [INFO ] Deduced a trap composed of 94 places in 922 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:03] [INFO ] Deduced a trap composed of 94 places in 1269 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:04] [INFO ] Deduced a trap composed of 94 places in 1178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:06] [INFO ] Deduced a trap composed of 93 places in 1369 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:07] [INFO ] Deduced a trap composed of 94 places in 1092 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:09] [INFO ] Deduced a trap composed of 93 places in 1471 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:10] [INFO ] Deduced a trap composed of 94 places in 1277 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:11] [INFO ] Deduced a trap composed of 94 places in 847 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:12] [INFO ] Deduced a trap composed of 94 places in 943 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:13] [INFO ] Deduced a trap composed of 94 places in 834 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 19:26:14] [INFO ] Deduced a trap composed of 94 places in 894 ms of which 20 ms to minimize.
SMT process timed out in 143634ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 8397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8397/8397 places, 16472/16472 transitions.
Applied a total of 0 rules in 5103 ms. Remains 8397 /8397 variables (removed 0) and now considering 16472/16472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5103 ms. Remains : 8397/8397 places, 16472/16472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8397/8397 places, 16472/16472 transitions.
Applied a total of 0 rules in 5009 ms. Remains 8397 /8397 variables (removed 0) and now considering 16472/16472 (removed 0) transitions.
[2025-05-31 19:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 19:26:45] [INFO ] Implicit Places using invariants in 20289 ms returned []
Implicit Place search using SMT only with invariants took 20298 ms to find 0 implicit places.
Running 16382 sub problems to find dead transitions.
[2025-05-31 19:26:45] [INFO ] Invariant cache hit.
[2025-05-31 19:26:45] [INFO ] State equation strengthened by 16158 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8396 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8396/24869 variables, and 91 constraints, problems are : Problem set: 0 solved, 16382 unsolved in 30424 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8397 constraints, ReadFeed: 0/16158 constraints, PredecessorRefiner: 16382/16382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16382 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8396 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8396/24869 variables, and 91 constraints, problems are : Problem set: 0 solved, 16382 unsolved in 30352 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8397 constraints, ReadFeed: 0/16158 constraints, PredecessorRefiner: 0/16382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94080ms problems are : Problem set: 0 solved, 16382 unsolved
Search for dead transitions found 0 dead transitions in 94165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119547 ms. Remains : 8397/8397 places, 16472/16472 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 16155 edges and 8397 vertex of which 7977 / 8397 are part of one of the 88 SCC in 12 ms
Free SCC test removed 7889 places
Drop transitions (Empty/Sink Transition effects.) removed 15690 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 15734 transitions.
Graph (complete) has 1032 edges and 508 vertex of which 290 are kept as prefixes of interest. Removing 218 places using SCC suffix rule.1 ms
Discarding 218 places :
Also discarding 127 output transitions
Drop transitions (Output transitions of discarded places.) removed 127 transitions
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 290 transition count 314
Ensure Unique test removed 1 places
Reduce places removed 179 places and 0 transitions.
Ensure Unique test removed 174 transitions
Reduce isomorphic transitions removed 174 transitions.
Iterating post reduction 1 with 353 rules applied. Total rules applied 652 place count 111 transition count 140
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 652 place count 111 transition count 130
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 672 place count 101 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 674 place count 99 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 676 place count 99 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 680 place count 99 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 682 place count 97 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 686 place count 95 transition count 126
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 692 place count 95 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 698 place count 89 transition count 120
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 719 place count 89 transition count 120
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 736 place count 72 transition count 103
Iterating global reduction 5 with 17 rules applied. Total rules applied 753 place count 72 transition count 103
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 759 place count 66 transition count 97
Applied a total of 759 rules in 92 ms. Remains 66 /8397 variables (removed 8331) and now considering 97/16472 (removed 16375) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 97 rows 66 cols
[2025-05-31 19:28:19] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 19:28:19] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 19:28:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 19:28:19] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 19:28:19] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 19:28:20] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 19:28:20] [INFO ] Flatten gal took : 7 ms
[2025-05-31 19:28:20] [INFO ] Flatten gal took : 3 ms
[2025-05-31 19:28:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3137430164674750850.gal : 2 ms
[2025-05-31 19:28:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8006701231922502768.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/ReachabilityCardinality3137430164674750850.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8006701231922502768.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8006701231922502768.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 108
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :108 after 3888
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3888 after 349920
Detected timeout of ITS tools.
[2025-05-31 19:28:35] [INFO ] Flatten gal took : 3 ms
[2025-05-31 19:28:35] [INFO ] Applying decomposition
[2025-05-31 19:28:35] [INFO ] Flatten gal took : 3 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/graph3800567939636570025.txt' '-o' '/tmp/graph3800567939636570025.bin' '-w' '/tmp/graph3800567939636570025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3800567939636570025.bin' '-l' '-1' '-v' '-w' '/tmp/graph3800567939636570025.weights' '-q' '0' '-e' '0.001'
[2025-05-31 19:28:35] [INFO ] Decomposing Gal with order
[2025-05-31 19:28:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 19:28:35] [INFO ] Flatten gal took : 67 ms
[2025-05-31 19:28:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-31 19:28:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12690418603935375514.gal : 2 ms
[2025-05-31 19:28:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14790539911601636764.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/ReachabilityCardinality12690418603935375514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14790539911601636764.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/ReachabilityCardinality14790539911601636764.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 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 864
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :864 after 349920
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30727 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 19:28:51] [INFO ] Flatten gal took : 947 ms
[2025-05-31 19:28:51] [INFO ] Applying decomposition
[2025-05-31 19:28:52] [INFO ] Flatten gal took : 842 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/graph383454487576198054.txt' '-o' '/tmp/graph383454487576198054.bin' '-w' '/tmp/graph383454487576198054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph383454487576198054.bin' '-l' '-1' '-v' '-w' '/tmp/graph383454487576198054.weights' '-q' '0' '-e' '0.001'
[2025-05-31 19:28:54] [INFO ] Decomposing Gal with order
[2025-05-31 19:28:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 19:29:04] [INFO ] Removed a total of 16727 redundant transitions.
[2025-05-31 19:29:05] [INFO ] Flatten gal took : 3291 ms
[2025-05-31 19:29:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2306 labels/synchronizations in 1347 ms.
[2025-05-31 19:29:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2138647095941488601.gal : 244 ms
[2025-05-31 19:29:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16104632776697361992.prop : 3 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/ReachabilityCardinality2138647095941488601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16104632776697361992.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
Loading property file /tmp/ReachabilityCardinality16104632776697361992.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 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 53
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :53 after 92
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :92 after 119
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :119 after 125
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :125 after 137
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :137 after 157
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :157 after 169
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :169 after 243
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :243 after 252
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :252 after 267
Detected timeout of ITS tools.
[2025-05-31 19:59:15] [INFO ] Flatten gal took : 642 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8662345465868143568
[2025-05-31 19:59:15] [INFO ] Too many transitions (16472) to apply POR reductions. Disabling POR matrices.
[2025-05-31 19:59:15] [INFO ] Applying decomposition
[2025-05-31 19:59:15] [INFO ] Built C files in 323ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8662345465868143568
Running compilation step : cd /tmp/ltsmin8662345465868143568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-31 19:59:16] [INFO ] Flatten gal took : 479 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/graph2979157069323096857.txt' '-o' '/tmp/graph2979157069323096857.bin' '-w' '/tmp/graph2979157069323096857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2979157069323096857.bin' '-l' '-1' '-v' '-w' '/tmp/graph2979157069323096857.weights' '-q' '0' '-e' '0.001'
[2025-05-31 19:59:16] [INFO ] Decomposing Gal with order
[2025-05-31 19:59:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 19:59:21] [INFO ] Removed a total of 16357 redundant transitions.
[2025-05-31 19:59:21] [INFO ] Flatten gal took : 3545 ms
[2025-05-31 19:59:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 15943 labels/synchronizations in 4016 ms.
[2025-05-31 19:59:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5688614496757893820.gal : 83 ms
[2025-05-31 19:59:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7807206849779149475.prop : 3 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/ReachabilityCardinality5688614496757893820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7807206849779149475.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7807206849779149475.prop.
Compilation finished in 251324 ms.
Running link step : cd /tmp/ltsmin8662345465868143568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 210 ms.
Running LTSmin : cd /tmp/ltsmin8662345465868143568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT090ReachabilityCardinality202407==true'
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 46
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :46 after 49
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :49 after 1122
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1122 after 1123
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1123 after 1125

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-090"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-090, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813600238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-090.tgz
mv CANConstruction-PT-090 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;