Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748844855996

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 06:14:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 06:14:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:14:17] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2025-06-02 06:14:17] [INFO ] Transformed 553 places.
[2025-06-02 06:14:17] [INFO ] Transformed 1960 transitions.
[2025-06-02 06:14:17] [INFO ] Found NUPN structural information;
[2025-06-02 06:14:17] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1803 ms. (22 steps per ms) remains 9/13 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 8/9 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 06:14:18] [INFO ] Flatten gal took : 330 ms
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 7/8 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 06:14:18] [INFO ] Flatten gal took : 270 ms
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
[2025-06-02 06:14:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8271273234774150482.gal : 89 ms
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
[2025-06-02 06:14:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3337333412736173327.prop : 5 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/ReachabilityCardinality8271273234774150482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3337333412736173327.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
[2025-06-02 06:14:18] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2025-06-02 06:14:18] [INFO ] Computed 22 invariants in 23 ms
[2025-06-02 06:14:18] [INFO ] State equation strengthened by 472 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality3337333412736173327.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-11 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 423/539 variables, 14/130 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11 after 13
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :13 after 19
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :19 after 21
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 423/553 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 1/554 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :21 after 90
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :90 after 198
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/554 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/546 variables, 6/560 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 7/567 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :198 after 866
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/567 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :866 after 1663
At refinement iteration 9 (OVERLAPS) 1001/1547 variables, 546/1113 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 472/1585 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1663 after 6052
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/1585 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/1554 variables, 7/1592 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1554 variables, 7/1599 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1554 variables, 1/1600 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 1600 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2816 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 553/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 446/537 variables, 14/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 446/551 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 1/552 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :6052 after 32347
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/546 variables, 7/559 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 9/568 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:23] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:23] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:23] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:23] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:23] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:23] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:24] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:24] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:24] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:24] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:24] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:24] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 6 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-09 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 17/585 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/586 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/586 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1001/1547 variables, 546/1132 constraints. Problems are: Problem set: 2 solved, 5 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :32347 after 97921
At refinement iteration 12 (INCLUDED_ONLY) 0/1547 variables, 472/1604 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1547/1554 variables, and 1605 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 546/553 constraints, Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 546/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7949ms problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 553 transition count 1956
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 549 transition count 1955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 548 transition count 1955
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 10 place count 548 transition count 1850
Deduced a syphon composed of 105 places in 3 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 220 place count 443 transition count 1850
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 257 place count 406 transition count 1591
Iterating global reduction 3 with 37 rules applied. Total rules applied 294 place count 406 transition count 1591
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 352 place count 377 transition count 1562
Applied a total of 352 rules in 268 ms. Remains 377 /553 variables (removed 176) and now considering 1562/1960 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 377/553 places, 1562/1960 transitions.
RANDOM walk for 40000 steps (8 resets) in 577 ms. (69 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 350872 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :3 out of 5
Probabilistic random walk after 350872 steps, saw 204608 distinct states, run finished after 3008 ms. (steps per millisecond=116 ) properties seen :3
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 06:14:30] [INFO ] Flow matrix only has 603 transitions (discarded 959 similar events)
// Phase 1: matrix 603 rows 377 cols
[2025-06-02 06:14:30] [INFO ] Computed 22 invariants in 7 ms
[2025-06-02 06:14:30] [INFO ] State equation strengthened by 250 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 318/360 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/370 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 603/973 variables, 370/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 250/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/980 variables, 7/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/980 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/980 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/980 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 649 constraints, problems are : Problem set: 0 solved, 2 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 377/377 constraints, ReadFeed: 250/250 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 318/360 variables, 14/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-02 06:14:31] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/370 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 8/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-02 06:14:32] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:32] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:32] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 603/973 variables, 370/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 250/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/973 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/980 variables, 7/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/980 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/980 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/980 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2153 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 377/377 constraints, ReadFeed: 250/250 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2670ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 346 ms.
Support contains 42 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 1562/1562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 377 transition count 1561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 376 transition count 1561
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 2 place count 376 transition count 1537
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 50 place count 352 transition count 1537
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 349 transition count 1516
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 349 transition count 1516
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 72 place count 341 transition count 1508
Applied a total of 72 rules in 105 ms. Remains 341 /377 variables (removed 36) and now considering 1508/1562 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 341/377 places, 1508/1562 transitions.
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :97921 after 151556
Interrupted probabilistic random walk after 416200 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 416200 steps, saw 206061 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2025-06-02 06:14:36] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
// Phase 1: matrix 549 rows 341 cols
[2025-06-02 06:14:36] [INFO ] Computed 22 invariants in 3 ms
[2025-06-02 06:14:36] [INFO ] State equation strengthened by 232 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/334 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/883 variables, 334/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 232/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/890 variables, 7/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/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-02 06:14:37] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/334 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:37] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 549/883 variables, 334/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 232/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:38] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 4/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/890 variables, 7/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/890 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/890 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/890 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/890 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 608 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2588ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 254 ms.
Support contains 42 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 41 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 341/341 places, 1508/1508 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 44 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
[2025-06-02 06:14:39] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2025-06-02 06:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:14:40] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-06-02 06:14:40] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2025-06-02 06:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:14:40] [INFO ] State equation strengthened by 232 read => feed constraints.
[2025-06-02 06:14:41] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:14:41] [INFO ] Redundant transitions in 97 ms returned []
Running 1501 sub problems to find dead transitions.
[2025-06-02 06:14:41] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2025-06-02 06:14:41] [INFO ] Invariant cache hit.
[2025-06-02 06:14:41] [INFO ] State equation strengthened by 232 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:50] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:51] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:51] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:51] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:52] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:52] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:52] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:52] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 65536
[2025-06-02 06:14:52] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 18 ms to minimize.
SDD size :151556 after 1.1069e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:53] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:53] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:53] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:53] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:54] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:54] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:54] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:54] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:54] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:56] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:56] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:56] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:57] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:57] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:57] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:58] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:58] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:59] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:59] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:59] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:00] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:00] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:00] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:01] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:01] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:01] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:02] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:02] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:03] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 17 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/890 variables, and 62 constraints, problems are : Problem set: 0 solved, 1501 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/341 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1501/1501 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:14] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:17] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:18] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:18] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:18] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:18] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:19] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:19] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:19] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:19] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:19] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:20] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:20] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:20] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:21] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:21] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:21] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:21] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:22] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:22] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:24] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:25] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:25] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:25] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:25] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:25] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:26] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:26] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:27] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:29] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:29] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:30] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:33] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:34] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:35] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 25 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :1.1069e+06 after 2.49336e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:36] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:37] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:37] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:37] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:37] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:40] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:40] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:41] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/890 variables, and 105 constraints, problems are : Problem set: 0 solved, 1501 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/341 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1501 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 1501 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62299 ms. Remains : 341/341 places, 1508/1508 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1230 edges and 341 vertex of which 42 / 341 are part of one of the 7 SCC in 3 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 125 transitions
Ensure Unique test removed 946 transitions
Reduce isomorphic transitions removed 1071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 306 transition count 385
Reduce places removed 52 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 254 transition count 378
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 247 transition count 378
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 119 place count 247 transition count 370
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 136 place count 238 transition count 370
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 270 place count 171 transition count 303
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 295 place count 171 transition count 278
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 168 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 317 place count 168 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 167 transition count 275
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 356 place count 167 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 393 place count 130 transition count 238
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 398 place count 130 transition count 238
Applied a total of 398 rules in 76 ms. Remains 130 /341 variables (removed 211) and now considering 238/1508 (removed 1270) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 238 rows 130 cols
[2025-06-02 06:15:42] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 06:15:42] [INFO ] After 79ms 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-02 06:15:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:15:42] [INFO ] [Nat]Absence check using 15 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 06:15:42] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-02 06:15:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:15:42] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 06:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-02 06:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2025-06-02 06:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 2
[2025-06-02 06:15:42] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 06:15:42] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 06:15:42] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:15:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:15:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15146996414591689492.gal : 2 ms
[2025-06-02 06:15:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6272545218399760074.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/ReachabilityCardinality15146996414591689492.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6272545218399760074.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/ReachabilityCardinality6272545218399760074.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 2100
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2100 after 13370
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :13370 after 15330
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :15330 after 45360
Reachability property EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :45360 after 1.76766e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.76766e+06 after 1.80855e+06
Reachability property EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
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,6.58748e+08,1.41667,7892,2,1670,17,19692,6,0,761,11546,0
Total reachable state count : 658748160

Verifying 2 reachability properties.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 15697 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 06:15:57] [INFO ] Flatten gal took : 71 ms
[2025-06-02 06:15:57] [INFO ] Applying decomposition
[2025-06-02 06:15:57] [INFO ] Flatten gal took : 60 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/graph485106565843964792.txt' '-o' '/tmp/graph485106565843964792.bin' '-w' '/tmp/graph485106565843964792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph485106565843964792.bin' '-l' '-1' '-v' '-w' '/tmp/graph485106565843964792.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:15:58] [INFO ] Decomposing Gal with order
[2025-06-02 06:15:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:15:58] [INFO ] Removed a total of 3646 redundant transitions.
[2025-06-02 06:15:58] [INFO ] Flatten gal took : 322 ms
[2025-06-02 06:15:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 97 ms.
[2025-06-02 06:15:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11091616084652107799.gal : 22 ms
[2025-06-02 06:15:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10113501645219668177.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11091616084652107799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10113501645219668177.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10113501645219668177.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 3
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3 after 14
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :14 after 49
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :49 after 502
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :502 after 89796
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :89796 after 661678
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :661678 after 961644
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :961644 after 5.69088e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.69088e+06 after 2.84063e+07
Reachability property EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06 is true.
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.84063e+07 after 4.59272e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.59272e+07 after 4.59272e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.59272e+07 after 7.4513e+07
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :7.4513e+07 after 5.01968e+08
Detected timeout of ITS tools.
[2025-06-02 06:46:01] [INFO ] Flatten gal took : 417 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12077031323943551679
[2025-06-02 06:46:01] [INFO ] Too many transitions (1508) to apply POR reductions. Disabling POR matrices.
[2025-06-02 06:46:01] [INFO ] Applying decomposition
[2025-06-02 06:46:02] [INFO ] Flatten gal took : 349 ms
[2025-06-02 06:46:02] [INFO ] Built C files in 484ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12077031323943551679
Running compilation step : cd /tmp/ltsmin12077031323943551679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph879034024364858989.txt' '-o' '/tmp/graph879034024364858989.bin' '-w' '/tmp/graph879034024364858989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph879034024364858989.bin' '-l' '-1' '-v' '-w' '/tmp/graph879034024364858989.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:46:03] [INFO ] Decomposing Gal with order
[2025-06-02 06:46:03] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 3007 ms.
Running link step : cd /tmp/ltsmin12077031323943551679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2025-06-02 06:46:05] [INFO ] Removed a total of 2862 redundant transitions.
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12077031323943551679;'/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' 'EisenbergMcGuirePT07ReachabilityCardinality202313==true'
[2025-06-02 06:46:05] [INFO ] Flatten gal took : 1108 ms
[2025-06-02 06:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 510 ms.
[2025-06-02 06:46:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9958045355940400266.gal : 123 ms
[2025-06-02 06:46:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17303308356007073285.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9958045355940400266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17303308356007073285.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/ReachabilityCardinality17303308356007073285.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 96
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :96 after 897
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :897 after 3257
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3257 after 9370
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9370 after 30173
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30173 after 90357
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :90357 after 687884
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :687884 after 9.8986e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.8986e+06 after 4.36882e+07

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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