About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | TTFF?TFTTTFTTTF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300303.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 MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300303
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.1M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748923478924
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 04:04:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 04:04:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 04:04:42] [INFO ] Load time of PNML (sax parser for PT used): 693 ms
[2025-06-03 04:04:42] [INFO ] Transformed 4260 places.
[2025-06-03 04:04:42] [INFO ] Transformed 6027 transitions.
[2025-06-03 04:04:42] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 945 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (956 resets) in 3905 ms. (10 steps per ms) remains 11/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (244 resets) in 621 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (244 resets) in 756 ms. (52 steps per ms) remains 11/11 properties
[2025-06-03 04:04:44] [INFO ] Flatten gal took : 813 ms
BEST_FIRST walk for 40003 steps (244 resets) in 1331 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (244 resets) in 427 ms. (93 steps per ms) remains 11/11 properties
[2025-06-03 04:04:45] [INFO ] Flatten gal took : 458 ms
BEST_FIRST walk for 40002 steps (244 resets) in 906 ms. (44 steps per ms) remains 11/11 properties
[2025-06-03 04:04:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15133995574494467641.gal : 266 ms
[2025-06-03 04:04:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16558704171645310893.prop : 6 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/ReachabilityCardinality15133995574494467641.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16558704171645310893.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (244 resets) in 1360 ms. (29 steps per ms) remains 11/11 properties
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
BEST_FIRST walk for 40003 steps (244 resets) in 755 ms. (52 steps per ms) remains 10/11 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (245 resets) in 337 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (244 resets) in 765 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (244 resets) in 338 ms. (117 steps per ms) remains 10/10 properties
[2025-06-03 04:04:46] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2025-06-03 04:04:46] [INFO ] Computed 497 invariants in 482 ms
[2025-06-03 04:04:46] [INFO ] State equation strengthened by 1634 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality16558704171645310893.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 676/940 variables, 25/45 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/940 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/940 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 6/946 variables, 6/56 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 2326/3272 variables, 202/258 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3272 variables, 0/258 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 988/4260 variables, 239/497 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4260 variables, 0/497 constraints. Problems are: Problem set: 5 solved, 5 unsolved
SMT process timed out in 5792ms, After SMT, problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.27 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1003 transitions
Trivial Post-agglo rules discarded 1003 transitions
Performed 1003 trivial Post agglomeration. Transition count delta: 1003
Iterating post reduction 0 with 1003 rules applied. Total rules applied 1004 place count 4232 transition count 5024
Reduce places removed 1003 places and 0 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Iterating post reduction 1 with 1081 rules applied. Total rules applied 2085 place count 3229 transition count 4946
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 2163 place count 3151 transition count 4946
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 2163 place count 3151 transition count 4820
Deduced a syphon composed of 126 places in 4 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 2415 place count 3025 transition count 4820
Discarding 935 places :
Symmetric choice reduction at 3 with 935 rule applications. Total rules 3350 place count 2090 transition count 3885
Iterating global reduction 3 with 935 rules applied. Total rules applied 4285 place count 2090 transition count 3885
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4285 place count 2090 transition count 3884
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4287 place count 2089 transition count 3884
Discarding 212 places :
Symmetric choice reduction at 3 with 212 rule applications. Total rules 4499 place count 1877 transition count 3036
Iterating global reduction 3 with 212 rules applied. Total rules applied 4711 place count 1877 transition count 3036
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 4737 place count 1864 transition count 3023
Free-agglomeration rule (complex) applied 104 times.
Iterating global reduction 3 with 104 rules applied. Total rules applied 4841 place count 1864 transition count 2919
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 3 with 104 rules applied. Total rules applied 4945 place count 1760 transition count 2919
Partial Free-agglomeration rule applied 109 times.
Drop transitions (Partial Free agglomeration) removed 109 transitions
Iterating global reduction 4 with 109 rules applied. Total rules applied 5054 place count 1760 transition count 2919
Applied a total of 5054 rules in 1937 ms. Remains 1760 /4260 variables (removed 2500) and now considering 2919/6027 (removed 3108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1953 ms. Remains : 1760/4260 places, 2919/6027 transitions.
RANDOM walk for 40000 steps (1320 resets) in 921 ms. (43 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (264 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (264 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (264 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (264 resets) in 862 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (264 resets) in 247 ms. (161 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 44192 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :0 out of 5
Probabilistic random walk after 44192 steps, saw 20214 distinct states, run finished after 3009 ms. (steps per millisecond=14 ) properties seen :0
[2025-06-03 04:04:58] [INFO ] Flow matrix only has 2543 transitions (discarded 376 similar events)
// Phase 1: matrix 2543 rows 1760 cols
[2025-06-03 04:04:58] [INFO ] Computed 469 invariants in 85 ms
[2025-06-03 04:04:58] [INFO ] State equation strengthened by 998 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/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1059/1167 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1167 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3/1170 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1170 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 485/1655 variables, 329/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1655 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/1659 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1659 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 101/1760 variables, 101/469 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1760 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2543/4303 variables, 1760/2229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (INCLUDED_ONLY) 0/4303 variables, 998/3227 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4303 variables, 0/3227 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/4303 variables, 0/3227 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4303/4303 variables, and 3227 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4495 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1760/1760 constraints, ReadFeed: 998/998 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1078/1082 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:03] [INFO ] Deduced a trap composed of 468 places in 886 ms of which 234 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1082 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 29/1111 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:05] [INFO ] Deduced a trap composed of 392 places in 951 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:06] [INFO ] Deduced a trap composed of 400 places in 905 ms of which 223 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:07] [INFO ] Deduced a trap composed of 396 places in 928 ms of which 215 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:08] [INFO ] Deduced a trap composed of 397 places in 1068 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:09] [INFO ] Deduced a trap composed of 395 places in 958 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:10] [INFO ] Deduced a trap composed of 397 places in 1112 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:11] [INFO ] Deduced a trap composed of 397 places in 989 ms of which 220 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:12] [INFO ] Deduced a trap composed of 397 places in 1035 ms of which 219 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:13] [INFO ] Deduced a trap composed of 396 places in 1194 ms of which 315 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:14] [INFO ] Deduced a trap composed of 396 places in 1021 ms of which 212 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 6
[2025-06-03 04:05:15] [INFO ] Deduced a trap composed of 397 places in 883 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :9 after 14
[2025-06-03 04:05:16] [INFO ] Deduced a trap composed of 392 places in 1057 ms of which 243 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :14 after 19
[2025-06-03 04:05:17] [INFO ] Deduced a trap composed of 397 places in 1083 ms of which 219 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:18] [INFO ] Deduced a trap composed of 397 places in 1028 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :19 after 38
[2025-06-03 04:05:19] [INFO ] Deduced a trap composed of 398 places in 957 ms of which 219 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1111 variables, 15/25 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:20] [INFO ] Deduced a trap composed of 397 places in 907 ms of which 213 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:21] [INFO ] Deduced a trap composed of 392 places in 1016 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:22] [INFO ] Deduced a trap composed of 405 places in 931 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :38 after 72
[2025-06-03 04:05:23] [INFO ] Deduced a trap composed of 396 places in 927 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:24] [INFO ] Deduced a trap composed of 433 places in 1139 ms of which 340 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1111 variables, 5/30 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1111 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 516/1627 variables, 327/357 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:26] [INFO ] Deduced a trap composed of 20 places in 1494 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :72 after 110
[2025-06-03 04:05:28] [INFO ] Deduced a trap composed of 79 places in 1649 ms of which 216 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:30] [INFO ] Deduced a trap composed of 99 places in 1674 ms of which 266 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:32] [INFO ] Deduced a trap composed of 92 places in 2094 ms of which 254 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 1024
[2025-06-03 04:05:34] [INFO ] Deduced a trap composed of 107 places in 1940 ms of which 281 ms to minimize.
SDD size :110 after 396
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:36] [INFO ] Deduced a trap composed of 117 places in 1975 ms of which 330 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :396 after 417
[2025-06-03 04:05:38] [INFO ] Deduced a trap composed of 117 places in 2045 ms of which 340 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:40] [INFO ] Deduced a trap composed of 122 places in 1994 ms of which 356 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:42] [INFO ] Deduced a trap composed of 120 places in 1924 ms of which 328 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :417 after 463
[2025-06-03 04:05:44] [INFO ] Deduced a trap composed of 120 places in 2120 ms of which 330 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:46] [INFO ] Deduced a trap composed of 107 places in 1953 ms of which 287 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:48] [INFO ] Deduced a trap composed of 117 places in 1617 ms of which 321 ms to minimize.
SMT process timed out in 50402ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1760/1760 places, 2919/2919 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1760 transition count 2912
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1753 transition count 2912
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 14 place count 1753 transition count 2902
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 34 place count 1743 transition count 2902
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 56 place count 1721 transition count 2850
Iterating global reduction 2 with 22 rules applied. Total rules applied 78 place count 1721 transition count 2850
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 78 place count 1721 transition count 2846
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 1717 transition count 2846
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 1705 transition count 2798
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 1705 transition count 2798
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 1701 transition count 2794
Free-agglomeration rule (complex) applied 62 times.
Iterating global reduction 2 with 62 rules applied. Total rules applied 180 place count 1701 transition count 3434
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 242 place count 1639 transition count 3434
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 247 place count 1634 transition count 3429
Iterating global reduction 3 with 5 rules applied. Total rules applied 252 place count 1634 transition count 3429
Applied a total of 252 rules in 616 ms. Remains 1634 /1760 variables (removed 126) and now considering 3429/2919 (removed -510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 617 ms. Remains : 1634/1760 places, 3429/2919 transitions.
RANDOM walk for 40000 steps (1580 resets) in 1366 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :463 after 501
Interrupted probabilistic random walk after 50455 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 50455 steps, saw 22528 distinct states, run finished after 3002 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 04:05:52] [INFO ] Flow matrix only has 3032 transitions (discarded 397 similar events)
// Phase 1: matrix 3032 rows 1634 cols
[2025-06-03 04:05:52] [INFO ] Computed 469 invariants in 67 ms
[2025-06-03 04:05:52] [INFO ] State equation strengthened by 1634 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1021 variables, 7/7 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,11 properties remain. new max is 16384
SDD size :501 after 574
[2025-06-03 04:05:53] [INFO ] Deduced a trap composed of 520 places in 952 ms of which 244 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 26/1047 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:55] [INFO ] Deduced a trap composed of 317 places in 1252 ms of which 245 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1047 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1047 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 482/1529 variables, 355/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:57] [INFO ] Deduced a trap composed of 5 places in 2008 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:59] [INFO ] Deduced a trap composed of 63 places in 1860 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:01] [INFO ] Deduced a trap composed of 83 places in 1999 ms of which 235 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:03] [INFO ] Deduced a trap composed of 144 places in 1751 ms of which 276 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:05] [INFO ] Deduced a trap composed of 146 places in 1825 ms of which 282 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:07] [INFO ] Deduced a trap composed of 146 places in 1863 ms of which 277 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:09] [INFO ] Deduced a trap composed of 144 places in 2216 ms of which 295 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :574 after 779
[2025-06-03 04:06:11] [INFO ] Deduced a trap composed of 148 places in 1909 ms of which 282 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:13] [INFO ] Deduced a trap composed of 144 places in 1847 ms of which 304 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:15] [INFO ] Deduced a trap composed of 148 places in 1827 ms of which 289 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:17] [INFO ] Deduced a trap composed of 178 places in 1982 ms of which 327 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:19] [INFO ] Deduced a trap composed of 91 places in 2183 ms of which 256 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :779 after 1020
[2025-06-03 04:06:21] [INFO ] Deduced a trap composed of 91 places in 2100 ms of which 224 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:23] [INFO ] Deduced a trap composed of 91 places in 2094 ms of which 226 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:25] [INFO ] Deduced a trap composed of 91 places in 2117 ms of which 234 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:28] [INFO ] Deduced a trap composed of 91 places in 2213 ms of which 225 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:30] [INFO ] Deduced a trap composed of 74 places in 1857 ms of which 187 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1529 variables, 17/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1529 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/1553 variables, 24/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:32] [INFO ] Deduced a trap composed of 144 places in 2159 ms of which 294 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:34] [INFO ] Deduced a trap composed of 144 places in 2265 ms of which 312 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:37] [INFO ] Deduced a trap composed of 122 places in 2271 ms of which 265 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:39] [INFO ] Deduced a trap composed of 91 places in 2241 ms of which 242 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1553 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1553 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 81/1634 variables, 81/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1634 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3032/4666 variables, 1634/2126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4666 variables, 1634/3760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4666 variables, 0/3760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/4666 variables, 0/3760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4666/4666 variables, and 3760 constraints, problems are : Problem set: 0 solved, 2 unsolved in 50792 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1634/1634 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1021 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 26/1047 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1047 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1047 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 482/1529 variables, 355/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1529 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1529 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/1553 variables, 24/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1553 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:46] [INFO ] Deduced a trap composed of 76 places in 2071 ms of which 223 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:48] [INFO ] Deduced a trap composed of 76 places in 2110 ms of which 240 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:50] [INFO ] Deduced a trap composed of 63 places in 1973 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:52] [INFO ] Deduced a trap composed of 90 places in 2164 ms of which 301 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:54] [INFO ] Deduced a trap composed of 105 places in 2261 ms of which 412 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:57] [INFO ] Deduced a trap composed of 90 places in 2207 ms of which 374 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:59] [INFO ] Deduced a trap composed of 90 places in 2278 ms of which 326 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:01] [INFO ] Deduced a trap composed of 106 places in 2389 ms of which 292 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:04] [INFO ] Deduced a trap composed of 90 places in 2106 ms of which 287 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:06] [INFO ] Deduced a trap composed of 106 places in 2201 ms of which 361 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:08] [INFO ] Deduced a trap composed of 106 places in 2414 ms of which 332 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:10] [INFO ] Deduced a trap composed of 74 places in 2164 ms of which 250 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:13] [INFO ] Deduced a trap composed of 90 places in 2421 ms of which 284 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:15] [INFO ] Deduced a trap composed of 90 places in 2158 ms of which 291 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:17] [INFO ] Deduced a trap composed of 106 places in 2184 ms of which 329 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:19] [INFO ] Deduced a trap composed of 90 places in 2106 ms of which 279 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:22] [INFO ] Deduced a trap composed of 106 places in 2148 ms of which 380 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:24] [INFO ] Deduced a trap composed of 90 places in 2094 ms of which 257 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:26] [INFO ] Deduced a trap composed of 90 places in 2154 ms of which 299 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:28] [INFO ] Deduced a trap composed of 90 places in 2142 ms of which 257 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1553 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:30] [INFO ] Deduced a trap composed of 91 places in 2269 ms of which 227 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:33] [INFO ] Deduced a trap composed of 91 places in 2147 ms of which 246 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:35] [INFO ] Deduced a trap composed of 91 places in 2359 ms of which 233 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:38] [INFO ] Deduced a trap composed of 90 places in 2355 ms of which 310 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:40] [INFO ] Deduced a trap composed of 90 places in 2396 ms of which 402 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:42] [INFO ] Deduced a trap composed of 106 places in 2113 ms of which 289 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:44] [INFO ] Deduced a trap composed of 106 places in 1943 ms of which 283 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:46] [INFO ] Deduced a trap composed of 106 places in 2041 ms of which 259 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:48] [INFO ] Deduced a trap composed of 106 places in 1912 ms of which 271 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:51] [INFO ] Deduced a trap composed of 106 places in 2199 ms of which 387 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:53] [INFO ] Deduced a trap composed of 106 places in 2604 ms of which 315 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:56] [INFO ] Deduced a trap composed of 106 places in 2619 ms of which 471 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:59] [INFO ] Deduced a trap composed of 106 places in 2995 ms of which 593 ms to minimize.
SMT process timed out in 126982ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1634/1634 places, 3429/3429 transitions.
Applied a total of 0 rules in 129 ms. Remains 1634 /1634 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 1634/1634 places, 3429/3429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1634/1634 places, 3429/3429 transitions.
Applied a total of 0 rules in 125 ms. Remains 1634 /1634 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
[2025-06-03 04:07:59] [INFO ] Flow matrix only has 3032 transitions (discarded 397 similar events)
[2025-06-03 04:07:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:08:05] [INFO ] Implicit Places using invariants in 5566 ms returned [4, 7, 9, 10, 11, 12, 13, 17, 23, 31, 41, 53, 67, 82, 96, 97, 98, 99, 100, 112, 122, 130, 136, 140, 142, 153, 159, 161, 162, 163, 164, 165, 167, 171, 177, 185, 195, 207, 220, 232, 233, 234, 235, 236, 246, 254, 260, 264, 266, 268, 279, 285, 287, 288, 289, 290, 291, 293, 295, 299, 305, 313, 323, 334, 344, 345, 346, 347, 348, 356, 362, 366, 368, 370, 372, 383, 389, 391, 392, 393, 394, 395, 397, 399, 401, 405, 411, 419, 428, 436, 437, 438, 439, 440, 446, 450, 452, 454, 456, 458, 469, 475, 477, 478, 479, 480, 481, 483, 485, 487, 489, 493, 499, 506, 512, 513, 514, 515, 516, 520, 522, 524, 526, 528, 530, 541, 547, 549, 550, 551, 552, 553, 555, 557, 559, 561, 563, 567, 572, 576, 577, 578, 579, 580, 582, 584, 586, 588, 590, 592, 603, 609, 611, 612, 613, 614, 615, 617, 619, 621, 623, 625, 627, 630, 632, 633, 634, 635, 636, 638, 640, 642, 644, 646, 648, 659, 665, 667, 668, 669, 670, 671, 673, 675, 677, 679, 681, 683, 685, 687, 688, 689, 690, 691, 693, 695, 697, 699, 701, 703, 714, 716, 719, 721, 722, 723, 724, 725, 727, 729, 731, 733, 735, 737, 739, 741, 742, 743, 744, 745, 747, 749, 751, 753, 755, 757, 768, 774, 776, 777, 778, 779, 780, 782, 784, 786, 788, 790, 792, 794, 796, 797, 798, 799, 800, 802, 804, 806, 808, 810, 812, 823, 829, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 849, 852, 853, 854, 855, 856, 858, 860, 862, 864, 866, 868, 879, 885, 887, 888, 889, 890, 891, 893, 895, 897, 899, 901, 903, 907, 912, 913, 914, 915, 916, 920, 922, 924, 926, 928, 930, 941, 947, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 967, 973, 980, 981, 982, 983, 984, 990, 994, 996, 998, 1000, 1002, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1037, 1043, 1051, 1060, 1061, 1062, 1063, 1064, 1072, 1078, 1082, 1084, 1086, 1088, 1099, 1105, 1107, 1108, 1109, 1110, 1111, 1113, 1115, 1117, 1121, 1127, 1135, 1145, 1156, 1157, 1158, 1159, 1160, 1170, 1178, 1184, 1188, 1190, 1192, 1203, 1209, 1211, 1212, 1213, 1214, 1215, 1217, 1219, 1223, 1229, 1237, 1247, 1259, 1272, 1273, 1274, 1275, 1276, 1288, 1298, 1306, 1312, 1316, 1318, 1329, 1331, 1334, 1336, 1337, 1338, 1339, 1340, 1342, 1346, 1352, 1360, 1370, 1383, 1397, 1412, 1413, 1414, 1415, 1416, 1430, 1442, 1452, 1460, 1466, 1470, 1481]
[2025-06-03 04:08:05] [INFO ] Actually due to overlaps returned [153, 279, 383, 469, 541, 603, 659, 714, 768, 823, 879, 941, 1013, 1099, 1203, 1329, 1481, 4, 9, 10, 11, 12, 96, 97, 98, 99, 161, 162, 163, 164, 232, 233, 234, 235, 287, 288, 289, 290, 344, 345, 346, 347, 391, 392, 393, 394, 436, 437, 438, 439, 477, 478, 479, 480, 512, 513, 514, 515, 549, 550, 551, 552, 576, 577, 578, 579, 611, 612, 613, 614, 632, 633, 634, 635, 667, 668, 669, 670, 687, 688, 689, 690, 716, 721, 722, 723, 724, 741, 742, 743, 744, 776, 777, 778, 779, 796, 797, 798, 799, 831, 832, 833, 834, 852, 853, 854, 855, 887, 888, 889, 890, 912, 913, 914, 915, 949, 950, 951, 952, 980, 981, 982, 983, 1021, 1022, 1023, 1024, 1060, 1061, 1062, 1063, 1107, 1108, 1109, 1110, 1156, 1157, 1158, 1159, 1211, 1212, 1213, 1214, 1272, 1273, 1274, 1275, 1331, 1336, 1337, 1338, 1339, 1412, 1413, 1414, 1415]
Discarding 156 places :
Implicit Place search using SMT only with invariants took 5601 ms to find 156 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1478/1634 places, 3429/3429 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 1350 transition count 3301
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 1350 transition count 3301
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 384 place count 1222 transition count 3173
Iterating global reduction 0 with 128 rules applied. Total rules applied 512 place count 1222 transition count 3173
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 515 place count 1222 transition count 3170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 518 place count 1219 transition count 3170
Applied a total of 518 rules in 314 ms. Remains 1219 /1478 variables (removed 259) and now considering 3170/3429 (removed 259) transitions.
[2025-06-03 04:08:05] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
// Phase 1: matrix 2773 rows 1219 cols
[2025-06-03 04:08:05] [INFO ] Computed 313 invariants in 75 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:08:09] [INFO ] Implicit Places using invariants in 3805 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 148, 150, 152, 156, 162, 170, 180, 192, 205, 217, 227, 235, 241, 245, 247, 249, 257, 259, 261, 263, 267, 273, 281, 291, 302, 312, 320, 326, 330, 332, 334, 336, 344, 346, 348, 350, 352, 356, 362, 370, 379, 387, 393, 397, 399, 401, 403, 405, 413, 415, 417, 419, 421, 423, 427, 433, 440, 446, 450, 452, 454, 456, 458, 460, 468, 470, 472, 474, 476, 478, 480, 484, 489, 493, 495, 497, 499, 501, 503, 505, 513, 515, 517, 519, 521, 523, 525, 527, 530, 532, 534, 536, 538, 540, 542, 544, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 625, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 663, 665, 667, 669, 671, 673, 675, 677, 679, 682, 684, 686, 688, 690, 692, 694, 702, 704, 706, 708, 710, 712, 714, 716, 720, 725, 729, 731, 733, 735, 737, 739, 747, 749, 751, 753, 755, 757, 759, 763, 769, 776, 782, 786, 788, 790, 792, 794, 802, 804, 806, 808, 810, 812, 816, 822, 830, 839, 847, 853, 857, 859, 861, 863, 871, 873, 875, 877, 879, 883, 889, 897, 907, 918, 928, 936, 942, 946, 948, 950, 958, 960, 962, 964, 968, 974, 982, 992, 1004, 1017, 1029, 1039, 1047, 1053, 1057, 1059, 1065, 1067, 1069, 1073, 1079, 1087, 1097, 1110, 1124, 1139, 1153, 1165, 1175, 1183, 1189, 1193]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 3815 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/1634 places, 3170/3429 transitions.
Applied a total of 0 rules in 96 ms. Remains 947 /947 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9952 ms. Remains : 947/1634 places, 3170/3429 transitions.
RANDOM walk for 40000 steps (1705 resets) in 1141 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (188 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 56147 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56147 steps, saw 23375 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 04:08:13] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
// Phase 1: matrix 2773 rows 947 cols
[2025-06-03 04:08:13] [INFO ] Computed 41 invariants in 36 ms
[2025-06-03 04:08:13] [INFO ] State equation strengthened by 1634 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 868/872 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:14] [INFO ] Deduced a trap composed of 495 places in 971 ms of which 291 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/872 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/891 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:15] [INFO ] Deduced a trap composed of 95 places in 1032 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:16] [INFO ] Deduced a trap composed of 49 places in 1005 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:17] [INFO ] Deduced a trap composed of 113 places in 1054 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:18] [INFO ] Deduced a trap composed of 110 places in 1039 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:19] [INFO ] Deduced a trap composed of 63 places in 953 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:20] [INFO ] Deduced a trap composed of 67 places in 1137 ms of which 89 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:21] [INFO ] Deduced a trap composed of 81 places in 973 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:22] [INFO ] Deduced a trap composed of 64 places in 954 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:23] [INFO ] Deduced a trap composed of 65 places in 933 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:24] [INFO ] Deduced a trap composed of 49 places in 941 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:25] [INFO ] Deduced a trap composed of 135 places in 1001 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:26] [INFO ] Deduced a trap composed of 542 places in 1070 ms of which 298 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:28] [INFO ] Deduced a trap composed of 71 places in 1114 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:29] [INFO ] Deduced a trap composed of 81 places in 1078 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:30] [INFO ] Deduced a trap composed of 95 places in 1163 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:31] [INFO ] Deduced a trap composed of 135 places in 1018 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:32] [INFO ] Deduced a trap composed of 64 places in 1159 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:33] [INFO ] Deduced a trap composed of 113 places in 1013 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:34] [INFO ] Deduced a trap composed of 64 places in 1184 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:36] [INFO ] Deduced a trap composed of 162 places in 1191 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:37] [INFO ] Deduced a trap composed of 65 places in 1166 ms of which 92 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/891 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/915 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/939 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/947 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/947 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2773/3720 variables, 947/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3720 variables, 1634/2644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3720 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/3720 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3720/3720 variables, and 2644 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26685 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 947/947 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 868/872 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/872 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/891 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 24/915 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:41] [INFO ] Deduced a trap composed of 5 places in 970 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:42] [INFO ] Deduced a trap composed of 44 places in 1237 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 131072
[2025-06-03 04:08:43] [INFO ] Deduced a trap composed of 44 places in 1198 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :1020 after 2644
[2025-06-03 04:08:44] [INFO ] Deduced a trap composed of 44 places in 1164 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:45] [INFO ] Deduced a trap composed of 44 places in 1044 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:47] [INFO ] Deduced a trap composed of 44 places in 1189 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:48] [INFO ] Deduced a trap composed of 44 places in 1356 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:49] [INFO ] Deduced a trap composed of 44 places in 1071 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:50] [INFO ] Deduced a trap composed of 44 places in 1286 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:52] [INFO ] Deduced a trap composed of 44 places in 1168 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:53] [INFO ] Deduced a trap composed of 44 places in 1165 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:54] [INFO ] Deduced a trap composed of 44 places in 1069 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:55] [INFO ] Deduced a trap composed of 44 places in 1066 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:56] [INFO ] Deduced a trap composed of 44 places in 1116 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:57] [INFO ] Deduced a trap composed of 44 places in 1076 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:58] [INFO ] Deduced a trap composed of 44 places in 1067 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:59] [INFO ] Deduced a trap composed of 44 places in 1055 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:00] [INFO ] Deduced a trap composed of 44 places in 1057 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:02] [INFO ] Deduced a trap composed of 44 places in 1055 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:03] [INFO ] Deduced a trap composed of 44 places in 1027 ms of which 83 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/915 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:04] [INFO ] Deduced a trap composed of 44 places in 1039 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:05] [INFO ] Deduced a trap composed of 48 places in 865 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:06] [INFO ] Deduced a trap composed of 45 places in 1064 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:07] [INFO ] Deduced a trap composed of 45 places in 1068 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:08] [INFO ] Deduced a trap composed of 45 places in 1082 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:09] [INFO ] Deduced a trap composed of 45 places in 1081 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:10] [INFO ] Deduced a trap composed of 45 places in 1022 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:11] [INFO ] Deduced a trap composed of 49 places in 975 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:12] [INFO ] Deduced a trap composed of 45 places in 984 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:13] [INFO ] Deduced a trap composed of 45 places in 1035 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:14] [INFO ] Deduced a trap composed of 44 places in 1027 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:15] [INFO ] Deduced a trap composed of 45 places in 978 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:16] [INFO ] Deduced a trap composed of 50 places in 928 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:17] [INFO ] Deduced a trap composed of 51 places in 921 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:18] [INFO ] Deduced a trap composed of 51 places in 955 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:19] [INFO ] Deduced a trap composed of 52 places in 926 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:20] [INFO ] Deduced a trap composed of 48 places in 974 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:21] [INFO ] Deduced a trap composed of 49 places in 1064 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:22] [INFO ] Deduced a trap composed of 49 places in 1046 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:23] [INFO ] Deduced a trap composed of 50 places in 908 ms of which 91 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:24] [INFO ] Deduced a trap composed of 44 places in 1050 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:25] [INFO ] Deduced a trap composed of 45 places in 1026 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:26] [INFO ] Deduced a trap composed of 45 places in 1032 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:27] [INFO ] Deduced a trap composed of 44 places in 982 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:28] [INFO ] Deduced a trap composed of 45 places in 1101 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:30] [INFO ] Deduced a trap composed of 45 places in 1056 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:31] [INFO ] Deduced a trap composed of 45 places in 1063 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:32] [INFO ] Deduced a trap composed of 45 places in 1006 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:33] [INFO ] Deduced a trap composed of 49 places in 1029 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:34] [INFO ] Deduced a trap composed of 50 places in 1047 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:35] [INFO ] Deduced a trap composed of 50 places in 1013 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:36] [INFO ] Deduced a trap composed of 44 places in 1067 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:37] [INFO ] Deduced a trap composed of 44 places in 1054 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:38] [INFO ] Deduced a trap composed of 45 places in 1057 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:39] [INFO ] Deduced a trap composed of 45 places in 1063 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:40] [INFO ] Deduced a trap composed of 45 places in 1067 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:41] [INFO ] Deduced a trap composed of 45 places in 1066 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:42] [INFO ] Deduced a trap composed of 52 places in 1057 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:44] [INFO ] Deduced a trap composed of 53 places in 1070 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:45] [INFO ] Deduced a trap composed of 49 places in 1147 ms of which 96 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:46] [INFO ] Deduced a trap composed of 49 places in 1190 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:47] [INFO ] Deduced a trap composed of 52 places in 1171 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:48] [INFO ] Deduced a trap composed of 50 places in 1178 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:50] [INFO ] Deduced a trap composed of 53 places in 1167 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:51] [INFO ] Deduced a trap composed of 49 places in 1160 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:52] [INFO ] Deduced a trap composed of 44 places in 1152 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:53] [INFO ] Deduced a trap composed of 44 places in 1110 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:54] [INFO ] Deduced a trap composed of 44 places in 1085 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:55] [INFO ] Deduced a trap composed of 44 places in 917 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:56] [INFO ] Deduced a trap composed of 44 places in 1152 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:58] [INFO ] Deduced a trap composed of 44 places in 1100 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:09:59] [INFO ] Deduced a trap composed of 44 places in 1047 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:00] [INFO ] Deduced a trap composed of 44 places in 1009 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:01] [INFO ] Deduced a trap composed of 44 places in 1218 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:02] [INFO ] Deduced a trap composed of 44 places in 1157 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:03] [INFO ] Deduced a trap composed of 44 places in 1161 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:05] [INFO ] Deduced a trap composed of 44 places in 1222 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:06] [INFO ] Deduced a trap composed of 44 places in 1181 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:07] [INFO ] Deduced a trap composed of 48 places in 982 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:08] [INFO ] Deduced a trap composed of 103 places in 1001 ms of which 85 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:09] [INFO ] Deduced a trap composed of 44 places in 1203 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:10] [INFO ] Deduced a trap composed of 44 places in 1141 ms of which 85 ms to minimize.
SMT process timed out in 117723ms, 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 4 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 3170/3170 transitions.
Applied a total of 0 rules in 104 ms. Remains 947 /947 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 947/947 places, 3170/3170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 3170/3170 transitions.
Applied a total of 0 rules in 100 ms. Remains 947 /947 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
[2025-06-03 04:10:11] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
[2025-06-03 04:10:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:10:12] [INFO ] Implicit Places using invariants in 1752 ms returned []
[2025-06-03 04:10:12] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
[2025-06-03 04:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:10:14] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2025-06-03 04:10:44] [INFO ] Performed 457/947 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:11:14] [INFO ] Performed 795/947 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 04:11:28] [INFO ] Implicit Places using invariants and state equation in 75525 ms returned []
Implicit Place search using SMT with State Equation took 77282 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:11:28] [INFO ] Redundant transitions in 346 ms returned []
Running 3108 sub problems to find dead transitions.
[2025-06-03 04:11:28] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
[2025-06-03 04:11:28] [INFO ] Invariant cache hit.
[2025-06-03 04:11:28] [INFO ] State equation strengthened by 1634 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3108 unsolved
SMT process timed out in 34624ms, After SMT, problems are : Problem set: 0 solved, 3108 unsolved
Search for dead transitions found 0 dead transitions in 34656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112430 ms. Remains : 947/947 places, 3170/3170 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1043 edges and 947 vertex of which 17 / 947 are part of one of the 1 SCC in 7 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 3688 edges and 931 vertex of which 918 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 901 transition count 2402
Reduce places removed 97 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 804 transition count 2209
Reduce places removed 96 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 708 transition count 2041
Reduce places removed 72 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 636 transition count 1899
Reduce places removed 70 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 566 transition count 1779
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 516 transition count 1681
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 468 transition count 1601
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 436 transition count 1539
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 77 rules applied. Total rules applied 1506 place count 406 transition count 1492
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 9 with 48 rules applied. Total rules applied 1554 place count 389 transition count 1461
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 36 rules applied. Total rules applied 1590 place count 375 transition count 1439
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1612 place count 367 transition count 1425
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1626 place count 361 transition count 1417
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 6 rules applied. Total rules applied 1632 place count 359 transition count 1413
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1636 place count 357 transition count 1411
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 8 Pre rules applied. Total rules applied 1636 place count 357 transition count 1403
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 16 rules applied. Total rules applied 1652 place count 349 transition count 1403
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1936 place count 65 transition count 315
Iterating global reduction 15 with 284 rules applied. Total rules applied 2220 place count 65 transition count 315
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 15 with 263 rules applied. Total rules applied 2483 place count 65 transition count 52
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 2494 place count 54 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2494 place count 54 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2496 place count 53 transition count 51
Discarding 11 places :
Symmetric choice reduction at 17 with 11 rule applications. Total rules 2507 place count 42 transition count 40
Iterating global reduction 17 with 11 rules applied. Total rules applied 2518 place count 42 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 17 with 6 rules applied. Total rules applied 2524 place count 39 transition count 37
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2532 place count 39 transition count 29
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 2540 place count 31 transition count 29
Applied a total of 2540 rules in 402 ms. Remains 31 /947 variables (removed 916) and now considering 29/3170 (removed 3141) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 29 rows 31 cols
[2025-06-03 04:12:03] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 04:12:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 04:12:03] [INFO ] [Real]Absence check using 4 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-03 04:12:03] [INFO ] After 95ms 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-06-03 04:12:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 04:12:04] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-03 04:12:04] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-03 04:12:04] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 04:12:04] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 04:12:04] [INFO ] Flatten gal took : 3 ms
[2025-06-03 04:12:04] [INFO ] Flatten gal took : 2 ms
[2025-06-03 04:12:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3793969643967615219.gal : 2 ms
[2025-06-03 04:12:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16192048937091145369.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3793969643967615219.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16192048937091145369.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/ReachabilityCardinality16192048937091145369.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :18 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :171 after 411
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,586,0.018424,4604,2,365,9,1397,8,0,141,951,0
Total reachable state count : 586
Verifying 2 reachability properties.
Reachability property MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-04 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-04,17,0.019121,4604,2,91,9,1397,8,0,144,951,0
Reachability property MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-15 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2025-15,2,0.019392,4604,2,33,9,1397,8,0,146,951,0
Over-approximation ignoring read arcs solved 0 properties in 659 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 04:12:04] [INFO ] Flatten gal took : 256 ms
[2025-06-03 04:12:04] [INFO ] Applying decomposition
[2025-06-03 04:12:05] [INFO ] Flatten gal took : 228 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/graph12143003895644906519.txt' '-o' '/tmp/graph12143003895644906519.bin' '-w' '/tmp/graph12143003895644906519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12143003895644906519.bin' '-l' '-1' '-v' '-w' '/tmp/graph12143003895644906519.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:12:05] [INFO ] Decomposing Gal with order
[2025-06-03 04:12:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:12:07] [INFO ] Removed a total of 3572 redundant transitions.
[2025-06-03 04:12:07] [INFO ] Flatten gal took : 1169 ms
[2025-06-03 04:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 537 labels/synchronizations in 196 ms.
[2025-06-03 04:12:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2948898013420262949.gal : 77 ms
[2025-06-03 04:12:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13357739429236786401.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2948898013420262949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13357739429236786401.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13357739429236786401.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1 after 144
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :144 after 163
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :163 after 194
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :194 after 509
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :509 after 564
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :564 after 616
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :616 after 1138
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :1138 after 1162
SDD proceeding with computation,2 properties remain. new max is 2097152
SDD size :1162 after 1254
SDD proceeding with computation,2 properties remain. new max is 4194304
SDD size :1254 after 2342
SDD proceeding with computation,2 properties remain. new max is 8388608
SDD size :2342 after 2459
Detected timeout of ITS tools.
[2025-06-03 04:42:13] [INFO ] Flatten gal took : 1997 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4395569608390866829
[2025-06-03 04:42:14] [INFO ] Too many transitions (3170) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:42:14] [INFO ] Applying decomposition
[2025-06-03 04:42:15] [INFO ] Built C files in 1456ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4395569608390866829
Running compilation step : cd /tmp/ltsmin4395569608390866829;'/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-06-03 04:42:16] [INFO ] Flatten gal took : 1510 ms
Compilation finished in 21481 ms.
Running link step : cd /tmp/ltsmin4395569608390866829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin4395569608390866829;'/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' 'MultiCrashLeafsetExtensionPTS16C04ReachabilityFireability202504==true'
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/graph171236863311404032.txt' '-o' '/tmp/graph171236863311404032.bin' '-w' '/tmp/graph171236863311404032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph171236863311404032.bin' '-l' '-1' '-v' '-w' '/tmp/graph171236863311404032.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:42:39] [INFO ] Decomposing Gal with order
[2025-06-03 04:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:42:42] [INFO ] Removed a total of 4974 redundant transitions.
[2025-06-03 04:42:42] [INFO ] Flatten gal took : 2210 ms
[2025-06-03 04:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2596 labels/synchronizations in 956 ms.
[2025-06-03 04:42:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6139411883820518565.gal : 70 ms
[2025-06-03 04:42:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5807126163873903015.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6139411883820518565.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5807126163873903015.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability5807126163873903015.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 77
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :77 after 92
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :92 after 93
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :93 after 93
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :93 after 93
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :93 after 93
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :93 after 620
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :620 after 2036
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2036 after 27183
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4395569608390866829;'/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' 'MultiCrashLeafsetExtensionPTS16C04ReachabilityFireability202504==true'
Running LTSmin : cd /tmp/ltsmin4395569608390866829;'/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' 'MultiCrashLeafsetExtensionPTS16C04ReachabilityFireability202515==true'
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="ReachabilityFireability"
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 MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524300303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;