About the Execution of 2024-gold for JoinFreeModules-PT-1000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15684.500 | 426134.00 | 958289.00 | 651.80 | T | normal |
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-174876436400292.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 QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tall-174876436400292
=====================================================================
--------------------
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 QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748787029257
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
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:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 14:10:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 14:10:30] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2025-06-01 14:10:30] [INFO ] Transformed 5001 places.
[2025-06-01 14:10:30] [INFO ] Transformed 8001 transitions.
[2025-06-01 14:10:30] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 399 ms.
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 156 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:10:31] [INFO ] Computed 1000 invariants in 60 ms
[2025-06-01 14:10:31] [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 20167 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 20066 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 44720ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 44804ms
[2025-06-01 14:11:15] [INFO ] Invariant cache hit.
[2025-06-01 14:11:16] [INFO ] Implicit Places using invariants in 989 ms returned []
[2025-06-01 14:11:16] [INFO ] Invariant cache hit.
[2025-06-01 14:11:20] [INFO ] State equation strengthened by 1000 read => feed constraints.
[2025-06-01 14:11:20] [INFO ] Implicit Places using invariants and state equation in 3575 ms returned []
Implicit Place search using SMT with State Equation took 4571 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2025-06-01 14:11:20] [INFO ] Invariant cache hit.
[2025-06-01 14:11:20] [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 30075 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 30068 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 64374ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 64419ms
Starting structural reductions in LIVENESS mode, iteration 1 : 5000/5001 places, 8001/8001 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 114041 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 40061 steps (8 resets) in 2304 ms. (17 steps per ms) remains 3925/4000 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 21 ms. (5 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 22 ms. (5 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 20 ms. (5 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 3925/3925 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3925/3925 properties
Probabilistic random walk after 14010 steps, saw 14003 distinct states, run finished after 3204 ms. (steps per millisecond=4 ) properties seen :974
[2025-06-01 14:12:29] [INFO ] Invariant cache hit.
[2025-06-01 14:12:29] [INFO ] State equation strengthened by 1000 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2951/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2951 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 2951/2951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2951/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2951 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/2951 constraints, Known Traps: 0/0 constraints]
After SMT, in 12098ms problems are : Problem set: 0 solved, 2951 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2951 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 4995 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.17 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 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 2 place count 4995 transition count 7992
Applied a total of 2 rules in 369 ms. Remains 4995 /5000 variables (removed 5) and now considering 7992/8001 (removed 9) transitions.
Running 5994 sub problems to find dead transitions.
// Phase 1: matrix 7992 rows 4995 cols
[2025-06-01 14:12:41] [INFO ] Computed 999 invariants in 32 ms
[2025-06-01 14:12:41] [INFO ] State equation strengthened by 999 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3996/12987 variables, and 0 constraints, problems are : Problem set: 0 solved, 5994 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/999 constraints, State Equation: 0/4995 constraints, ReadFeed: 0/999 constraints, PredecessorRefiner: 5994/5994 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5994 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 3996/12987 variables, and 0 constraints, problems are : Problem set: 0 solved, 5994 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/999 constraints, State Equation: 0/4995 constraints, ReadFeed: 0/999 constraints, PredecessorRefiner: 0/5994 constraints, Known Traps: 0/0 constraints]
After SMT, in 44174ms problems are : Problem set: 0 solved, 5994 unsolved
Search for dead transitions found 0 dead transitions in 44217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44596 ms. Remains : 4995/5000 places, 7992/8001 transitions.
RANDOM walk for 2858765 steps (8 resets) in 120112 ms. (23 steps per ms) remains 828/2951 properties
BEST_FIRST walk for 4004 steps (0 resets) in 197 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 192 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 195 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 190 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 210 ms. (18 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 187 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 185 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 187 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 186 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 230 ms. (17 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 226 ms. (17 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 244 ms. (16 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 243 ms. (16 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 241 ms. (16 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 231 ms. (17 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 197 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 186 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 186 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 208 ms. (19 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 187 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 183 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 187 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 192 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 192 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 190 ms. (20 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 185 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 214 ms. (18 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 219 ms. (18 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 187 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 184 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 189 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 186 ms. (21 steps per ms) remains 828/828 properties
BEST_FIRST walk for 4004 steps (0 resets) in 188 ms. (21 steps per ms) remains 828/828 properties
[2025-06-01 14:13:58] [INFO ] Invariant cache hit.
[2025-06-01 14:13:58] [INFO ] State equation strengthened by 999 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (OVERLAPS) 2052/2880 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:14:17] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 28 ms to minimize.
[2025-06-01 14:14:18] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2025-06-01 14:14:18] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 4 ms to minimize.
[2025-06-01 14:14:18] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 3 ms to minimize.
[2025-06-01 14:14:18] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
[2025-06-01 14:14:19] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
[2025-06-01 14:14:19] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-06-01 14:14:19] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2025-06-01 14:14:19] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2025-06-01 14:14:19] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2025-06-01 14:14:20] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2025-06-01 14:14:20] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2025-06-01 14:14:20] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2025-06-01 14:14:20] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 3 ms to minimize.
[2025-06-01 14:14:20] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2025-06-01 14:14:21] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2025-06-01 14:14:21] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2025-06-01 14:14:21] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2025-06-01 14:14:21] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 4 ms to minimize.
[2025-06-01 14:14:21] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2880 variables, 20/596 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:14:22] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2025-06-01 14:14:22] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 3 ms to minimize.
[2025-06-01 14:14:22] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 3 ms to minimize.
[2025-06-01 14:14:23] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 2 ms to minimize.
[2025-06-01 14:14:23] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 3 ms to minimize.
[2025-06-01 14:14:23] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 3 ms to minimize.
[2025-06-01 14:14:23] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2025-06-01 14:14:23] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2025-06-01 14:14:24] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 3 ms to minimize.
[2025-06-01 14:14:24] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
[2025-06-01 14:14:24] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2025-06-01 14:14:24] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 3 ms to minimize.
[2025-06-01 14:14:24] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 3 ms to minimize.
[2025-06-01 14:14:25] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2025-06-01 14:14:25] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 5 ms to minimize.
[2025-06-01 14:14:25] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
[2025-06-01 14:14:25] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2025-06-01 14:14:25] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2025-06-01 14:14:25] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 3 ms to minimize.
[2025-06-01 14:14:26] [INFO ] Deduced a trap composed of 3 places in 133 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/2880 variables, 20/616 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2880/12987 variables, and 616 constraints, problems are : Problem set: 0 solved, 828 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 576/999 constraints, State Equation: 0/4995 constraints, ReadFeed: 0/999 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (OVERLAPS) 2052/2880 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2880 variables, 40/616 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:14:54] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2025-06-01 14:14:55] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
[2025-06-01 14:14:55] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2025-06-01 14:14:55] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2025-06-01 14:14:55] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-06-01 14:14:55] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2025-06-01 14:14:56] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2025-06-01 14:14:56] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 3 ms to minimize.
[2025-06-01 14:14:56] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2025-06-01 14:14:56] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2025-06-01 14:14:56] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2025-06-01 14:14:57] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2025-06-01 14:14:57] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2025-06-01 14:14:57] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 3 ms to minimize.
[2025-06-01 14:14:57] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2025-06-01 14:14:57] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 3 ms to minimize.
[2025-06-01 14:14:58] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 7 ms to minimize.
[2025-06-01 14:14:58] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 3 ms to minimize.
[2025-06-01 14:14:58] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 3 ms to minimize.
[2025-06-01 14:14:58] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2880 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:14:59] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 3 ms to minimize.
[2025-06-01 14:14:59] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2025-06-01 14:14:59] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 3 ms to minimize.
[2025-06-01 14:14:59] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 3 ms to minimize.
[2025-06-01 14:14:59] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
[2025-06-01 14:14:59] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2025-06-01 14:15:00] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2025-06-01 14:15:00] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2025-06-01 14:15:00] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
[2025-06-01 14:15:00] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2025-06-01 14:15:00] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2025-06-01 14:15:01] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2025-06-01 14:15:01] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
[2025-06-01 14:15:01] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2025-06-01 14:15:01] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2025-06-01 14:15:01] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2025-06-01 14:15:01] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-06-01 14:15:02] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2025-06-01 14:15:02] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2025-06-01 14:15:02] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2880 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:15:03] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2025-06-01 14:15:03] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 3 ms to minimize.
[2025-06-01 14:15:03] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2025-06-01 14:15:03] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 3 ms to minimize.
[2025-06-01 14:15:03] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2025-06-01 14:15:03] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 14:15:04] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2025-06-01 14:15:04] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2025-06-01 14:15:04] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 3 ms to minimize.
[2025-06-01 14:15:04] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-06-01 14:15:04] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2025-06-01 14:15:04] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2025-06-01 14:15:05] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2025-06-01 14:15:05] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2025-06-01 14:15:05] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2025-06-01 14:15:05] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2025-06-01 14:15:05] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 14:15:05] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2025-06-01 14:15:05] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2025-06-01 14:15:06] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2880 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:15:06] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2025-06-01 14:15:06] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2025-06-01 14:15:06] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2025-06-01 14:15:07] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2025-06-01 14:15:07] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2025-06-01 14:15:07] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2025-06-01 14:15:07] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2025-06-01 14:15:07] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2025-06-01 14:15:07] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2025-06-01 14:15:07] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2025-06-01 14:15:08] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2025-06-01 14:15:08] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2025-06-01 14:15:08] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2025-06-01 14:15:08] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2025-06-01 14:15:08] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2025-06-01 14:15:08] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2025-06-01 14:15:08] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2025-06-01 14:15:09] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2025-06-01 14:15:09] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2025-06-01 14:15:09] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2880 variables, 20/696 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:15:09] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2025-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2025-06-01 14:15:11] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 14:15:12] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 14:15:12] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2025-06-01 14:15:12] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2880 variables, 20/716 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:15:12] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2025-06-01 14:15:12] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 4 ms to minimize.
[2025-06-01 14:15:12] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2025-06-01 14:15:13] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 14:15:14] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2880 variables, 20/736 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:15:15] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2025-06-01 14:15:15] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 14:15:15] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 14:15:15] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2025-06-01 14:15:15] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2025-06-01 14:15:15] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2025-06-01 14:15:15] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 14:15:16] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2880 variables, 20/756 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-06-01 14:15:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:15:18] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2880/12987 variables, and 771 constraints, problems are : Problem set: 0 solved, 828 unsolved in 45030 ms.
Refiners :[Positive P Invariants (semi-flows): 576/999 constraints, State Equation: 0/4995 constraints, ReadFeed: 0/999 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 195/195 constraints]
After SMT, in 90635ms problems are : Problem set: 0 solved, 828 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 828 out of 4995 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4995/4995 places, 7992/7992 transitions.
Graph (complete) has 11988 edges and 4995 vertex of which 2880 are kept as prefixes of interest. Removing 2115 places using SCC suffix rule.12 ms
Discarding 2115 places :
Also discarding 3384 output transitions
Drop transitions (Output transitions of discarded places.) removed 3384 transitions
Applied a total of 1 rules in 180 ms. Remains 2880 /4995 variables (removed 2115) and now considering 4608/7992 (removed 3384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 2880/4995 places, 4608/7992 transitions.
RANDOM walk for 4001111 steps (8 resets) in 97048 ms. (41 steps per ms) remains 38/828 properties
BEST_FIRST walk for 400004 steps (8 resets) in 11143 ms. (35 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10755 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10724 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10714 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10723 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10748 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10728 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10722 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10751 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10721 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10724 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10729 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10758 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10730 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10746 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10771 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10751 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10733 ms. (37 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10644 ms. (37 steps per ms) remains 36/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10718 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10744 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10852 ms. (36 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10738 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10736 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10762 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10806 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10742 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10735 ms. (37 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 11002 ms. (36 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10965 ms. (36 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10922 ms. (36 steps per ms) remains 34/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10994 ms. (36 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10901 ms. (36 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10763 ms. (37 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10729 ms. (37 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 10769 ms. (37 steps per ms) remains 34/34 properties
// Phase 1: matrix 4608 rows 2880 cols
[2025-06-01 14:17:31] [INFO ] Computed 576 invariants in 9 ms
[2025-06-01 14:17:31] [INFO ] State equation strengthened by 576 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 136/170 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 14:17:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 272/442 variables, 170/223 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 34/257 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/7488 variables, and 257 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 34/576 constraints, State Equation: 170/2880 constraints, ReadFeed: 34/576 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 136/170 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-06-01 14:17:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-06-01 14:17:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2025-06-01 14:17:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 14:17:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 272/442 variables, 170/227 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 34/261 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 34/295 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/7488 variables, and 295 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2300 ms.
Refiners :[Positive P Invariants (semi-flows): 34/576 constraints, State Equation: 170/2880 constraints, ReadFeed: 34/576 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 23/23 constraints]
After SMT, in 4153ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 19 different solutions.
Finished Parikh walk after 1114 steps, including 0 resets, run visited all 34 properties in 68 ms. (steps per millisecond=16 )
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 )
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 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 )
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 )
Parikh walk visited 34 properties in 96 ms.
Able to resolve query QuasiLiveness after proving 4001 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 424903 ms.
ITS solved all properties within timeout
BK_STOP 1748787455391
--------------------
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 QuasiLiveness -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="QuasiLiveness"
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 QuasiLiveness"
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-174876436400292"
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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;