Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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 67K 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-004-ReachabilityFireability-2023-03
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2023-06
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-00
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-01
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-02
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-04
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-05
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-07
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-08
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-09
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-10
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-11
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-12
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-13
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-14
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748733753372

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-31 23:22:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 23:22:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:22:34] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2025-05-31 23:22:34] [INFO ] Transformed 216 places.
[2025-05-31 23:22:34] [INFO ] Transformed 198 transitions.
[2025-05-31 23:22:34] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 23:22:35] [INFO ] Flatten gal took : 73 ms
[2025-05-31 23:22:35] [INFO ] Flatten gal took : 40 ms
RANDOM walk for 40000 steps (1342 resets) in 1519 ms. (26 steps per ms) remains 16/16 properties
[2025-05-31 23:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1031962310146603334.gal : 19 ms
[2025-05-31 23:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14557328930491189994.prop : 4 ms
BEST_FIRST walk for 4001 steps (107 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
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/ReachabilityCardinality1031962310146603334.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14557328930491189994.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4000 steps (113 resets) in 99 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 51 ms. (76 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 ...329
Loading property file /tmp/ReachabilityCardinality14557328930491189994.prop.
BEST_FIRST walk for 4000 steps (117 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (116 resets) in 54 ms. (72 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
BEST_FIRST walk for 4000 steps (115 resets) in 72 ms. (54 steps per ms) remains 16/16 properties
SDD size :25 after 32
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 75
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :75 after 154
BEST_FIRST walk for 4000 steps (111 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :154 after 628
BEST_FIRST walk for 4001 steps (115 resets) in 84 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :628 after 2806
BEST_FIRST walk for 4001 steps (116 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (109 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
Reachability property DoubleExponent-PT-004-ReachabilityFireability-2025-15 is true.
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
BEST_FIRST walk for 4001 steps (108 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (104 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
Invariant property DoubleExponent-PT-004-ReachabilityFireability-2025-04 does not hold.
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :2806 after 28502
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :28502 after 119247
Reachability property DoubleExponent-PT-004-ReachabilityFireability-2025-10 is true.
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 229726 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :2 out of 16
Probabilistic random walk after 229726 steps, saw 114875 distinct states, run finished after 3005 ms. (steps per millisecond=76 ) properties seen :2
// Phase 1: matrix 198 rows 216 cols
[2025-05-31 23:22:38] [INFO ] Computed 24 invariants in 15 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-05 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-07 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-09 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-12 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-14 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 35/195 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-02 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-08 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2025-13 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 21/216 variables, 19/24 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 198/414 variables, 216/240 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/240 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/240 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 240 constraints, problems are : Problem set: 8 solved, 5 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 13/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 121/146 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/151 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 64/215 variables, 20/24 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:40] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 14/38 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/216 variables, 1/39 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:41] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/40 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 198/414 variables, 216/256 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 5/261 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:42] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:42] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:42] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 3/264 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/414 variables, 0/264 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/414 variables, 0/264 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 264 constraints, problems are : Problem set: 8 solved, 5 unsolved in 3389 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4370ms problems are : Problem set: 8 solved, 5 unsolved
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :119247 after 393595
Parikh walk visited 0 properties in 4591 ms.
Support contains 25 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 209 transition count 165
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 178 transition count 162
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 175 transition count 162
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 72 place count 175 transition count 153
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 90 place count 166 transition count 153
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 152 place count 135 transition count 122
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 162 place count 130 transition count 122
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 175 place count 130 transition count 109
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 188 place count 117 transition count 109
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 199 place count 117 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 116 transition count 108
Applied a total of 200 rules in 72 ms. Remains 116 /216 variables (removed 100) and now considering 108/198 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 116/216 places, 108/198 transitions.
RANDOM walk for 40000 steps (5008 resets) in 471 ms. (84 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3045 resets) in 316 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3039 resets) in 236 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3095 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3067 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3046 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 553749 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :1 out of 5
Probabilistic random walk after 553749 steps, saw 277606 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :1
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 108 rows 116 cols
[2025-05-31 23:22:51] [INFO ] Computed 20 invariants in 6 ms
[2025-05-31 23:22:51] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/112 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/114 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 108/222 variables, 114/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 9/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:51] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/224 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/224 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 146 constraints, problems are : Problem set: 0 solved, 4 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 56/112 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:52] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:52] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:52] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:52] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:52] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:52] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/114 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 108/222 variables, 114/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/224 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:53] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:53] [INFO ] Deduced a trap along path composed of 17 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:53] [INFO ] Deduced a trap along path composed of 33 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:22:53] [INFO ] Deduced a trap along path composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/224 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 161 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2534ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2943 ms.
Support contains 24 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 108/108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 115 transition count 107
Applied a total of 3 rules in 13 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 115/116 places, 107/108 transitions.
RANDOM walk for 40000 steps (4944 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3043 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3064 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3092 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3066 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :393595 after 681272
Interrupted probabilistic random walk after 422032 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 4
Probabilistic random walk after 422032 steps, saw 211751 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 107 rows 115 cols
[2025-05-31 23:23:00] [INFO ] Computed 20 invariants in 2 ms
[2025-05-31 23:23:00] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/111 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/113 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 107/220 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/222 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 144 constraints, problems are : Problem set: 0 solved, 4 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 56/111 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:00] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:00] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:00] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:00] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:00] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:00] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/113 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 107/220 variables, 113/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/222 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:01] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/222 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 157 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1075 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1296ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2512 ms.
Support contains 24 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 115/115 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-05-31 23:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:23:04] [INFO ] Implicit Places using invariants in 109 ms returned [25, 32, 56, 78, 83, 103, 111]
[2025-05-31 23:23:04] [INFO ] Actually due to overlaps returned [83, 78, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 118 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/115 places, 107/107 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 107
Applied a total of 2 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 112 cols
[2025-05-31 23:23:04] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:23:04] [INFO ] Implicit Places using invariants in 95 ms returned [25, 32, 100, 108]
[2025-05-31 23:23:04] [INFO ] Actually due to overlaps returned [108, 100]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 110/115 places, 107/107 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 107
Applied a total of 1 rules in 10 ms. Remains 110 /110 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 110 cols
[2025-05-31 23:23:04] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:23:04] [INFO ] Implicit Places using invariants in 79 ms returned [25, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 108/115 places, 107/107 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 106
Applied a total of 2 rules in 7 ms. Remains 107 /108 variables (removed 1) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 107 cols
[2025-05-31 23:23:04] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:23:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 23:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:23:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 23:23:04] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 107/115 places, 106/107 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 623 ms. Remains : 107/115 places, 106/107 transitions.
RANDOM walk for 40000 steps (5046 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3082 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3073 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3058 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3060 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 439571 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 4
Probabilistic random walk after 439571 steps, saw 220093 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2025-05-31 23:23:07] [INFO ] Invariant cache hit.
[2025-05-31 23:23:07] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 21/105 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 106/211 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/213 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/105 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 106/211 variables, 105/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:08] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/213 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:09] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:09] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:09] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 11 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/213 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 153 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1754ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3366 ms.
Support contains 24 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 106/106 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 107/107 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-05-31 23:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:23:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 23:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 23:23:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 23:23:13] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 23:23:13] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-31 23:23:13] [INFO ] Invariant cache hit.
[2025-05-31 23:23:13] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:14] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:15] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:16] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:16] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 106/213 variables, 107/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:17] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:17] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:18] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:18] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:18] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :681272 after 1.28184e+06
After SMT solving in domain Real declared 213/213 variables, and 157 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7330 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:21] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:22] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:22] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:22] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:22] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/213 variables, 107/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 105/284 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:24] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:24] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:24] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:24] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:25] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:25] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:27] [INFO ] Deduced a trap along path composed of 22 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:35] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:35] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:36] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:36] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:36] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:36] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:36] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:36] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:36] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:37] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 8 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/213 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (OVERLAPS) 0/213 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 311 constraints, problems are : Problem set: 0 solved, 105 unsolved in 29725 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37080ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 37080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37373 ms. Remains : 107/107 places, 106/106 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 107 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 104 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 103 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 103 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 103 transition count 102
Applied a total of 9 rules in 14 ms. Remains 103 /107 variables (removed 4) and now considering 102/106 (removed 4) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 102 rows 103 cols
[2025-05-31 23:23:50] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 23:23:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 23:23:50] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-05-31 23:23:50] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 23:23:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-31 23:23:50] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-05-31 23:23:50] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 23:23:50] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
[2025-05-31 23:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 1
[2025-05-31 23:23:50] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 23:23:50] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-05-31 23:23:50] [INFO ] Flatten gal took : 23 ms
[2025-05-31 23:23:50] [INFO ] Flatten gal took : 12 ms
[2025-05-31 23:23:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6087313820734050716.gal : 2 ms
[2025-05-31 23:23:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6315781031408567884.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/ReachabilityCardinality6087313820734050716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6315781031408567884.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/ReachabilityCardinality6315781031408567884.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17 after 31
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :31 after 60
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :60 after 139
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :139 after 281
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :281 after 607
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :607 after 1612
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1612 after 3758
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3758 after 8059
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :8059 after 16700
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :16700 after 33934
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :33934 after 68402
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :68402 after 137288
Detected timeout of ITS tools.
[2025-05-31 23:24:05] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:24:05] [INFO ] Applying decomposition
[2025-05-31 23:24:05] [INFO ] Flatten gal took : 7 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/graph13696263049327564462.txt' '-o' '/tmp/graph13696263049327564462.bin' '-w' '/tmp/graph13696263049327564462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13696263049327564462.bin' '-l' '-1' '-v' '-w' '/tmp/graph13696263049327564462.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:24:06] [INFO ] Decomposing Gal with order
[2025-05-31 23:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:24:06] [INFO ] Removed a total of 69 redundant transitions.
[2025-05-31 23:24:06] [INFO ] Flatten gal took : 46 ms
[2025-05-31 23:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2025-05-31 23:24:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4532657972354270650.gal : 3 ms
[2025-05-31 23:24:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4979444966461826692.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/ReachabilityCardinality4532657972354270650.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4979444966461826692.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4979444966461826692.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :183 after 235
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :23326 after 24562
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :24562 after 24586
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :78649 after 85423
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :743146 after 6.8675e+06
Reachability property DoubleExponent-PT-004-ReachabilityFireability-2025-00 is true.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :3.29335e+06 after 3.32037e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30855 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 23:24:21] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:24:21] [INFO ] Applying decomposition
[2025-05-31 23:24:21] [INFO ] Flatten gal took : 9 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/graph185391657959810253.txt' '-o' '/tmp/graph185391657959810253.bin' '-w' '/tmp/graph185391657959810253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph185391657959810253.bin' '-l' '-1' '-v' '-w' '/tmp/graph185391657959810253.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:24:21] [INFO ] Decomposing Gal with order
[2025-05-31 23:24:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:24:21] [INFO ] Removed a total of 57 redundant transitions.
[2025-05-31 23:24:21] [INFO ] Flatten gal took : 22 ms
[2025-05-31 23:24:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-31 23:24:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2430986848690502626.gal : 4 ms
[2025-05-31 23:24:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2700624866785434693.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/ReachabilityCardinality2430986848690502626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2700624866785434693.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2700624866785434693.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :34 after 58
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3224 after 3753
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :3753 after 4109
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :566657 after 566657
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :708103 after 708244
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.13778e+06 after 1.13792e+06
Detected timeout of ITS tools.
[2025-05-31 23:54:21] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10713890554666713825
[2025-05-31 23:54:21] [INFO ] Applying decomposition
[2025-05-31 23:54:21] [INFO ] Flatten gal took : 5 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/graph7894710469565448894.txt' '-o' '/tmp/graph7894710469565448894.bin' '-w' '/tmp/graph7894710469565448894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7894710469565448894.bin' '-l' '-1' '-v' '-w' '/tmp/graph7894710469565448894.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:54:21] [INFO ] Decomposing Gal with order
[2025-05-31 23:54:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:54:21] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2025-05-31 23:54:21] [INFO ] Removed a total of 47 redundant transitions.
[2025-05-31 23:54:21] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:54:21] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 23:54:21] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2025-05-31 23:54:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 23:54:21] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2025-05-31 23:54:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-31 23:54:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12616857918246942477.gal : 2 ms
[2025-05-31 23:54:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1607411554192725003.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/ReachabilityFireability12616857918246942477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1607411554192725003.prop' '--nowitness'
[2025-05-31 23:54:21] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability1607411554192725003.prop.
[2025-05-31 23:54:21] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10713890554666713825
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
Running compilation step : cd /tmp/ltsmin10713890554666713825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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'
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :41 after 76
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :862 after 951
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1850 after 1893
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1893 after 1947
Compilation finished in 335 ms.
Running link step : cd /tmp/ltsmin10713890554666713825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10713890554666713825;'/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' 'DoubleExponentPT004ReachabilityFireability202501==true'
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1947 after 4777
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :360772 after 360807
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Initializing POR dependencies: labels 110, guards 106
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 0.092: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.093: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.093: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.093: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.094: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.094: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.094: There are 110 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.094: State length is 107, there are 106 groups
pins2lts-mc-linux64( 0/ 8), 0.094: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.094: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.094: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.094: Visible groups: 0 / 106, labels: 1 / 110
pins2lts-mc-linux64( 0/ 8), 0.094: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.094: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.094: "DoubleExponentPT004ReachabilityFireability202501==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.644: ~54 levels ~960 states ~1048 transitions
pins2lts-mc-linux64( 6/ 8), 3.490: ~93 levels ~1920 states ~1992 transitions
pins2lts-mc-linux64( 1/ 8), 3.901: ~83 levels ~3840 states ~3904 transitions
pins2lts-mc-linux64( 2/ 8), 3.980: ~175 levels ~7680 states ~8248 transitions
pins2lts-mc-linux64( 2/ 8), 4.037: ~325 levels ~15360 states ~15712 transitions
pins2lts-mc-linux64( 1/ 8), 4.145: ~343 levels ~30720 states ~30672 transitions
pins2lts-mc-linux64( 0/ 8), 4.440: ~445 levels ~61440 states ~62640 transitions
pins2lts-mc-linux64( 4/ 8), 5.618: ~2105 levels ~122880 states ~121600 transitions
pins2lts-mc-linux64( 7/ 8), 7.699: ~2211 levels ~245760 states ~249176 transitions
pins2lts-mc-linux64( 0/ 8), 12.850: ~4315 levels ~491520 states ~494464 transitions
pins2lts-mc-linux64( 0/ 8), 16.006: ~8501 levels ~983040 states ~984280 transitions
pins2lts-mc-linux64( 1/ 8), 17.732: ~13287 levels ~1966080 states ~1967088 transitions
pins2lts-mc-linux64( 6/ 8), 20.452: ~14430 levels ~3932160 states ~3919960 transitions
pins2lts-mc-linux64( 1/ 8), 25.820: ~17939 levels ~7864320 states ~7822328 transitions
pins2lts-mc-linux64( 1/ 8), 36.471: ~24313 levels ~15728640 states ~15645272 transitions
pins2lts-mc-linux64( 6/ 8), 58.088: ~34278 levels ~31457280 states ~31275264 transitions
pins2lts-mc-linux64( 7/ 8), 101.590: ~50725 levels ~62914560 states ~62687424 transitions
pins2lts-mc-linux64( 7/ 8), 190.435: ~83099 levels ~125829120 states ~125537656 transitions
pins2lts-mc-linux64( 6/ 8), 210.278: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 210.291:
pins2lts-mc-linux64( 0/ 8), 210.291: mean standard work distribution: 1.1% (states) 0.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 210.291:
pins2lts-mc-linux64( 0/ 8), 210.291: Explored 134048312 states 134216884 transitions, fanout: 1.001
pins2lts-mc-linux64( 0/ 8), 210.291: Total exploration time 210.190 sec (210.180 sec minimum, 210.184 sec on average)
pins2lts-mc-linux64( 0/ 8), 210.291: States per second: 637748, Transitions per second: 638550
pins2lts-mc-linux64( 0/ 8), 210.291: Ignoring proviso: 1
pins2lts-mc-linux64( 0/ 8), 210.291:
pins2lts-mc-linux64( 0/ 8), 210.291: Queue width: 8B, total height: 289384, memory: 2.21MB
pins2lts-mc-linux64( 0/ 8), 210.291: Tree memory: 1041.3MB, 8.1 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 210.291: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 210.291: Stored 106 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 210.291: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 210.291: Est. total memory use: 1043.5MB (~1026.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10713890554666713825;'/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' 'DoubleExponentPT004ReachabilityFireability202501==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10713890554666713825;'/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' 'DoubleExponentPT004ReachabilityFireability202501==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.04171e+06 after 1.04179e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.2668e+09 after 2.2668e+09
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3.20156e+09 after 3.20156e+09

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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