About the Execution of ITS-Tools for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ??FTTFTTTTFTTTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068100791.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is EisenbergMcGuire-PT-07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068100791
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2023-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748845019979
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 06:17:01] [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-06-02 06:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:17:01] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-06-02 06:17:01] [INFO ] Transformed 553 places.
[2025-06-02 06:17:01] [INFO ] Transformed 1960 transitions.
[2025-06-02 06:17:01] [INFO ] Found NUPN structural information;
[2025-06-02 06:17:01] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1242 ms. (32 steps per ms) remains 13/16 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 06:17:02] [INFO ] Flatten gal took : 212 ms
BEST_FIRST walk for 40004 steps (8 resets) in 835 ms. (47 steps per ms) remains 12/13 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
[2025-06-02 06:17:02] [INFO ] Flatten gal took : 140 ms
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
[2025-06-02 06:17:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17752144300260980569.gal : 128 ms
[2025-06-02 06:17:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17361403605732091046.prop : 3 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/ReachabilityCardinality17752144300260980569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17361403605732091046.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 1438 ms. (27 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality17361403605732091046.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
[2025-06-02 06:17:03] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2025-06-02 06:17:03] [INFO ] Computed 22 invariants in 27 ms
[2025-06-02 06:17:03] [INFO ] State equation strengthened by 472 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :11 after 13
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :13 after 19
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :19 after 21
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :21 after 90
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :90 after 198
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :198 after 866
Problem EisenbergMcGuire-PT-07-ReachabilityFireability-2025-14 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 393/553 variables, 14/175 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 393/568 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/575 constraints. Problems are: Problem set: 1 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :866 after 1663
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/575 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1001/1554 variables, 553/1128 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1554 variables, 472/1600 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Reachability property EisenbergMcGuire-PT-07-ReachabilityFireability-2025-13 is true.
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1663 after 6052
At refinement iteration 9 (INCLUDED_ONLY) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :6052 after 7421
At refinement iteration 10 (OVERLAPS) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 1600 constraints, problems are : Problem set: 2 solved, 10 unsolved in 2522 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 553/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 12/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/151 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityFireability-2025-02 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-07-ReachabilityFireability-2025-11 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 403/553 variables, 14/165 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 403/568 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/575 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:06] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:06] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:06] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :7421 after 37513
[2025-06-02 06:17:07] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:07] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:07] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:07] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:07] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:07] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:08] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:08] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 11/586 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/586 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1001/1554 variables, 553/1139 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1554 variables, 472/1611 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1554 variables, 5/1616 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1554 variables, 0/1616 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1554/1554 variables, and 1616 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5013 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 553/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7727ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 553 transition count 1955
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 548 transition count 1955
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 10 place count 548 transition count 1823
Deduced a syphon composed of 132 places in 3 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 274 place count 416 transition count 1823
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 306 place count 384 transition count 1599
Iterating global reduction 2 with 32 rules applied. Total rules applied 338 place count 384 transition count 1599
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 412 place count 347 transition count 1562
Applied a total of 412 rules in 206 ms. Remains 347 /553 variables (removed 206) and now considering 1562/1960 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 347/553 places, 1562/1960 transitions.
RANDOM walk for 40000 steps (8 resets) in 412 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :37513 after 115443
Interrupted probabilistic random walk after 206824 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :4 out of 8
Probabilistic random walk after 206824 steps, saw 127117 distinct states, run finished after 3016 ms. (steps per millisecond=68 ) properties seen :4
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 06:17:14] [INFO ] Flow matrix only has 603 transitions (discarded 959 similar events)
// Phase 1: matrix 603 rows 347 cols
[2025-06-02 06:17:14] [INFO ] Computed 22 invariants in 5 ms
[2025-06-02 06:17:14] [INFO ] State equation strengthened by 280 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 286/330 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/340 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/347 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 603/950 variables, 347/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/950 variables, 280/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/950 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/950 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 950/950 variables, and 649 constraints, problems are : Problem set: 0 solved, 4 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 347/347 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 4/3 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 286/330 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:15] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/340 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/347 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:15] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:15] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:15] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:16] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:16] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:16] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:16] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:16] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :115443 after 153746
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 603/950 variables, 347/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/950 variables, 280/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 3/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/950 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 950/950 variables, and 663 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 347/347 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3074ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2175 ms.
Support contains 44 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1562/1562 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 347 transition count 1548
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 333 transition count 1548
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 323 transition count 1478
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 323 transition count 1478
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 319 transition count 1474
Applied a total of 56 rules in 67 ms. Remains 319 /347 variables (removed 28) and now considering 1474/1562 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 319/347 places, 1474/1562 transitions.
RANDOM walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 316840 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 4
Probabilistic random walk after 316840 steps, saw 147146 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2025-06-02 06:17:23] [INFO ] Flow matrix only has 515 transitions (discarded 959 similar events)
// Phase 1: matrix 515 rows 319 cols
[2025-06-02 06:17:23] [INFO ] Computed 22 invariants in 2 ms
[2025-06-02 06:17:23] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 260/304 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/312 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/319 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 515/834 variables, 319/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/834 variables, 220/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/834 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/834 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 561 constraints, problems are : Problem set: 0 solved, 4 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 319/319 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 4/3 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/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 260/304 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:23] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:23] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/312 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/319 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:23] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:23] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:24] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:24] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:24] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:24] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:24] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 515/834 variables, 319/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/834 variables, 220/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/834 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:25] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/834 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/834 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/834 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 575 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2229 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 319/319 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2702ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1209 ms.
Support contains 44 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1474/1474 transitions.
Applied a total of 0 rules in 36 ms. Remains 319 /319 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 319/319 places, 1474/1474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1474/1474 transitions.
Applied a total of 0 rules in 37 ms. Remains 319 /319 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
[2025-06-02 06:17:26] [INFO ] Flow matrix only has 515 transitions (discarded 959 similar events)
[2025-06-02 06:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:17:27] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-06-02 06:17:27] [INFO ] Flow matrix only has 515 transitions (discarded 959 similar events)
[2025-06-02 06:17:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:17:27] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-02 06:17:28] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:17:28] [INFO ] Redundant transitions in 79 ms returned []
Running 1467 sub problems to find dead transitions.
[2025-06-02 06:17:28] [INFO ] Flow matrix only has 515 transitions (discarded 959 similar events)
[2025-06-02 06:17:28] [INFO ] Invariant cache hit.
[2025-06-02 06:17:28] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :153746 after 1.15763e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:37] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:37] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:37] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:37] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:37] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:37] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:37] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:38] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:38] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:38] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:39] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:39] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:39] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:39] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:39] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:40] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:40] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:40] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:40] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:42] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:42] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:43] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:43] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:43] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:43] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:44] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:44] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:44] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:45] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:47] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:47] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:47] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:48] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:48] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:49] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:49] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:49] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:50] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 17 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 131072
SDD size :1.15763e+06 after 2.60124e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/834 variables, and 62 constraints, problems are : Problem set: 0 solved, 1467 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/319 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1467/1467 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1467 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:00] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:05] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:07] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:08] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:10] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:10] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:11] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:11] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:11] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:11] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:12] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:12] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:13] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:13] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:13] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:13] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:14] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:14] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:14] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:14] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:15] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:26] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:27] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:28] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:28] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/834 variables, and 87 constraints, problems are : Problem set: 0 solved, 1467 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/319 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1467 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 1467 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61982 ms. Remains : 319/319 places, 1474/1474 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1063 edges and 319 vertex of which 45 / 319 are part of one of the 7 SCC in 3 ms
Free SCC test removed 38 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 930 transitions
Reduce isomorphic transitions removed 1074 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 281 transition count 351
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 232 transition count 351
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 99 place count 232 transition count 341
Deduced a syphon composed of 10 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 122 place count 219 transition count 341
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 260 place count 150 transition count 272
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 281 place count 150 transition count 251
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 289 place count 146 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 146 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 301 place count 146 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 301 place count 146 transition count 258
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 303 place count 145 transition count 258
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 345 place count 145 transition count 216
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 387 place count 103 transition count 216
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 397 place count 103 transition count 216
Applied a total of 397 rules in 55 ms. Remains 103 /319 variables (removed 216) and now considering 216/1474 (removed 1258) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 216 rows 103 cols
[2025-06-02 06:18:29] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 06:18:29] [INFO ] After 38ms 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-06-02 06:18:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 06:18:29] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 06:18:29] [INFO ] After 68ms 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-06-02 06:18:29] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2025-06-02 06:18:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 145 ms
TRAPS : Iteration 1
[2025-06-02 06:18:29] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-02 06:18:29] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-02 06:18:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:18:29] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:18:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2730243258319085916.gal : 2 ms
[2025-06-02 06:18:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15649413601863721513.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/ReachabilityCardinality2730243258319085916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15649413601863721513.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15649413601863721513.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 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 27
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :27 after 210
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :210 after 1117
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1117 after 1451
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1451 after 2574
Reachability property EisenbergMcGuire-PT-07-ReachabilityFireability-2025-15 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2574 after 43992
Invariant property EisenbergMcGuire-PT-07-ReachabilityFireability-2025-10 does not hold.
Reachability property EisenbergMcGuire-PT-07-ReachabilityFireability-2024-05 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :43992 after 9.22522e+06
Invariant property EisenbergMcGuire-PT-07-ReachabilityFireability-2023-04 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.90302e+07,3.35786,6092,2,777,19,8359,6,0,631,4105,0
Total reachable state count : 79030224
Verifying 4 reachability properties.
Invariant property EisenbergMcGuire-PT-07-ReachabilityFireability-2023-04 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-07-ReachabilityFireability-2023-04,130,6.04872,6220,2,178,19,8359,7,0,646,4105,0
Reachability property EisenbergMcGuire-PT-07-ReachabilityFireability-2024-05 is true.
SDD proceeding with computation,11 properties remain. new max is 262144
SDD size :2.60124e+06 after 5.2474e+06
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 15585 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 06:18:44] [INFO ] Flatten gal took : 59 ms
[2025-06-02 06:18:44] [INFO ] Applying decomposition
[2025-06-02 06:18:44] [INFO ] Flatten gal took : 58 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/graph11348135345643753102.txt' '-o' '/tmp/graph11348135345643753102.bin' '-w' '/tmp/graph11348135345643753102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11348135345643753102.bin' '-l' '-1' '-v' '-w' '/tmp/graph11348135345643753102.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:18:45] [INFO ] Decomposing Gal with order
[2025-06-02 06:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:18:45] [INFO ] Removed a total of 3632 redundant transitions.
[2025-06-02 06:18:45] [INFO ] Flatten gal took : 339 ms
[2025-06-02 06:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 78 ms.
[2025-06-02 06:18:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3507707765897212148.gal : 25 ms
[2025-06-02 06:18:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2984459486597555989.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/ReachabilityCardinality3507707765897212148.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2984459486597555989.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/ReachabilityCardinality2984459486597555989.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 :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 36
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :36 after 36
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :36 after 687
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :687 after 24009
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :24009 after 71296
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :71296 after 246442
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :246442 after 2.7207e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2.7207e+06 after 3.26231e+07
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3.26231e+07 after 1.16181e+08
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.16181e+08 after 1.18452e+08
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :1.18452e+08 after 1.19076e+09
Detected timeout of ITS tools.
[2025-06-02 06:48:47] [INFO ] Flatten gal took : 400 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15791557024845176709
[2025-06-02 06:48:47] [INFO ] Applying decomposition
[2025-06-02 06:48:47] [INFO ] Computing symmetric may disable matrix : 1474 transitions.
[2025-06-02 06:48:47] [INFO ] Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:48:47] [INFO ] Computing symmetric may enable matrix : 1474 transitions.
[2025-06-02 06:48:47] [INFO ] Computation of Complete enable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:48:47] [INFO ] Flatten gal took : 320 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/graph9261288569926167644.txt' '-o' '/tmp/graph9261288569926167644.bin' '-w' '/tmp/graph9261288569926167644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9261288569926167644.bin' '-l' '-1' '-v' '-w' '/tmp/graph9261288569926167644.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:48:50] [INFO ] Decomposing Gal with order
[2025-06-02 06:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:48:51] [INFO ] Removed a total of 2928 redundant transitions.
[2025-06-02 06:48:51] [INFO ] Flatten gal took : 215 ms
[2025-06-02 06:48:51] [INFO ] Computing Do-Not-Accords matrix : 1474 transitions.
[2025-06-02 06:48:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 58 ms.
[2025-06-02 06:48:51] [INFO ] Computation of Completed DNA matrix. took 122 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:48:51] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability946225079594058614.gal : 14 ms
[2025-06-02 06:48:51] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability74368891807030997.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/ReachabilityFireability946225079594058614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability74368891807030997.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 ...304
[2025-06-02 06:48:51] [INFO ] Built C files in 3840ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15791557024845176709
Loading property file /tmp/ReachabilityFireability74368891807030997.prop.
Running compilation step : cd /tmp/ltsmin15791557024845176709;'/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 4
SDD size :1 after 44
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :44 after 78
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :78 after 394
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :394 after 540833
Compilation finished in 5860 ms.
Running link step : cd /tmp/ltsmin15791557024845176709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin15791557024845176709;'/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' 'EisenbergMcGuirePT07ReachabilityFireability202304==true'
Reachability property EisenbergMcGuire-PT-07-ReachabilityFireability-2025-15 is true.
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :540833 after 2.48544e+06
Invariant property EisenbergMcGuire-PT-07-ReachabilityFireability-2025-10 does not hold.
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2.48544e+06 after 5.17181e+06
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15791557024845176709;'/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' 'EisenbergMcGuirePT07ReachabilityFireability202304==true'
Running LTSmin : cd /tmp/ltsmin15791557024845176709;'/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' 'EisenbergMcGuirePT07ReachabilityFireability202405==true'
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5.17181e+06 after 2.67924e+07
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.67924e+07 after 2.72859e+07
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15791557024845176709;'/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' 'EisenbergMcGuirePT07ReachabilityFireability202405==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin15791557024845176709;'/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' 'EisenbergMcGuirePT07ReachabilityFireability202304==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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-174860068100791"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "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 '
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 ;