About the Execution of ITS-Tools for CANConstruction-PT-010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 237320.00 | 0.00 | 0.00 | TTFFTTTTTTFTTTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400175.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 CANConstruction-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400175
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 173K 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 CANConstruction-PT-010-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-00
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-01
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-02
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-03
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-05
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-06
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-07
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-08
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-09
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-10
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-11
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-12
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-13
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-14
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748632316351
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 19:11:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 19:11:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 19:11:59] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-05-30 19:11:59] [INFO ] Transformed 322 places.
[2025-05-30 19:11:59] [INFO ] Transformed 480 transitions.
[2025-05-30 19:11:59] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
[2025-05-30 19:11:59] [INFO ] Flatten gal took : 236 ms
[2025-05-30 19:12:00] [INFO ] Flatten gal took : 99 ms
RANDOM walk for 40000 steps (241 resets) in 2549 ms. (15 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 19:12:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10076616763381438489.gal : 75 ms
[2025-05-30 19:12:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality449732213257935283.prop : 14 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/ReachabilityCardinality10076616763381438489.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality449732213257935283.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality449732213257935283.prop.
BEST_FIRST walk for 40004 steps (30 resets) in 1106 ms. (36 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (27 resets) in 562 ms. (71 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 12
BEST_FIRST walk for 40004 steps (9 resets) in 658 ms. (60 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 18
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :18 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 37
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :37 after 47
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :47 after 66
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :66 after 108
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :108 after 177
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :177 after 1367
BEST_FIRST walk for 40002 steps (31 resets) in 1971 ms. (20 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (29 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1367 after 2130
// Phase 1: matrix 480 rows 322 cols
[2025-05-30 19:12:01] [INFO ] Computed 21 invariants in 50 ms
[2025-05-30 19:12:01] [INFO ] State equation strengthened by 190 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,6 properties remain. new max is 8192
SDD size :2130 after 14384
Problem CANConstruction-PT-010-ReachabilityFireability-2025-08 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem CANConstruction-PT-010-ReachabilityFireability-2025-02 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 160/316 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/322 variables, 6/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 480/802 variables, 322/343 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :14384 after 60593
Problem CANConstruction-PT-010-ReachabilityFireability-2025-01 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-010-ReachabilityFireability-2025-12 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 190/533 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 0/533 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/802 variables, 0/533 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 533 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 322/322 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/313 variables, 11/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:03] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:04] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:04] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:04] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:04] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:04] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:04] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:05] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:05] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:05] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:05] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:05] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:05] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 20/32 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:06] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/33 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/322 variables, 9/42 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:07] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/43 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:07] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/44 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/44 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 480/802 variables, 322/366 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/802 variables, 190/556 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 0/556 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/802 variables, 0/556 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 556 constraints, problems are : Problem set: 4 solved, 2 unsolved in 4408 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 322/322 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6238ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 72 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 322 transition count 454
Reduce places removed 26 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 41 rules applied. Total rules applied 67 place count 296 transition count 439
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 82 place count 281 transition count 439
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 82 place count 281 transition count 434
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 276 transition count 434
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 148 place count 220 transition count 322
Iterating global reduction 3 with 56 rules applied. Total rules applied 204 place count 220 transition count 322
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 222 place count 211 transition count 362
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 211 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 226 place count 209 transition count 360
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 233 place count 209 transition count 360
Applied a total of 233 rules in 177 ms. Remains 209 /322 variables (removed 113) and now considering 360/480 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 209/322 places, 360/480 transitions.
RANDOM walk for 40000 steps (390 resets) in 457 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (41 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 690800 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :1 out of 2
Probabilistic random walk after 690800 steps, saw 91697 distinct states, run finished after 3008 ms. (steps per millisecond=229 ) properties seen :1
FORMULA CANConstruction-PT-010-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 360 rows 209 cols
[2025-05-30 19:12:11] [INFO ] Computed 21 invariants in 7 ms
[2025-05-30 19:12:11] [INFO ] State equation strengthened by 251 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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/200 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/209 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 360/569 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 251/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/569 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/200 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:12] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/209 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/569 variables, 209/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 251/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/569 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 991ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 47 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 360/360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 359
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 208 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 207 transition count 358
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 8 place count 203 transition count 350
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 203 transition count 350
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 197 transition count 344
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 32 place count 193 transition count 344
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 193 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 192 transition count 343
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 35 place count 191 transition count 341
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 191 transition count 341
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 191 transition count 341
Applied a total of 37 rules in 128 ms. Remains 191 /209 variables (removed 18) and now considering 341/360 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 191/209 places, 341/360 transitions.
RANDOM walk for 40000 steps (420 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (51 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :60593 after 1.31483e+06
Interrupted probabilistic random walk after 949024 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 1
Probabilistic random walk after 949024 steps, saw 123880 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
// Phase 1: matrix 341 rows 191 cols
[2025-05-30 19:12:15] [INFO ] Computed 21 invariants in 5 ms
[2025-05-30 19:12:15] [INFO ] State equation strengthened by 264 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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/182 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/191 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 341/532 variables, 191/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 264/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/532 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/182 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:16] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:16] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:16] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/191 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 341/532 variables, 191/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 264/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1074ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 47 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 341/341 transitions.
Applied a total of 0 rules in 20 ms. Remains 191 /191 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 191/191 places, 341/341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 341/341 transitions.
Applied a total of 0 rules in 16 ms. Remains 191 /191 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2025-05-30 19:12:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:17] [INFO ] Implicit Places using invariants in 156 ms returned [8, 18, 25, 32, 53, 60, 69, 77, 85]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 175 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/191 places, 341/341 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 169 transition count 328
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 169 transition count 328
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 166 transition count 325
Applied a total of 32 rules in 54 ms. Remains 166 /182 variables (removed 16) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 166 cols
[2025-05-30 19:12:17] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:17] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-30 19:12:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:17] [INFO ] State equation strengthened by 259 read => feed constraints.
[2025-05-30 19:12:17] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 166/191 places, 325/341 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 883 ms. Remains : 166/191 places, 325/341 transitions.
RANDOM walk for 40000 steps (439 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1210609 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 1
Probabilistic random walk after 1210609 steps, saw 157229 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
[2025-05-30 19:12:20] [INFO ] Invariant cache hit.
[2025-05-30 19:12:20] [INFO ] State equation strengthened by 259 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 325/491 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 259/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 437 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 325/491 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 259/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 437 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 760ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 47 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 325/325 transitions.
Applied a total of 0 rules in 32 ms. Remains 166 /166 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 166/166 places, 325/325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 325/325 transitions.
Applied a total of 0 rules in 28 ms. Remains 166 /166 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2025-05-30 19:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:21] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-05-30 19:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:22] [INFO ] State equation strengthened by 259 read => feed constraints.
[2025-05-30 19:12:22] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 19:12:22] [INFO ] Redundant transitions in 21 ms returned []
Running 315 sub problems to find dead transitions.
[2025-05-30 19:12:22] [INFO ] Invariant cache hit.
[2025-05-30 19:12:22] [INFO ] State equation strengthened by 259 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:24] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:25] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :1.31483e+06 after 1.80298e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:27] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:30] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:30] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:30] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:30] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:30] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 325/490 variables, 165/224 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 259/483 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 1/491 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/491 variables, and 484 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:53] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:53] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:54] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:55] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:56] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:57] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:57] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:57] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:57] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:57] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:58] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:59] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 325/490 variables, 165/254 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 259/513 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 315/828 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 11 (OVERLAPS) 1/491 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 829 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60965 ms. Remains : 166/166 places, 325/325 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 166 edges and 166 vertex of which 17 / 166 are part of one of the 2 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 317 edges and 151 vertex of which 149 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 149 transition count 257
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 59 place count 132 transition count 242
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 92 place count 99 transition count 176
Iterating global reduction 2 with 33 rules applied. Total rules applied 125 place count 99 transition count 176
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 159 place count 99 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 98 transition count 142
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 174 place count 91 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 184 place count 91 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 91 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 90 transition count 124
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 192 place count 90 transition count 124
Applied a total of 192 rules in 34 ms. Remains 90 /166 variables (removed 76) and now considering 124/325 (removed 201) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 124 rows 90 cols
[2025-05-30 19:13:22] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 19:13:22] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-30 19:13:22] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 19:13:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-30 19:13:22] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 19:13:22] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 19:13:22] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-30 19:13:22] [INFO ] Flatten gal took : 11 ms
[2025-05-30 19:13:22] [INFO ] Flatten gal took : 10 ms
[2025-05-30 19:13:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17963221353066633859.gal : 3 ms
[2025-05-30 19:13:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2835867280193632163.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17963221353066633859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2835867280193632163.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/ReachabilityCardinality2835867280193632163.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 60
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :60 after 520
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :520 after 66440
Invariant property CANConstruction-PT-010-ReachabilityFireability-2024-04 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 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,1.91936e+07,8.7324,4928,2,423,12,4333,6,0,448,2207,0
Total reachable state count : 19193640
Verifying 1 reachability properties.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 15281 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 19:13:38] [INFO ] Flatten gal took : 36 ms
[2025-05-30 19:13:38] [INFO ] Applying decomposition
[2025-05-30 19:13:38] [INFO ] Flatten gal took : 33 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/graph7521578953476769669.txt' '-o' '/tmp/graph7521578953476769669.bin' '-w' '/tmp/graph7521578953476769669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7521578953476769669.bin' '-l' '-1' '-v' '-w' '/tmp/graph7521578953476769669.weights' '-q' '0' '-e' '0.001'
[2025-05-30 19:13:38] [INFO ] Decomposing Gal with order
[2025-05-30 19:13:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 19:13:38] [INFO ] Removed a total of 181 redundant transitions.
[2025-05-30 19:13:38] [INFO ] Flatten gal took : 123 ms
[2025-05-30 19:13:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-05-30 19:13:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7371772607771152364.gal : 17 ms
[2025-05-30 19:13:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4916704780235410790.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7371772607771152364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4916704780235410790.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/ReachabilityCardinality4916704780235410790.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 442
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :442 after 9842
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9842 after 1.24241e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.24241e+06 after 1.96128e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.96128e+06 after 4.23844e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.23844e+06 after 1.87765e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.87765e+08 after 2.64697e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.64697e+09 after 5.02723e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.20467e+10 after 5.12677e+10
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\_mod\_flat,8.65257e+10,131.937,1160228,53612,2229,2.59158e+06,52269,1165,3.24959e+06,126,332034,0
Total reachable state count : 86525680270
Verifying 1 reachability properties.
Invariant property CANConstruction-PT-010-ReachabilityFireability-2024-04 is true.
FORMULA CANConstruction-PT-010-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-010-ReachabilityFireability-2024-04,0,134.573,1160228,1,0,2.59158e+06,52269,1289,3.24959e+06,145,332034,641200
All properties solved without resorting to model-checking.
Total runtime 234976 ms.
BK_STOP 1748632553671
--------------------
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="CANConstruction-PT-010"
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 CANConstruction-PT-010, 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 r030-smll-174853813400175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-010.tgz
mv CANConstruction-PT-010 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 ;