About the Execution of ITS-Tools for DoubleExponent-PT-010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ????FF?F???T?FT? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067600494.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DoubleExponent-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067600494
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 169K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748737835673
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-01 00:30:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 00:30:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:30:37] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-01 00:30:37] [INFO ] Transformed 534 places.
[2025-06-01 00:30:37] [INFO ] Transformed 498 transitions.
[2025-06-01 00:30:37] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 00:30:37] [INFO ] Flatten gal took : 89 ms
RANDOM walk for 40000 steps (1309 resets) in 1529 ms. (26 steps per ms) remains 16/16 properties
[2025-06-01 00:30:37] [INFO ] Flatten gal took : 77 ms
BEST_FIRST walk for 4000 steps (115 resets) in 224 ms. (17 steps per ms) remains 16/16 properties
[2025-06-01 00:30:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2804623959006501516.gal : 26 ms
BEST_FIRST walk for 4000 steps (111 resets) in 176 ms. (22 steps per ms) remains 16/16 properties
[2025-06-01 00:30:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6352069963374446751.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2804623959006501516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6352069963374446751.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4001 steps (112 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4001 steps (110 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality6352069963374446751.prop.
BEST_FIRST walk for 4002 steps (102 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 66 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (107 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (104 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (117 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (112 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (104 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 25
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :25 after 32
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 68
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :68 after 138
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :138 after 514
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :514 after 2692
Reachability property DoubleExponent-PT-010-ReachabilityCardinality-2025-13 is true.
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property DoubleExponent-PT-010-ReachabilityCardinality-2025-07 is true.
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :2692 after 28726
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :28726 after 142892
Interrupted probabilistic random walk after 181998 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :2 out of 16
Probabilistic random walk after 181998 steps, saw 91011 distinct states, run finished after 3006 ms. (steps per millisecond=60 ) properties seen :2
// Phase 1: matrix 498 rows 534 cols
[2025-06-01 00:30:41] [INFO ] Computed 54 invariants in 82 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem DoubleExponent-PT-010-ReachabilityCardinality-2025-01 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 206/450 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem DoubleExponent-PT-010-ReachabilityCardinality-2025-00 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-010-ReachabilityCardinality-2025-12 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 84/534 variables, 47/54 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/54 constraints. Problems are: Problem set: 3 solved, 11 unsolved
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :142892 after 424838
At refinement iteration 6 (OVERLAPS) 498/1032 variables, 534/588 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1032/1032 variables, and 588 constraints, problems are : Problem set: 3 solved, 11 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 14/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem DoubleExponent-PT-010-ReachabilityCardinality-2025-03 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 260/433 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 2/5 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:46] [INFO ] Deduced a trap composed of 306 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:47] [INFO ] Deduced a trap composed of 314 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:47] [INFO ] Deduced a trap composed of 325 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:47] [INFO ] Deduced a trap composed of 326 places in 164 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 4/9 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:47] [INFO ] Deduced a trap composed of 311 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:47] [INFO ] Deduced a trap composed of 312 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:47] [INFO ] Deduced a trap composed of 326 places in 113 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 101/534 variables, 49/61 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:48] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:48] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:48] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 119 places in 96 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 114 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 71 places in 229 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 133 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 172 places in 239 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :424838 after 998378
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 59 ms to minimize.
SMT process timed out in 10431ms, After SMT, problems are : Problem set: 4 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 141 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 531 transition count 474
Reduce places removed 23 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 52 rules applied. Total rules applied 78 place count 508 transition count 445
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 107 place count 479 transition count 445
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 107 place count 479 transition count 429
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 139 place count 463 transition count 429
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 462 transition count 428
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 462 transition count 428
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 225 place count 420 transition count 386
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 414 transition count 386
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 414 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 241 place count 412 transition count 384
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 269 place count 412 transition count 356
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 297 place count 384 transition count 356
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 324 place count 384 transition count 356
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 325 place count 384 transition count 356
Applied a total of 325 rules in 214 ms. Remains 384 /534 variables (removed 150) and now considering 356/498 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 384/534 places, 356/498 transitions.
RANDOM walk for 40000 steps (2001 resets) in 524 ms. (76 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1561 resets) in 284 ms. (140 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1580 resets) in 235 ms. (169 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1578 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1570 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1574 resets) in 284 ms. (140 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1571 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1575 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1556 resets) in 255 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1545 resets) in 261 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1590 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 216005 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 10
Probabilistic random walk after 216005 steps, saw 108489 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 356 rows 384 cols
[2025-06-01 00:30:55] [INFO ] Computed 52 invariants in 27 ms
[2025-06-01 00:30:55] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 212/361 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 356/717 variables, 361/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 10/423 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 23/740 variables, 23/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/740 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/740 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 446 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 384/384 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 212/361 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 356/717 variables, 361/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 10/423 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 23/740 variables, 23/449 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :998378 after 2.24464e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 5/454 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:16] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 9/463 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:24] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:24] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/740 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:28] [INFO ] Deduced a trap along path composed of 6 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:28] [INFO ] Deduced a trap along path composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/740 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:31:32] [INFO ] Deduced a trap along path composed of 8 places in 64 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/740 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/740 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/740 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 469 constraints, problems are : Problem set: 0 solved, 10 unsolved in 41673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 384/384 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 46189ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 141 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 356/356 transitions.
Applied a total of 0 rules in 15 ms. Remains 384 /384 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 384/384 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 356/356 transitions.
Applied a total of 0 rules in 12 ms. Remains 384 /384 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-01 00:32:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:32:12] [INFO ] Implicit Places using invariants in 180 ms returned [324]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/384 places, 356/356 transitions.
Applied a total of 0 rules in 11 ms. Remains 383 /383 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 215 ms. Remains : 383/384 places, 356/356 transitions.
RANDOM walk for 40000 steps (1982 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1602 resets) in 317 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1557 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1559 resets) in 242 ms. (164 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1565 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1574 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1574 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1573 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1566 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1582 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1563 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 203753 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 10
Probabilistic random walk after 203753 steps, saw 102321 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 356 rows 383 cols
[2025-06-01 00:32:16] [INFO ] Computed 51 invariants in 34 ms
[2025-06-01 00:32:16] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 207/356 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 356/712 variables, 356/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 10/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 27/739 variables, 27/444 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/739 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 444 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 383/383 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 207/356 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 356/712 variables, 356/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 10/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:21] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:21] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:21] [INFO ] Deduced a trap along path composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:21] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:21] [INFO ] Deduced a trap along path composed of 10 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:21] [INFO ] Deduced a trap along path composed of 10 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:21] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 27/739 variables, 27/454 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/739 variables, 5/459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:38] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:40] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:40] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:40] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:41] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:41] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/739 variables, 11/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:48] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:48] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:49] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/739 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:55] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:56] [INFO ] Deduced a trap along path composed of 9 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:32:56] [INFO ] Deduced a trap along path composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/739 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:33:02] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/739 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:33:06] [INFO ] Deduced a trap along path composed of 6 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:33:06] [INFO ] Deduced a trap along path composed of 11 places in 49 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/739 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/739 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/739 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 479 constraints, problems are : Problem set: 0 solved, 10 unsolved in 51443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 383/383 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 12/12 constraints]
After SMT, in 55631ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 30006 ms.
Support contains 141 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 356/356 transitions.
Applied a total of 0 rules in 12 ms. Remains 383 /383 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 383/383 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 356/356 transitions.
Applied a total of 0 rules in 9 ms. Remains 383 /383 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-01 00:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:33:41] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-01 00:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:33:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 00:33:43] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned [86, 211, 289, 312, 380]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1810 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 378/383 places, 356/356 transitions.
Applied a total of 0 rules in 15 ms. Remains 378 /378 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1835 ms. Remains : 378/383 places, 356/356 transitions.
RANDOM walk for 40000 steps (1958 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1577 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1574 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1554 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1567 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1560 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1578 resets) in 253 ms. (157 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1553 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1560 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1583 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1561 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 177180 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 10
Probabilistic random walk after 177180 steps, saw 88996 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 356 rows 378 cols
[2025-06-01 00:33:47] [INFO ] Computed 46 invariants in 28 ms
[2025-06-01 00:33:47] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 202/351 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 356/707 variables, 351/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 27/734 variables, 27/434 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/734 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 434 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3415 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 378/378 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 202/351 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 356/707 variables, 351/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:33:51] [INFO ] Deduced a trap along path composed of 16 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:33:51] [INFO ] Deduced a trap along path composed of 10 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:33:51] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 27/734 variables, 27/440 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/734 variables, 5/445 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:06] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:06] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:06] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:06] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:06] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:06] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/734 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:13] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:15] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:17] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/734 variables, 9/460 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/734 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:29] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:29] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/734 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:33] [INFO ] Deduced a trap along path composed of 6 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:34:33] [INFO ] Deduced a trap along path composed of 5 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/734 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/734 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/734 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/734 variables, and 466 constraints, problems are : Problem set: 0 solved, 10 unsolved in 52353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 378/378 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 55815ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 141 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 356/356 transitions.
Applied a total of 0 rules in 14 ms. Remains 378 /378 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 378/378 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 356/356 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-01 00:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:35:13] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-01 00:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:35:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 00:35:14] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:35:14] [INFO ] Redundant transitions in 20 ms returned []
Running 355 sub problems to find dead transitions.
[2025-06-01 00:35:14] [INFO ] Invariant cache hit.
[2025-06-01 00:35:14] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/375 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 3/378 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:35:28] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:35:29] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (OVERLAPS) 356/734 variables, 378/426 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 10/436 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 734/734 variables, and 436 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 378/378 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/375 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (OVERLAPS) 3/378 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (OVERLAPS) 356/734 variables, 378/426 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 10/436 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 355/791 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 734/734 variables, and 791 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 378/378 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61843 ms. Remains : 378/378 places, 356/356 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 378 transition count 353
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 375 transition count 353
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 375 transition count 351
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 373 transition count 351
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 373 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 372 transition count 350
Applied a total of 12 rules in 36 ms. Remains 372 /378 variables (removed 6) and now considering 350/356 (removed 6) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 350 rows 372 cols
[2025-06-01 00:36:15] [INFO ] Computed 46 invariants in 24 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 00:36:15] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 00:36:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:36:15] [INFO ] [Nat]Absence check using 2 positive and 44 generalized place invariants in 26 ms returned sat
[2025-06-01 00:36:18] [INFO ] After 3516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:19] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 6 ms to minimize.
[2025-06-01 00:36:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 964 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:20] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:20] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:20] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:20] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:21] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:21] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 6 ms to minimize.
[2025-06-01 00:36:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 948 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:21] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 8 ms to minimize.
[2025-06-01 00:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:21] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 9 ms to minimize.
[2025-06-01 00:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:23] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:23] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 10 ms to minimize.
[2025-06-01 00:36:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:24] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 8 ms to minimize.
[2025-06-01 00:36:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:25] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:25] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 5 ms to minimize.
[2025-06-01 00:36:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:26] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 9 ms to minimize.
[2025-06-01 00:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:29] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 12 ms to minimize.
[2025-06-01 00:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:36:29] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 9 ms to minimize.
[2025-06-01 00:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
TRAPS : Iteration 2
[2025-06-01 00:36:33] [INFO ] After 18068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2025-06-01 00:36:38] [INFO ] After 23140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2025-06-01 00:36:38] [INFO ] Flatten gal took : 29 ms
[2025-06-01 00:36:38] [INFO ] Flatten gal took : 21 ms
[2025-06-01 00:36:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17087630838258118282.gal : 11 ms
[2025-06-01 00:36:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16432488679890155433.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17087630838258118282.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16432488679890155433.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16432488679890155433.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :9 after 21
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :21 after 51
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :51 after 100
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :100 after 344
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :344 after 1419
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1419 after 10519
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :10519 after 253064
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :253064 after 1.98732e+06
Detected timeout of ITS tools.
[2025-06-01 00:36:53] [INFO ] Flatten gal took : 19 ms
[2025-06-01 00:36:53] [INFO ] Applying decomposition
[2025-06-01 00:36:53] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4074110715910856006.txt' '-o' '/tmp/graph4074110715910856006.bin' '-w' '/tmp/graph4074110715910856006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4074110715910856006.bin' '-l' '-1' '-v' '-w' '/tmp/graph4074110715910856006.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:36:53] [INFO ] Decomposing Gal with order
[2025-06-01 00:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:36:53] [INFO ] Removed a total of 166 redundant transitions.
[2025-06-01 00:36:54] [INFO ] Flatten gal took : 173 ms
[2025-06-01 00:36:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 30 ms.
[2025-06-01 00:36:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8613517875798156806.gal : 7 ms
[2025-06-01 00:36:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5032242792789132352.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8613517875798156806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5032242792789132352.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5032242792789132352.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :9 after 23
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :23 after 55
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :55 after 105
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :105 after 346
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :346 after 1770
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1770 after 14361
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :14361 after 330083
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :330083 after 2.03133e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 54427 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 00:37:09] [INFO ] Flatten gal took : 24 ms
[2025-06-01 00:37:09] [INFO ] Applying decomposition
[2025-06-01 00:37:09] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15992704492964804131.txt' '-o' '/tmp/graph15992704492964804131.bin' '-w' '/tmp/graph15992704492964804131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15992704492964804131.bin' '-l' '-1' '-v' '-w' '/tmp/graph15992704492964804131.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:37:09] [INFO ] Decomposing Gal with order
[2025-06-01 00:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:37:09] [INFO ] Removed a total of 163 redundant transitions.
[2025-06-01 00:37:09] [INFO ] Flatten gal took : 63 ms
[2025-06-01 00:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2025-06-01 00:37:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10431575327479289525.gal : 18 ms
[2025-06-01 00:37:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality484035640477007800.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10431575327479289525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality484035640477007800.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality484035640477007800.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :11 after 21
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :21 after 31
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :31 after 68
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :68 after 119
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :119 after 310
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :310 after 2650
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :2650 after 20656
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :20656 after 148307
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :148307 after 600180
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :600180 after 1.55471e+06
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :1.55471e+06 after 4.262e+07
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :4.262e+07 after 5.43848e+08
SDD proceeding with computation,10 properties remain. new max is 262144
SDD size :5.43848e+08 after 2.46699e+09
Detected timeout of ITS tools.
[2025-06-01 01:07:09] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9248818151106055821
[2025-06-01 01:07:10] [INFO ] Applying decomposition
[2025-06-01 01:07:10] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2025-06-01 01:07:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:07:10] [INFO ] Flatten gal took : 12 ms
[2025-06-01 01:07:10] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2025-06-01 01:07:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13251562506712602259.txt' '-o' '/tmp/graph13251562506712602259.bin' '-w' '/tmp/graph13251562506712602259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13251562506712602259.bin' '-l' '-1' '-v' '-w' '/tmp/graph13251562506712602259.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:07:10] [INFO ] Decomposing Gal with order
[2025-06-01 01:07:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:07:10] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2025-06-01 01:07:10] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:07:10] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9248818151106055821
[2025-06-01 01:07:10] [INFO ] Removed a total of 151 redundant transitions.
Running compilation step : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '72' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 01:07:10] [INFO ] Flatten gal took : 31 ms
[2025-06-01 01:07:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2025-06-01 01:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5966726021894950176.gal : 4 ms
[2025-06-01 01:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality870947143869788699.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5966726021894950176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality870947143869788699.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality870947143869788699.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :9 after 23
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :23 after 55
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :55 after 105
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :105 after 348
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :348 after 2261
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :2261 after 25381
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :25381 after 192212
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :192212 after 487105
Compilation finished in 977 ms.
Running link step : cd /tmp/ltsmin9248818151106055821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202502==true'
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :487105 after 1.17015e+06
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202502==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202504==true'
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :1.17015e+06 after 1.38366e+08
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202505==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202506==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202506==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202508==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202508==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202409==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202409==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202410==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202411==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202411==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202314==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202314==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202515==true'
WARNING : LTSmin timed out (>36 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202515==true'
Retrying LTSmin with larger timeout 2880 s
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202502==true'
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :1.38366e+08 after 1.42485e+09
WARNING : LTSmin timed out (>288 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202502==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202504==true'
WARNING : LTSmin timed out (>288 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202505==true'
WARNING : LTSmin timed out (>288 s) on command cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin9248818151106055821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality202506==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067600494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;