Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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 279K 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-02a-ReachabilityFireability-2025-00
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-01
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-02
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-03
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-04
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-05
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-06
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-07
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-08
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-09
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-10
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-11
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-12
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-13
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-14
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748567872834

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-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 01:17:54] [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 01:17:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:17:54] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-05-30 01:17:54] [INFO ] Transformed 626 places.
[2025-05-30 01:17:54] [INFO ] Transformed 1008 transitions.
[2025-05-30 01:17:54] [INFO ] Found NUPN structural information;
[2025-05-30 01:17:54] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (453 resets) in 1485 ms. (26 steps per ms) remains 10/16 properties
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (124 resets) in 424 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (138 resets) in 954 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (131 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
[2025-05-30 01:17:55] [INFO ] Flatten gal took : 432 ms
BEST_FIRST walk for 40003 steps (133 resets) in 319 ms. (125 steps per ms) remains 10/10 properties
[2025-05-30 01:17:55] [INFO ] Flatten gal took : 98 ms
BEST_FIRST walk for 40003 steps (120 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
[2025-05-30 01:17:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6242624310847201880.gal : 69 ms
[2025-05-30 01:17:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3008141467087721850.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6242624310847201880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3008141467087721850.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (131 resets) in 342 ms. (116 steps per ms) remains 10/10 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (126 resets) in 621 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (137 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality3008141467087721850.prop.
BEST_FIRST walk for 40003 steps (131 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (105 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
// Phase 1: matrix 998 rows 626 cols
[2025-05-30 01:17:56] [INFO ] Computed 118 invariants in 42 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 29
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :39 after 64
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :64 after 189
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :189 after 3199
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :3199 after 577401
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 233/233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 97/330 variables, 28/261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 97/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2025-01 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2025-04 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2025-11 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2025-12 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 289/619 variables, 85/444 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 289/733 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 0/733 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/626 variables, 4/737 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 7/744 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 0/744 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 998/1624 variables, 626/1370 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1624/1624 variables, and 1370 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5038 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 10/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 116/257 variables, 28/169 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 116/285 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:01] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/286 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/286 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 362/619 variables, 86/372 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 362/734 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:02] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:03] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:03] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 3/737 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 0/737 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 7/626 variables, 4/741 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 7/748 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 0/748 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1624/1624 variables, and 1374 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5007 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10213ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 141 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 616 transition count 963
Reduce places removed 35 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 42 rules applied. Total rules applied 87 place count 581 transition count 956
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 574 transition count 956
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 94 place count 574 transition count 920
Deduced a syphon composed of 36 places in 3 ms
Ensure Unique test removed 10 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 176 place count 528 transition count 920
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 526 transition count 918
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 525 transition count 918
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 186 place count 524 transition count 914
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 188 place count 522 transition count 914
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :577401 after 1.93815e+06
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 204 place count 514 transition count 906
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 514 transition count 904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 208 place count 512 transition count 904
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 209 place count 512 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 210 place count 511 transition count 903
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 212 place count 511 transition count 903
Applied a total of 212 rules in 277 ms. Remains 511 /626 variables (removed 115) and now considering 903/998 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 511/626 places, 903/998 transitions.
RANDOM walk for 40000 steps (591 resets) in 575 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (194 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (172 resets) in 576 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (200 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (166 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (188 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (202 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 225701 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 6
Probabilistic random walk after 225701 steps, saw 105423 distinct states, run finished after 3005 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 903 rows 511 cols
[2025-05-30 01:18:10] [INFO ] Computed 96 invariants in 35 ms
[2025-05-30 01:18:10] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/260 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 249/509 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/511 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 903/1414 variables, 511/607 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 10/617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1414 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1414 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 617 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 511/511 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/260 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 249/509 variables, 68/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:13] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:13] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:13] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:14] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/511 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2025-00 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2025-05 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2025-07 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2025-09 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 903/1414 variables, 511/612 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1414 variables, 10/622 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 01:18:18] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1414 variables, 1/623 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1414 variables, 0/623 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1414 variables, 0/623 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 623 constraints, problems are : Problem set: 4 solved, 2 unsolved in 6451 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 511/511 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8874ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 655 ms.
Support contains 87 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 903/903 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 2 place count 510 transition count 902
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 4 place count 509 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 508 transition count 901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 5 place count 508 transition count 897
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 15 place count 502 transition count 897
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 501 transition count 891
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 501 transition count 891
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 500 transition count 890
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 500 transition count 889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 499 transition count 889
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 23 place count 499 transition count 889
Applied a total of 23 rules in 124 ms. Remains 499 /511 variables (removed 12) and now considering 889/903 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 499/511 places, 889/903 transitions.
RANDOM walk for 40000 steps (586 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (173 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (169 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 324417 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 324417 steps, saw 136064 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 889 rows 499 cols
[2025-05-30 01:18:23] [INFO ] Computed 93 invariants in 7 ms
[2025-05-30 01:18:23] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/190 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 306/496 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/499 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 889/1388 variables, 499/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1388 variables, 10/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1388 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1388 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1388/1388 variables, and 602 constraints, problems are : Problem set: 0 solved, 2 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 499/499 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/0 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/190 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 306/496 variables, 66/90 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 01:18:24] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/499 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 889/1388 variables, 499/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1388 variables, 10/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1388 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1388 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1388/1388 variables, and 603 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3127 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 499/499 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3946ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 513 ms.
Support contains 87 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 889/889 transitions.
Applied a total of 0 rules in 23 ms. Remains 499 /499 variables (removed 0) and now considering 889/889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 499/499 places, 889/889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 889/889 transitions.
Applied a total of 0 rules in 16 ms. Remains 499 /499 variables (removed 0) and now considering 889/889 (removed 0) transitions.
[2025-05-30 01:18:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:28] [INFO ] Implicit Places using invariants in 558 ms returned [1, 19, 20, 22, 32, 50, 68, 105, 133, 154, 169, 170, 171, 172, 192, 210, 262, 278, 306, 317, 320, 322, 357, 359, 362, 380, 381, 382, 383, 396, 402, 408, 414, 420, 426, 438, 444, 450, 456]
[2025-05-30 01:18:28] [INFO ] Actually due to overlaps returned [357, 322, 32, 50, 192, 362, 172, 381, 171, 320, 359, 380, 1, 170, 19, 20, 68, 169, 210, 317, 383, 426, 444, 456, 22, 154, 306, 382, 396, 402, 408, 414, 420, 438, 450]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 580 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/499 places, 889/889 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 461 transition count 853
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 425 transition count 847
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 419 transition count 847
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 87 place count 419 transition count 836
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 110 place count 407 transition count 836
Discarding 3 places :
Implicit places reduction removed 3 places
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 4 rules applied. Total rules applied 114 place count 404 transition count 835
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 403 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 402 transition count 834
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 117 place count 402 transition count 833
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 119 place count 401 transition count 833
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 129 place count 391 transition count 823
Iterating global reduction 6 with 10 rules applied. Total rules applied 139 place count 391 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 139 place count 391 transition count 822
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 141 place count 390 transition count 822
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 143 place count 388 transition count 820
Iterating global reduction 6 with 2 rules applied. Total rules applied 145 place count 388 transition count 820
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 193 place count 364 transition count 796
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 194 place count 363 transition count 795
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 363 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 196 place count 363 transition count 794
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 197 place count 363 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 198 place count 362 transition count 793
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 202 place count 362 transition count 789
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 206 place count 358 transition count 789
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 216 place count 358 transition count 789
Applied a total of 216 rules in 250 ms. Remains 358 /464 variables (removed 106) and now considering 789/889 (removed 100) transitions.
// Phase 1: matrix 789 rows 358 cols
[2025-05-30 01:18:28] [INFO ] Computed 51 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:29] [INFO ] Implicit Places using invariants in 518 ms returned [73, 95, 111, 218, 221, 237, 330, 334, 338, 354]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 520 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/499 places, 789/889 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 348 transition count 784
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 343 transition count 784
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 339 transition count 777
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 339 transition count 777
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 336 transition count 774
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 336 transition count 774
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 336 transition count 771
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 3 with 6 rules applied. Total rules applied 33 place count 333 transition count 768
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 332 transition count 767
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 332 transition count 767
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 332 transition count 765
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 330 transition count 765
Applied a total of 39 rules in 99 ms. Remains 330 /348 variables (removed 18) and now considering 765/789 (removed 24) transitions.
// Phase 1: matrix 765 rows 330 cols
[2025-05-30 01:18:29] [INFO ] Computed 41 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:29] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-05-30 01:18:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:18:30] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 330/499 places, 765/889 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2394 ms. Remains : 330/499 places, 765/889 transitions.
RANDOM walk for 40000 steps (595 resets) in 455 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (185 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (216 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 475215 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 2
Probabilistic random walk after 475215 steps, saw 153973 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2025-05-30 01:18:33] [INFO ] Invariant cache hit.
[2025-05-30 01:18:33] [INFO ] State equation strengthened by 4 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/143 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/330 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 765/1095 variables, 330/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1095 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1095 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1095 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 330/330 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/143 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/330 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 765/1095 variables, 330/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1095 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1095 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1095 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 330/330 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2361ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 378 ms.
Support contains 87 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 765/765 transitions.
Applied a total of 0 rules in 9 ms. Remains 330 /330 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 330/330 places, 765/765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 765/765 transitions.
Applied a total of 0 rules in 10 ms. Remains 330 /330 variables (removed 0) and now considering 765/765 (removed 0) transitions.
[2025-05-30 01:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:36] [INFO ] Implicit Places using invariants in 423 ms returned []
[2025-05-30 01:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:18:37] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:18:37] [INFO ] Redundant transitions in 54 ms returned []
Running 764 sub problems to find dead transitions.
[2025-05-30 01:18:37] [INFO ] Invariant cache hit.
[2025-05-30 01:18:37] [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/329 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 2 (OVERLAPS) 1/330 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:55] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:56] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:56] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:57] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:58] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:00] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:00] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 11 ms to minimize.
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:01] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 19 ms to minimize.
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD636 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:01] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 11 ms to minimize.
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD745 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 9/50 constraints. Problems are: Problem set: 13 solved, 751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 330/1095 variables, and 50 constraints, problems are : Problem set: 13 solved, 751 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/330 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 751 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 24/24 constraints. Problems are: Problem set: 13 solved, 751 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 0/24 constraints. Problems are: Problem set: 13 solved, 751 unsolved
At refinement iteration 2 (OVERLAPS) 2/330 variables, 9/33 constraints. Problems are: Problem set: 13 solved, 751 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 8/41 constraints. Problems are: Problem set: 13 solved, 751 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 9/50 constraints. Problems are: Problem set: 13 solved, 751 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/50 constraints. Problems are: Problem set: 13 solved, 751 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1.93815e+06 after 1.9723e+06
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 6 (OVERLAPS) 765/1095 variables, 330/380 constraints. Problems are: Problem set: 133 solved, 631 unsolved
SMT process timed out in 60318ms, After SMT, problems are : Problem set: 133 solved, 631 unsolved
Search for dead transitions found 133 dead transitions in 60331ms
Found 133 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 133 transitions
Dead transitions reduction (with SMT) removed 133 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 330/330 places, 632/765 transitions.
Graph (complete) has 1540 edges and 330 vertex of which 329 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 13 places
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 14 rules applied. Total rules applied 15 place count 316 transition count 631
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 315 transition count 629
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 313 transition count 629
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 313 transition count 628
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 312 transition count 628
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 312 transition count 628
Applied a total of 23 rules in 25 ms. Remains 312 /330 variables (removed 18) and now considering 628/632 (removed 4) transitions.
// Phase 1: matrix 628 rows 312 cols
[2025-05-30 01:19:37] [INFO ] Computed 44 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:38] [INFO ] Implicit Places using invariants in 354 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 311/330 places, 628/765 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 311 transition count 625
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 308 transition count 625
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 308 transition count 624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 307 transition count 624
Applied a total of 8 rules in 16 ms. Remains 307 /311 variables (removed 4) and now considering 624/628 (removed 4) transitions.
// Phase 1: matrix 624 rows 307 cols
[2025-05-30 01:19:38] [INFO ] Computed 43 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:38] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-05-30 01:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:19:38] [INFO ] Implicit Places using invariants and state equation in 445 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 746 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 306/330 places, 624/765 transitions.
Applied a total of 0 rules in 19 ms. Remains 306 /306 variables (removed 0) and now considering 624/624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 62543 ms. Remains : 306/330 places, 624/765 transitions.
RANDOM walk for 40000 steps (607 resets) in 273 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (167 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (219 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 590745 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 2
Probabilistic random walk after 590745 steps, saw 181942 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
// Phase 1: matrix 624 rows 306 cols
[2025-05-30 01:19:42] [INFO ] Computed 42 invariants in 8 ms
[2025-05-30 01:19:42] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/157 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/301 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 624/925 variables, 301/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/930 variables, 5/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/930 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/930 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 930/930 variables, and 352 constraints, problems are : Problem set: 0 solved, 2 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 306/306 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/157 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/14 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 01:19:42] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 144/301 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 624/925 variables, 301/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/930 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/930 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/930 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 930/930 variables, and 354 constraints, problems are : Problem set: 0 solved, 2 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 306/306 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1554ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 819 ms.
Support contains 87 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 624/624 transitions.
Applied a total of 0 rules in 8 ms. Remains 306 /306 variables (removed 0) and now considering 624/624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 306/306 places, 624/624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 624/624 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 624/624 (removed 0) transitions.
[2025-05-30 01:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:44] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 01:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:19:45] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:19:45] [INFO ] Redundant transitions in 8 ms returned []
Running 623 sub problems to find dead transitions.
[2025-05-30 01:19:45] [INFO ] Invariant cache hit.
[2025-05-30 01:19:45] [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/305 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (OVERLAPS) 1/306 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:59] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:01] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 3/45 constraints. Problems are: Problem set: 7 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/45 constraints. Problems are: Problem set: 7 solved, 616 unsolved
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 6 (OVERLAPS) 624/930 variables, 306/351 constraints. Problems are: Problem set: 56 solved, 567 unsolved
SMT process timed out in 30161ms, After SMT, problems are : Problem set: 56 solved, 567 unsolved
Search for dead transitions found 56 dead transitions in 30162ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/306 places, 568/624 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 304 transition count 567
Applied a total of 3 rules in 11 ms. Remains 304 /306 variables (removed 2) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 304 cols
[2025-05-30 01:20:15] [INFO ] Computed 42 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:15] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-05-30 01:20:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:20:16] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 304/306 places, 567/624 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31582 ms. Remains : 304/306 places, 567/624 transitions.
RANDOM walk for 40000 steps (582 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (195 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (227 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 599590 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 2
Probabilistic random walk after 599590 steps, saw 184076 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2025-05-30 01:20:19] [INFO ] Invariant cache hit.
[2025-05-30 01:20:19] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 61/148 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 156/304 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 567/871 variables, 304/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/871 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/871 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/871 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 871/871 variables, and 350 constraints, problems are : Problem set: 0 solved, 2 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 304/304 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 61/148 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 156/304 variables, 30/42 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 01:20:19] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 567/871 variables, 304/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/871 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/871 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 871/871 variables, and 351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 304/304 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1292ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 326 ms.
Support contains 87 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 567/567 transitions.
Applied a total of 0 rules in 11 ms. Remains 304 /304 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 304/304 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 567/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 304 /304 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2025-05-30 01:20:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:21] [INFO ] Implicit Places using invariants in 380 ms returned []
[2025-05-30 01:20:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:20:21] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:20:21] [INFO ] Redundant transitions in 3 ms returned []
Running 566 sub problems to find dead transitions.
[2025-05-30 01:20:21] [INFO ] Invariant cache hit.
[2025-05-30 01:20:21] [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/303 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:33] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:33] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 6 (OVERLAPS) 567/871 variables, 304/348 constraints. Problems are: Problem set: 48 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/871 variables, 4/352 constraints. Problems are: Problem set: 48 solved, 518 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/871 variables, and 352 constraints, problems are : Problem set: 48 solved, 518 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 304/304 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 518 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 19/19 constraints. Problems are: Problem set: 48 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/19 constraints. Problems are: Problem set: 48 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 10/29 constraints. Problems are: Problem set: 48 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 13/42 constraints. Problems are: Problem set: 48 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 2/44 constraints. Problems are: Problem set: 48 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/44 constraints. Problems are: Problem set: 48 solved, 518 unsolved
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 6 (OVERLAPS) 567/871 variables, 304/348 constraints. Problems are: Problem set: 272 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/871 variables, 4/352 constraints. Problems are: Problem set: 272 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/871 variables, 294/646 constraints. Problems are: Problem set: 272 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/871 variables, and 646 constraints, problems are : Problem set: 272 solved, 294 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 304/304 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 294/566 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 272 solved, 294 unsolved
Search for dead transitions found 272 dead transitions in 60147ms
Found 272 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 272 transitions
Dead transitions reduction (with SMT) removed 272 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/304 places, 295/567 transitions.
Ensure Unique test removed 12 places
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 13 rules applied. Total rules applied 13 place count 292 transition count 294
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 291 transition count 292
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 289 transition count 292
Applied a total of 18 rules in 19 ms. Remains 289 /304 variables (removed 15) and now considering 292/295 (removed 3) transitions.
// Phase 1: matrix 292 rows 289 cols
[2025-05-30 01:21:21] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:22] [INFO ] Implicit Places using invariants in 291 ms returned [95, 98, 100]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 293 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 286/304 places, 292/567 transitions.
Applied a total of 0 rules in 6 ms. Remains 286 /286 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 61329 ms. Remains : 286/304 places, 292/567 transitions.
RANDOM walk for 40000 steps (602 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (167 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (214 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 845437 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 2
Probabilistic random walk after 845437 steps, saw 240803 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
// Phase 1: matrix 292 rows 286 cols
[2025-05-30 01:21:25] [INFO ] Computed 54 invariants in 1 ms
[2025-05-30 01:21:25] [INFO ] State equation strengthened by 4 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 62/149 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/286 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 292/578 variables, 286/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/578 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 344 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 286/286 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 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 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 62/149 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/286 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 292/578 variables, 286/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/578 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 344 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 286/286 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 791ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 58 ms.
Support contains 38 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 292/292 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 283 transition count 275
Reduce places removed 17 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 266 transition count 271
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 262 transition count 271
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 45 place count 262 transition count 265
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 59 place count 254 transition count 265
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 60 place count 254 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 253 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 65 place count 251 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 251 transition count 260
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 251 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 250 transition count 259
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 72 place count 250 transition count 256
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 75 place count 247 transition count 256
Applied a total of 75 rules in 27 ms. Remains 247 /286 variables (removed 39) and now considering 256/292 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 247/286 places, 256/292 transitions.
RANDOM walk for 40000 steps (689 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (201 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1504606 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :0 out of 1
Probabilistic random walk after 1504606 steps, saw 444542 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :0
// Phase 1: matrix 256 rows 247 cols
[2025-05-30 01:21:29] [INFO ] Computed 49 invariants in 8 ms
[2025-05-30 01:21:29] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 59/97 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/100 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 140/240 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/247 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 256/503 variables, 247/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 247/247 constraints, ReadFeed: 4/4 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 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 59/97 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/100 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 140/240 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/247 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 256/503 variables, 247/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 247/247 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 38 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 247 /247 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 247/247 places, 256/256 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 247 /247 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-05-30 01:21:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:30] [INFO ] Implicit Places using invariants in 517 ms returned [54, 68, 69, 70, 73, 74, 76, 77, 78, 170, 246]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 519 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 236/247 places, 256/256 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 254
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 7 rules applied. Total rules applied 9 place count 234 transition count 249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 14 place count 229 transition count 249
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 229 transition count 247
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 227 transition count 247
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 225 transition count 245
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 225 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 224 transition count 244
Applied a total of 24 rules in 24 ms. Remains 224 /236 variables (removed 12) and now considering 244/256 (removed 12) transitions.
// Phase 1: matrix 244 rows 224 cols
[2025-05-30 01:21:30] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:30] [INFO ] Implicit Places using invariants in 122 ms returned [142, 144]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 222/247 places, 244/256 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 221 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 243
Applied a total of 2 rules in 5 ms. Remains 221 /222 variables (removed 1) and now considering 243/244 (removed 1) transitions.
// Phase 1: matrix 243 rows 221 cols
[2025-05-30 01:21:30] [INFO ] Computed 36 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:30] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-30 01:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:30] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 221/247 places, 243/256 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1041 ms. Remains : 221/247 places, 243/256 transitions.
RANDOM walk for 40000 steps (752 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (233 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1649077 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :0 out of 1
Probabilistic random walk after 1649077 steps, saw 408863 distinct states, run finished after 3001 ms. (steps per millisecond=549 ) properties seen :0
[2025-05-30 01:21:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 67/105 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/220 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/221 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 243/464 variables, 221/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/464 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 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 165.0 s and query timeout 16500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 67/105 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/220 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/221 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 243/464 variables, 221/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/464 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 38 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 243/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 221 /221 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 221/221 places, 243/243 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 243/243 transitions.
Applied a total of 0 rules in 2 ms. Remains 221 /221 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2025-05-30 01:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:34] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-30 01:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:34] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:21:34] [INFO ] Redundant transitions in 1 ms returned []
Running 242 sub problems to find dead transitions.
[2025-05-30 01:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:38] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:39] [INFO ] Deduced a trap composed of 19 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 01:21:39] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/464 variables, 221/260 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:44] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/464 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 261 constraints, problems are : Problem set: 0 solved, 242 unsolved in 19580 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/464 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 242/503 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:03] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 504 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49633ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 49634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50139 ms. Remains : 221/221 places, 243/243 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 01:22:24] [INFO ] Flatten gal took : 53 ms
[2025-05-30 01:22:24] [INFO ] Applying decomposition
[2025-05-30 01:22:24] [INFO ] Flatten gal took : 49 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/graph140715828145072358.txt' '-o' '/tmp/graph140715828145072358.bin' '-w' '/tmp/graph140715828145072358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph140715828145072358.bin' '-l' '-1' '-v' '-w' '/tmp/graph140715828145072358.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:22:24] [INFO ] Decomposing Gal with order
[2025-05-30 01:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:22:25] [INFO ] Removed a total of 1487 redundant transitions.
[2025-05-30 01:22:25] [INFO ] Flatten gal took : 210 ms
[2025-05-30 01:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 53 ms.
[2025-05-30 01:22:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16418083850406474218.gal : 26 ms
[2025-05-30 01:22:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5286419389426352506.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/ReachabilityCardinality16418083850406474218.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5286419389426352506.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/ReachabilityCardinality5286419389426352506.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 4.3967e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4.3967e+06 after 1.26166e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.26166e+07 after 8.5449e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.5449e+07 after 1.95553e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.95553e+08 after 5.58934e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.27687e+08 after 5.05017e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.4778e+10 after 9.96945e+10
Reachability property ASLink-PT-02a-ReachabilityFireability-2025-02 is true.
FORMULA ASLink-PT-02a-ReachabilityFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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\_mod\_flat,7.22819e+12,69.2306,1343312,15439,2423,2.07607e+06,42966,1908,5.77226e+06,388,303319,0
Total reachable state count : 7228191348850

Verifying 1 reachability properties.
Reachability property ASLink-PT-02a-ReachabilityFireability-2025-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-02a-ReachabilityFireability-2025-02,12,69.8508,1343312,203,109,2.07607e+06,42966,2111,5.77226e+06,422,303319,0
All properties solved without resorting to model-checking.
Total runtime 341288 ms.

BK_STOP 1748568215416

--------------------
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-02a"
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-02a, 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-174853729000303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;