fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853729100335
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ASLink-PT-04a

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 TFTTT?TTTTFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729100335.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 ASLink-PT-04a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729100335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 436K 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 ASLink-PT-04a-ReachabilityFireability-2025-00
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-01
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-02
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-03
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-04
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-05
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-06
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-07
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-08
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-09
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-10
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-11
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-12
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-13
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-14
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748577566143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 03:59:27] [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 03:59:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:59:27] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-05-30 03:59:27] [INFO ] Transformed 1016 places.
[2025-05-30 03:59:27] [INFO ] Transformed 1554 transitions.
[2025-05-30 03:59:27] [INFO ] Found NUPN structural information;
[2025-05-30 03:59:27] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
RANDOM walk for 40000 steps (274 resets) in 1825 ms. (21 steps per ms) remains 13/16 properties
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (49 resets) in 443 ms. (90 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (48 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
[2025-05-30 03:59:28] [INFO ] Flatten gal took : 372 ms
BEST_FIRST walk for 40004 steps (52 resets) in 265 ms. (150 steps per ms) remains 12/13 properties
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 321 ms. (124 steps per ms) remains 12/12 properties
[2025-05-30 03:59:28] [INFO ] Flatten gal took : 210 ms
BEST_FIRST walk for 40003 steps (51 resets) in 338 ms. (118 steps per ms) remains 12/12 properties
[2025-05-30 03:59:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14675709700568229916.gal : 119 ms
[2025-05-30 03:59:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1761142054698246759.prop : 6 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/ReachabilityCardinality14675709700568229916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1761142054698246759.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (50 resets) in 721 ms. (55 steps per ms) remains 12/12 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (52 resets) in 394 ms. (101 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality1761142054698246759.prop.
BEST_FIRST walk for 40004 steps (47 resets) in 345 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (50 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (52 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (55 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (48 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (47 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
// Phase 1: matrix 1538 rows 1016 cols
[2025-05-30 03:59:29] [INFO ] Computed 194 invariants in 98 ms
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 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 15
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :15 after 35
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :35 after 36
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :36 after 68
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :68 after 6724
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :6724 after 2.99392e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 116/321 variables, 25/232 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 116/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 73/394 variables, 21/370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 73/443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :2.99392e+07 after 5.6939e+11
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 616/1010 variables, 141/584 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 616/1200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 6/1016 variables, 4/1204 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1016 variables, 6/1210 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1016/2554 variables, and 1210 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5044 ms.
Refiners :[Domain max(s): 1016/1016 constraints, Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 12/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 116/321 variables, 25/232 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 116/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 73/394 variables, 21/370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 73/443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem ASLink-PT-04a-ReachabilityFireability-2025-07 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 616/1010 variables, 141/584 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 616/1200 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:37] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:37] [INFO ] Deduced a trap composed of 91 places in 240 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:37] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:38] [INFO ] Deduced a trap composed of 91 places in 245 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:39] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/2554 variables, and 1205 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5012 ms.
Refiners :[Domain max(s): 1010/1016 constraints, Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 144/148 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10301ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 14 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 994 transition count 1466
Reduce places removed 72 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 75 rules applied. Total rules applied 169 place count 922 transition count 1463
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 172 place count 919 transition count 1463
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 172 place count 919 transition count 1387
Deduced a syphon composed of 76 places in 6 ms
Ensure Unique test removed 28 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 352 place count 815 transition count 1387
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 3 with 1 rules applied. Total rules applied 353 place count 815 transition count 1386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 354 place count 814 transition count 1386
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 358 place count 810 transition count 1364
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 363 place count 809 transition count 1364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 365 place count 809 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 366 place count 808 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 367 place count 807 transition count 1354
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 807 transition count 1354
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 414 place count 784 transition count 1331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 416 place count 783 transition count 1334
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 417 place count 783 transition count 1333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 418 place count 782 transition count 1333
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 421 place count 782 transition count 1330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 424 place count 779 transition count 1330
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 428 place count 779 transition count 1330
Applied a total of 428 rules in 494 ms. Remains 779 /1016 variables (removed 237) and now considering 1330/1538 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 779/1016 places, 1330/1538 transitions.
RANDOM walk for 40000 steps (373 resets) in 581 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (94 resets) in 230 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (85 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (87 resets) in 279 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (88 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (81 resets) in 229 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (87 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (83 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (87 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (93 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (82 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (93 resets) in 136 ms. (292 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 151956 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 11
Probabilistic random walk after 151956 steps, saw 70658 distinct states, run finished after 3010 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 1330 rows 779 cols
[2025-05-30 03:59:44] [INFO ] Computed 143 invariants in 23 ms
[2025-05-30 03:59:44] [INFO ] State equation strengthened by 19 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/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 161/335 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 34/369 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 406/775 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 4/779 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/779 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1330/2109 variables, 779/922 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2109 variables, 19/941 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2109 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:48] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 20 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/2109 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2109 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/2109 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2109/2109 variables, and 942 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6365 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 779/779 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 11/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 161/335 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 34/369 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 406/775 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:51] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:51] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:51] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 31 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/775 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:59:52] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/775 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 4/779 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/779 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-04a-ReachabilityFireability-2025-01 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-04 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-06 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-09 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-10 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-11 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-12 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-13 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2025-14 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 1330/2109 variables, 779/927 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2109 variables, 19/946 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2109 variables, 1/947 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2109 variables, 0/947 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2109 variables, 0/947 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2109/2109 variables, and 947 constraints, problems are : Problem set: 9 solved, 2 unsolved in 14370 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 779/779 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20810ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 0 properties in 1168 ms.
Support contains 22 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1330/1330 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 777 transition count 1323
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 770 transition count 1323
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 16 place count 770 transition count 1311
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 47 place count 751 transition count 1311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 749 transition count 1299
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 749 transition count 1299
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 2 with 6 rules applied. Total rules applied 57 place count 746 transition count 1296
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 746 transition count 1294
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 67 place count 743 transition count 1289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 742 transition count 1288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 742 transition count 1286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 740 transition count 1286
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 740 transition count 1286
Applied a total of 75 rules in 247 ms. Remains 740 /779 variables (removed 39) and now considering 1286/1330 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 740/779 places, 1286/1330 transitions.
RANDOM walk for 40000 steps (449 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (101 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 268947 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 268947 steps, saw 111943 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
// Phase 1: matrix 1286 rows 740 cols
[2025-05-30 04:00:09] [INFO ] Computed 133 invariants in 24 ms
[2025-05-30 04:00:09] [INFO ] State equation strengthened by 22 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 153/249 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 477/726 variables, 90/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/740 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/740 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1286/2026 variables, 740/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2026 variables, 22/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2026 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2026 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2026/2026 variables, and 895 constraints, problems are : Problem set: 0 solved, 2 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 740/740 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 153/249 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 477/726 variables, 90/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:10] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/740 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1286/2026 variables, 740/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2026 variables, 22/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2026 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2026 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2026 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2026/2026 variables, and 897 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 740/740 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2544ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 460 ms.
Support contains 22 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1286/1286 transitions.
Applied a total of 0 rules in 34 ms. Remains 740 /740 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 740/740 places, 1286/1286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1286/1286 transitions.
Applied a total of 0 rules in 38 ms. Remains 740 /740 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
[2025-05-30 04:00:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:00:13] [INFO ] Implicit Places using invariants in 611 ms returned [1, 19, 20, 22, 32, 50, 68, 148, 161, 162, 163, 164, 165, 183, 201, 282, 295, 296, 297, 299, 317, 335, 416, 429, 434, 435, 436, 454, 472, 553, 558, 569, 570, 571, 572, 573, 606, 608, 611, 630, 631, 632, 644, 650, 656, 662, 668, 674, 680, 686, 692, 698, 704]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 626 ms to find 53 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 687/740 places, 1286/1286 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 687 transition count 1210
Reduce places removed 76 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 80 rules applied. Total rules applied 156 place count 611 transition count 1206
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 160 place count 607 transition count 1206
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 160 place count 607 transition count 1182
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 208 place count 583 transition count 1182
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 13 rules applied. Total rules applied 221 place count 576 transition count 1176
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 227 place count 570 transition count 1176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 227 place count 570 transition count 1175
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 569 transition count 1175
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 241 place count 557 transition count 1163
Iterating global reduction 5 with 12 rules applied. Total rules applied 253 place count 557 transition count 1163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 253 place count 557 transition count 1162
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 255 place count 556 transition count 1162
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 258 place count 553 transition count 1159
Iterating global reduction 5 with 3 rules applied. Total rules applied 261 place count 553 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 262 place count 552 transition count 1158
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 552 transition count 1158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 551 transition count 1157
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 551 transition count 1157
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 357 place count 505 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 360 place count 502 transition count 1108
Iterating global reduction 5 with 3 rules applied. Total rules applied 363 place count 502 transition count 1108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 366 place count 502 transition count 1105
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 369 place count 502 transition count 1102
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 373 place count 499 transition count 1101
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 388 place count 499 transition count 1086
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 405 place count 482 transition count 1086
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 415 place count 482 transition count 1086
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 482 transition count 1086
Applied a total of 417 rules in 273 ms. Remains 482 /687 variables (removed 205) and now considering 1086/1286 (removed 200) transitions.
// Phase 1: matrix 1086 rows 482 cols
[2025-05-30 04:00:13] [INFO ] Computed 71 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:00:14] [INFO ] Implicit Places using invariants in 606 ms returned [73, 91, 97, 103, 108, 160, 192, 198, 203, 204, 276, 282, 285, 287, 290, 297, 298, 354, 371, 377, 380, 382, 388, 468, 472, 476, 481]
[2025-05-30 04:00:14] [INFO ] Actually due to overlaps returned [388, 198, 203, 204, 103, 276, 282, 287, 371, 377, 382, 73, 91, 97, 160, 192, 290, 354, 468, 472, 476, 481]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 615 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 460/740 places, 1086/1286 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 460 transition count 1085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 459 transition count 1085
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 15 place count 446 transition count 1072
Iterating global reduction 2 with 13 rules applied. Total rules applied 28 place count 446 transition count 1072
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 441 transition count 1067
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 441 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 438 transition count 1064
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 438 transition count 1064
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 438 transition count 1062
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 3 with 14 rules applied. Total rules applied 60 place count 431 transition count 1055
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 430 transition count 1054
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 430 transition count 1054
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 71 place count 430 transition count 1045
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 80 place count 421 transition count 1045
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 421 transition count 1042
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 86 place count 418 transition count 1042
Applied a total of 86 rules in 115 ms. Remains 418 /460 variables (removed 42) and now considering 1042/1086 (removed 44) transitions.
// Phase 1: matrix 1042 rows 418 cols
[2025-05-30 04:00:14] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:00:14] [INFO ] Implicit Places using invariants in 630 ms returned [92, 260, 261]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 633 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 415/740 places, 1042/1286 transitions.
Applied a total of 0 rules in 35 ms. Remains 415 /415 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2337 ms. Remains : 415/740 places, 1042/1286 transitions.
RANDOM walk for 40000 steps (610 resets) in 595 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (163 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (158 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 435477 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 435477 steps, saw 163674 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
// Phase 1: matrix 1042 rows 415 cols
[2025-05-30 04:00:18] [INFO ] Computed 46 invariants in 7 ms
[2025-05-30 04:00:18] [INFO ] State equation strengthened by 4 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 22/132 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 281/413 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/415 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:18] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1042/1457 variables, 415/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1457 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1457 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1457 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1457/1457 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 415/415 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 22/132 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 281/413 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/415 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1042/1457 variables, 415/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1457 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1457 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1457 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1457 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1457/1457 variables, and 467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 415/415 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1827ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 645 ms.
Support contains 22 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1042/1042 transitions.
Applied a total of 0 rules in 22 ms. Remains 415 /415 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 415/415 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1042/1042 transitions.
Applied a total of 0 rules in 12 ms. Remains 415 /415 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2025-05-30 04:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:00:21] [INFO ] Implicit Places using invariants in 414 ms returned []
[2025-05-30 04:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:00:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 04:00:22] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 04:00:22] [INFO ] Redundant transitions in 63 ms returned []
Running 1041 sub problems to find dead transitions.
[2025-05-30 04:00:22] [INFO ] Invariant cache hit.
[2025-05-30 04:00:22] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (OVERLAPS) 1/415 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:48] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1457 variables, and 47 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/415 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (OVERLAPS) 1/415 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:06] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:09] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:10] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1457 variables, and 50 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/415 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1041 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60578ms problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61991 ms. Remains : 415/415 places, 1042/1042 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 415 /415 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Running SMT prover for 2 properties.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-30 04:01:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 04:01:22] [INFO ] [Real]Absence check using 11 positive place invariants in 79 ms returned sat
[2025-05-30 04:01:23] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 65 ms returned sat
[2025-05-30 04:01:23] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 04:01:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-05-30 04:01:23] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 11 ms returned sat
[2025-05-30 04:01:23] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:23] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 14 ms to minimize.
[2025-05-30 04:01:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
TRAPS : Iteration 1
[2025-05-30 04:01:24] [INFO ] After 887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 04:01:24] [INFO ] After 1141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-30 04:01:24] [INFO ] Flatten gal took : 57 ms
[2025-05-30 04:01:24] [INFO ] Flatten gal took : 43 ms
[2025-05-30 04:01:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5285147973468428267.gal : 9 ms
[2025-05-30 04:01:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5159555909034015411.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/ReachabilityCardinality5285147973468428267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5159555909034015411.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/ReachabilityCardinality5159555909034015411.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 49
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :49 after 379
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :379 after 26029
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :26029 after 325321
Reachability property ASLink-PT-04a-ReachabilityFireability-2025-02 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :325321 after 328145
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :328145 after 333951
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :333951 after 352022
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :352022 after 7.38832e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.38832e+06 after 4.43197e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.43197e+07 after 4.79246e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.79246e+08 after 3.9571e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.9571e+09 after 1.64403e+10
Detected timeout of ITS tools.
[2025-05-30 04:01:39] [INFO ] Flatten gal took : 72 ms
[2025-05-30 04:01:39] [INFO ] Applying decomposition
[2025-05-30 04:01:39] [INFO ] Flatten gal took : 62 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/graph3791069208624592021.txt' '-o' '/tmp/graph3791069208624592021.bin' '-w' '/tmp/graph3791069208624592021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3791069208624592021.bin' '-l' '-1' '-v' '-w' '/tmp/graph3791069208624592021.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:01:39] [INFO ] Decomposing Gal with order
[2025-05-30 04:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:01:40] [INFO ] Removed a total of 2157 redundant transitions.
[2025-05-30 04:01:40] [INFO ] Flatten gal took : 600 ms
[2025-05-30 04:01:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 47 ms.
[2025-05-30 04:01:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10200140230691406091.gal : 12 ms
[2025-05-30 04:01:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15775027260990310440.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/ReachabilityCardinality10200140230691406091.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15775027260990310440.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 ...309
Loading property file /tmp/ReachabilityCardinality15775027260990310440.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 :11 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 91
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :91 after 687
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :687 after 3.01925e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.72945e+07 after 2.04617e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.04617e+08 after 8.08626e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.08626e+08 after 4.31854e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.51378e+09 after 6.70534e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.70534e+09 after 1.01727e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 33094 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 04:01:55] [INFO ] Flatten gal took : 49 ms
[2025-05-30 04:01:55] [INFO ] Applying decomposition
[2025-05-30 04:01:55] [INFO ] Flatten gal took : 48 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/graph924454243231819080.txt' '-o' '/tmp/graph924454243231819080.bin' '-w' '/tmp/graph924454243231819080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph924454243231819080.bin' '-l' '-1' '-v' '-w' '/tmp/graph924454243231819080.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:01:56] [INFO ] Decomposing Gal with order
[2025-05-30 04:01:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:01:56] [INFO ] Removed a total of 2156 redundant transitions.
[2025-05-30 04:01:56] [INFO ] Flatten gal took : 115 ms
[2025-05-30 04:01:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 40 ms.
[2025-05-30 04:01:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14803716354389262403.gal : 29 ms
[2025-05-30 04:01:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5487336814755787226.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/ReachabilityCardinality14803716354389262403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5487336814755787226.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 ...308
Loading property file /tmp/ReachabilityCardinality5487336814755787226.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :64 after 2.65896e+12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.65896e+12 after 7.66456e+13
Reachability property ASLink-PT-04a-ReachabilityFireability-2025-02 is true.
FORMULA ASLink-PT-04a-ReachabilityFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7.66456e+13 after 1.64599e+14
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.64599e+14 after 3.82352e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.82352e+14 after 7.16732e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.16732e+14 after 1.42535e+15
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.15853e+15 after 1.44438e+16
Detected timeout of ITS tools.
[2025-05-30 04:31:56] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3869800728546248883
[2025-05-30 04:31:56] [INFO ] Applying decomposition
[2025-05-30 04:31:56] [INFO ] Flatten gal took : 33 ms
[2025-05-30 04:31:56] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2025-05-30 04:31:56] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 04:31:56] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2025-05-30 04:31:56] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1156612295442185461.txt' '-o' '/tmp/graph1156612295442185461.bin' '-w' '/tmp/graph1156612295442185461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1156612295442185461.bin' '-l' '-1' '-v' '-w' '/tmp/graph1156612295442185461.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:31:56] [INFO ] Decomposing Gal with order
[2025-05-30 04:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:31:56] [INFO ] Removed a total of 2192 redundant transitions.
[2025-05-30 04:31:56] [INFO ] Flatten gal took : 76 ms
[2025-05-30 04:31:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 11 ms.
[2025-05-30 04:31:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6146652380126090888.gal : 23 ms
[2025-05-30 04:31:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5810691244454330548.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/ReachabilityFireability6146652380126090888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5810691244454330548.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/ReachabilityFireability5810691244454330548.prop.
[2025-05-30 04:31:56] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
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 :12 after 73
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :73 after 127
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :127 after 911
[2025-05-30 04:31:56] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 04:31:56] [INFO ] Built C files in 410ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3869800728546248883
Running compilation step : cd /tmp/ltsmin3869800728546248883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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,1 properties remain. new max is 64
SDD size :1.91395e+07 after 2.06457e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.06457e+08 after 2.09064e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.09064e+08 after 7.66859e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.66859e+08 after 2.93074e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.93074e+09 after 5.27758e+09
Compilation finished in 3484 ms.
Running link step : cd /tmp/ltsmin3869800728546248883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin3869800728546248883;'/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' 'ASLinkPT04aReachabilityFireability202505==true'
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.60766e+09 after 2.37057e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.45058e+11 after 2.23574e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.84238e+11 after 9.84023e+11

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="ASLink-PT-04a"
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 ASLink-PT-04a, 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 r002-tall-174853729100335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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