Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r126-tall-174876436400294.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 gold2024
Input is JoinFreeModules-PT-1000, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tall-174876436400294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748787051135

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=JoinFreeModules-PT-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 14:10:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 14:10:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 14:10:52] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2025-06-01 14:10:52] [INFO ] Transformed 5001 places.
[2025-06-01 14:10:52] [INFO ] Transformed 8001 transitions.
[2025-06-01 14:10:52] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 436 ms.
Discarding 4000 transitions out of 8001. Remains 4001
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 13 ms.48553KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 816 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
Running 6000 sub problems to find dead transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2025-06-01 14:10:54] [INFO ] Computed 1000 invariants in 56 ms
[2025-06-01 14:10:54] [INFO ] State equation strengthened by 1000 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20163 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 45478ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 45615ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 46515 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 655 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2025-06-01 14:11:40] [INFO ] Invariant cache hit.
[2025-06-01 14:11:41] [INFO ] Implicit Places using invariants in 796 ms returned []
[2025-06-01 14:11:41] [INFO ] Invariant cache hit.
[2025-06-01 14:11:44] [INFO ] State equation strengthened by 1000 read => feed constraints.
[2025-06-01 14:11:44] [INFO ] Implicit Places using invariants and state equation in 3553 ms returned []
Implicit Place search using SMT with State Equation took 4356 ms to find 0 implicit places.
[2025-06-01 14:11:45] [INFO ] Redundant transitions in 1030 ms returned []
Running 6000 sub problems to find dead transitions.
[2025-06-01 14:11:45] [INFO ] Invariant cache hit.
[2025-06-01 14:11:45] [INFO ] State equation strengthened by 1000 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 64862ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 64927ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 70995 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Interrupted Random walk after 656760 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=21 )
Interrupted Random directed walk after 196841 steps, including 0 resets, run timeout after 30327 ms. (steps per millisecond=6 )
[2025-06-01 14:13:51] [INFO ] Invariant cache hit.
[2025-06-01 14:13:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 4 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 5001/5001 places, 8001/8001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5000 transition count 8001
Applied a total of 1 rules in 62 ms. Remains 5000 /5001 variables (removed 1) and now considering 8001/8001 (removed 0) transitions.
Running 6000 sub problems to find dead transitions.
[2025-06-01 14:13:52] [INFO ] Invariant cache hit.
[2025-06-01 14:13:52] [INFO ] State equation strengthened by 1000 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 44255ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 44302ms
[2025-06-01 14:14:37] [INFO ] Invariant cache hit.
[2025-06-01 14:14:38] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2025-06-01 14:14:38] [INFO ] Invariant cache hit.
[2025-06-01 14:14:41] [INFO ] State equation strengthened by 1000 read => feed constraints.
[2025-06-01 14:14:41] [INFO ] Implicit Places using invariants and state equation in 3725 ms returned []
Implicit Place search using SMT with State Equation took 4776 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2025-06-01 14:14:42] [INFO ] Invariant cache hit.
[2025-06-01 14:14:42] [INFO ] State equation strengthened by 1000 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 64333ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 64392ms
Starting structural reductions in LIVENESS mode, iteration 1 : 5000/5001 places, 8001/8001 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 113554 ms. Remains : 5000/5001 places, 8001/8001 transitions.
Discarding 4000 transitions out of 8001. Remains 4001
Initial state reduction rules removed 1 formulas.
RANDOM walk for 41062 steps (8 resets) in 2517 ms. (16 steps per ms) remains 3924/4000 properties
BEST_FIRST walk for 124 steps (0 resets) in 28 ms. (4 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 25 ms. (4 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 21 ms. (5 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3924/3924 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3924/3924 properties
Probabilistic random walk after 10005 steps, saw 10002 distinct states, run finished after 3123 ms. (steps per millisecond=3 ) properties seen :974
[2025-06-01 14:15:50] [INFO ] Invariant cache hit.
[2025-06-01 14:15:50] [INFO ] State equation strengthened by 1000 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2950/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2950 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 2950/2950 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2950/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2950 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/2950 constraints, Known Traps: 0/0 constraints]
After SMT, in 12221ms problems are : Problem set: 0 solved, 2950 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2950 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5000 transition count 8000
Applied a total of 1 rules in 297 ms. Remains 5000 /5000 variables (removed 0) and now considering 8000/8001 (removed 1) transitions.
Running 6000 sub problems to find dead transitions.
// Phase 1: matrix 8000 rows 5000 cols
[2025-06-01 14:16:03] [INFO ] Computed 1000 invariants in 27 ms
[2025-06-01 14:16:03] [INFO ] State equation strengthened by 1000 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13000 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13000 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 44345ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 44395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44705 ms. Remains : 5000/5000 places, 8000/8001 transitions.
RANDOM walk for 2519853 steps (4 resets) in 120038 ms. (20 steps per ms) remains 871/2950 properties
BEST_FIRST walk for 4004 steps (0 resets) in 217 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 228 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 214 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 214 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 258 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 213 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 213 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 209 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 209 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 209 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 255 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 268 ms. (14 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 234 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 208 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 258 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 259 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 266 ms. (14 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 270 ms. (14 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 230 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 216 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 209 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 214 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 208 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 214 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 234 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 212 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 208 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 219 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 212 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 222 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 209 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 209 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 213 ms. (18 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 208 ms. (19 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 237 ms. (16 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (0 resets) in 224 ms. (17 steps per ms) remains 871/871 properties
[2025-06-01 14:17:20] [INFO ] Invariant cache hit.
[2025-06-01 14:17:20] [INFO ] State equation strengthened by 1000 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 1 (OVERLAPS) 2074/2945 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:17:43] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 29 ms to minimize.
[2025-06-01 14:17:43] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 7 ms to minimize.
[2025-06-01 14:17:44] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 19 ms to minimize.
[2025-06-01 14:17:44] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 4 ms to minimize.
[2025-06-01 14:17:44] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 3 ms to minimize.
[2025-06-01 14:17:45] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 10 ms to minimize.
[2025-06-01 14:17:45] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 10 ms to minimize.
[2025-06-01 14:17:46] [INFO ] Deduced a trap composed of 3 places in 410 ms of which 3 ms to minimize.
[2025-06-01 14:17:46] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2025-06-01 14:17:46] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 3 ms to minimize.
[2025-06-01 14:17:47] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 4 ms to minimize.
[2025-06-01 14:17:47] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2025-06-01 14:17:47] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 3 ms to minimize.
[2025-06-01 14:17:47] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 3 ms to minimize.
[2025-06-01 14:17:48] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 3 ms to minimize.
[2025-06-01 14:17:48] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2025-06-01 14:17:48] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 3 ms to minimize.
[2025-06-01 14:17:48] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
[2025-06-01 14:17:49] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 3 ms to minimize.
[2025-06-01 14:17:49] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2945 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:17:49] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2025-06-01 14:17:50] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 7 ms to minimize.
[2025-06-01 14:17:50] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2025-06-01 14:17:50] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2025-06-01 14:17:51] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 3 ms to minimize.
[2025-06-01 14:17:51] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2025-06-01 14:17:51] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 3 ms to minimize.
[2025-06-01 14:17:51] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 3 ms to minimize.
[2025-06-01 14:17:51] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
[2025-06-01 14:17:52] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2025-06-01 14:17:52] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
[2025-06-01 14:17:52] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 2 ms to minimize.
[2025-06-01 14:17:52] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2025-06-01 14:17:53] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2025-06-01 14:17:53] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 4 ms to minimize.
[2025-06-01 14:17:53] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 3 ms to minimize.
[2025-06-01 14:17:53] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 2 ms to minimize.
[2025-06-01 14:17:54] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
[2025-06-01 14:17:54] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2025-06-01 14:17:54] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/2945 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 871 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2945/13000 variables, and 629 constraints, problems are : Problem set: 0 solved, 871 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 589/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 871/871 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 871 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 1 (OVERLAPS) 2074/2945 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2945 variables, 40/629 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:19] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 2 ms to minimize.
[2025-06-01 14:18:19] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 3 ms to minimize.
[2025-06-01 14:18:19] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2025-06-01 14:18:19] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 3 ms to minimize.
[2025-06-01 14:18:20] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 2 ms to minimize.
[2025-06-01 14:18:20] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2025-06-01 14:18:20] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 3 ms to minimize.
[2025-06-01 14:18:20] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2025-06-01 14:18:21] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-06-01 14:18:21] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 3 ms to minimize.
[2025-06-01 14:18:21] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2025-06-01 14:18:21] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2025-06-01 14:18:22] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 2 ms to minimize.
[2025-06-01 14:18:22] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-06-01 14:18:22] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 3 ms to minimize.
[2025-06-01 14:18:22] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2025-06-01 14:18:22] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 14 ms to minimize.
[2025-06-01 14:18:23] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2025-06-01 14:18:23] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2025-06-01 14:18:23] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2945 variables, 20/649 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:24] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2025-06-01 14:18:24] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2025-06-01 14:18:24] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2025-06-01 14:18:24] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 5 ms to minimize.
[2025-06-01 14:18:25] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-06-01 14:18:25] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2025-06-01 14:18:25] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 3 ms to minimize.
[2025-06-01 14:18:25] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
[2025-06-01 14:18:25] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2025-06-01 14:18:26] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2025-06-01 14:18:26] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2025-06-01 14:18:26] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2025-06-01 14:18:26] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2025-06-01 14:18:26] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 5 ms to minimize.
[2025-06-01 14:18:27] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2025-06-01 14:18:27] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-06-01 14:18:27] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2025-06-01 14:18:27] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2025-06-01 14:18:27] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
[2025-06-01 14:18:28] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2945 variables, 20/669 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:28] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2025-06-01 14:18:28] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 14:18:28] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2025-06-01 14:18:29] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2025-06-01 14:18:29] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 14:18:29] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2025-06-01 14:18:29] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2025-06-01 14:18:29] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 14:18:29] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 14:18:30] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 14:18:30] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 14:18:30] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 14:18:30] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2025-06-01 14:18:30] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 14:18:30] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2025-06-01 14:18:31] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2025-06-01 14:18:31] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2025-06-01 14:18:31] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2025-06-01 14:18:31] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2025-06-01 14:18:31] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2945 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:32] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2025-06-01 14:18:32] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2025-06-01 14:18:32] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 14:18:32] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2025-06-01 14:18:33] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2025-06-01 14:18:33] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2025-06-01 14:18:33] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2025-06-01 14:18:33] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2025-06-01 14:18:33] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2025-06-01 14:18:33] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 14:18:33] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2025-06-01 14:18:34] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2025-06-01 14:18:34] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2025-06-01 14:18:34] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 14:18:34] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2025-06-01 14:18:34] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2025-06-01 14:18:34] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2025-06-01 14:18:34] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2025-06-01 14:18:35] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2025-06-01 14:18:35] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2945 variables, 20/709 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:35] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 14:18:35] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 5 ms to minimize.
[2025-06-01 14:18:35] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 5 ms to minimize.
[2025-06-01 14:18:36] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 14:18:36] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2025-06-01 14:18:36] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2025-06-01 14:18:36] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2025-06-01 14:18:36] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2025-06-01 14:18:36] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2025-06-01 14:18:36] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 14:18:37] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2025-06-01 14:18:38] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 14:18:38] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2945 variables, 20/729 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:38] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 14:18:38] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2025-06-01 14:18:38] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 3 ms to minimize.
[2025-06-01 14:18:39] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 14:18:39] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 14:18:39] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2025-06-01 14:18:39] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 14:18:39] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2025-06-01 14:18:39] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 14:18:39] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2025-06-01 14:18:40] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2025-06-01 14:18:41] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2025-06-01 14:18:41] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2945 variables, 20/749 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:41] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 14:18:41] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2025-06-01 14:18:42] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2025-06-01 14:18:43] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2945 variables, 20/769 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2025-06-01 14:18:44] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 14:18:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2025-06-01 14:18:45] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2945/13000 variables, and 778 constraints, problems are : Problem set: 0 solved, 871 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 589/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/871 constraints, Known Traps: 189/189 constraints]
After SMT, in 90798ms problems are : Problem set: 0 solved, 871 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 871 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8000/8000 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 2945 are kept as prefixes of interest. Removing 2055 places using SCC suffix rule.8 ms
Discarding 2055 places :
Also discarding 3288 output transitions
Drop transitions (Output transitions of discarded places.) removed 3288 transitions
Applied a total of 1 rules in 285 ms. Remains 2945 /5000 variables (removed 2055) and now considering 4712/8000 (removed 3288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 2945/5000 places, 4712/8000 transitions.
RANDOM walk for 3214432 steps (8 resets) in 118715 ms. (27 steps per ms) remains 82/871 properties
BEST_FIRST walk for 400004 steps (8 resets) in 15417 ms. (25 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12375 ms. (32 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12351 ms. (32 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12378 ms. (32 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12358 ms. (32 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12374 ms. (32 steps per ms) remains 80/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12461 ms. (32 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12352 ms. (32 steps per ms) remains 78/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12397 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12383 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12391 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12457 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12402 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12367 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12370 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12327 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12348 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12327 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12319 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12330 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12330 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12245 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12237 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12254 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12329 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12352 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12350 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12462 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12356 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12410 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12449 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12574 ms. (31 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12511 ms. (31 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 13976 ms. (28 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 13711 ms. (29 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12347 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12350 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12333 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12394 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12384 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12452 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12393 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12328 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12351 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 16815 ms. (23 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 16078 ms. (24 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12333 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12315 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12314 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12386 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12304 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12376 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12316 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12347 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12311 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12315 ms. (32 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 12257 ms. (32 steps per ms) remains 78/78 properties
// Phase 1: matrix 4712 rows 2945 cols
[2025-06-01 14:22:26] [INFO ] Computed 589 invariants in 13 ms
[2025-06-01 14:22:26] [INFO ] State equation strengthened by 589 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 307/385 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2025-06-01 14:22:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 14:22:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 616/1001 variables, 385/493 constraints. Problems are: Problem set: 0 solved, 78 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 77/570 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/1001 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1001/7657 variables, and 570 constraints, problems are : Problem set: 0 solved, 78 unsolved in 8390 ms.
Refiners :[Positive P Invariants (semi-flows): 77/589 constraints, State Equation: 385/2945 constraints, ReadFeed: 77/589 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 307/385 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 31/108 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 14:22:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 14:22:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 616/1001 variables, 385/510 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 77/587 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 78/665 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2025-06-01 14:22:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1001 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2025-06-01 14:22:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1001 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/1001 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1001/7657 variables, and 667 constraints, problems are : Problem set: 0 solved, 78 unsolved in 25439 ms.
Refiners :[Positive P Invariants (semi-flows): 77/589 constraints, State Equation: 385/2945 constraints, ReadFeed: 77/589 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 50/50 constraints]
After SMT, in 33901ms problems are : Problem set: 0 solved, 78 unsolved
Fused 78 Parikh solutions to 12 different solutions.
Finished Parikh walk after 8750 steps, including 0 resets, run visited all 78 properties in 436 ms. (steps per millisecond=20 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 78 properties in 458 ms.
Able to resolve query QuasiLiveness after proving 4001 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 5001/5001 places, 8001/8001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5000 transition count 8001
Applied a total of 1 rules in 38 ms. Remains 5000 /5001 variables (removed 1) and now considering 8001/8001 (removed 0) transitions.
Running 6000 sub problems to find dead transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2025-06-01 14:23:01] [INFO ] Computed 1000 invariants in 18 ms
[2025-06-01 14:23:01] [INFO ] State equation strengthened by 1000 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 44514ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 44565ms
[2025-06-01 14:23:45] [INFO ] Invariant cache hit.
[2025-06-01 14:23:46] [INFO ] Implicit Places using invariants in 879 ms returned []
[2025-06-01 14:23:46] [INFO ] Invariant cache hit.
[2025-06-01 14:23:50] [INFO ] State equation strengthened by 1000 read => feed constraints.
[2025-06-01 14:23:50] [INFO ] Implicit Places using invariants and state equation in 3888 ms returned []
Implicit Place search using SMT with State Equation took 4769 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2025-06-01 14:23:50] [INFO ] Invariant cache hit.
[2025-06-01 14:23:50] [INFO ] State equation strengthened by 1000 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 64708ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 64763ms
Starting structural reductions in LIVENESS mode, iteration 1 : 5000/5001 places, 8001/8001 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 114159 ms. Remains : 5000/5001 places, 8001/8001 transitions.
Discarding 4000 transitions out of 8001. Remains 4001
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :4001 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 4001 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 843178 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-1000

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 5001
TRANSITIONS: 8001
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.124s, Sys 0.035s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.023s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1354
MODEL NAME: /home/mcc/execution/model
5001 places, 8001 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2024"
echo " Input is JoinFreeModules-PT-1000, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tall-174876436400294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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