Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1020K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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.8K 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 597K 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-06a-ReachabilityFireability-2025-00
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-01
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-02
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-03
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-04
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-05
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-06
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-07
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-08
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-09
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-10
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-11
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-12
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-13
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-14
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748588680175

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 07:04:41] [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 07:04:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 07:04:41] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-05-30 07:04:41] [INFO ] Transformed 1406 places.
[2025-05-30 07:04:41] [INFO ] Transformed 2100 transitions.
[2025-05-30 07:04:41] [INFO ] Found NUPN structural information;
[2025-05-30 07:04:42] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 994 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 22 transitions
Reduce redundant transitions removed 22 transitions.
RANDOM walk for 40000 steps (223 resets) in 2022 ms. (19 steps per ms) remains 11/16 properties
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (28 resets) in 349 ms. (114 steps per ms) remains 11/11 properties
[2025-05-30 07:04:43] [INFO ] Flatten gal took : 308 ms
BEST_FIRST walk for 40003 steps (28 resets) in 283 ms. (140 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (28 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (28 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
[2025-05-30 07:04:43] [INFO ] Flatten gal took : 266 ms
BEST_FIRST walk for 40004 steps (29 resets) in 486 ms. (82 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 307 ms. (129 steps per ms) remains 11/11 properties
[2025-05-30 07:04:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15129110267500587787.gal : 106 ms
[2025-05-30 07:04:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8475027730360541159.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/ReachabilityCardinality15129110267500587787.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8475027730360541159.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (33 resets) in 247 ms. (161 steps per ms) remains 11/11 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (20 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 305 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (29 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 276 ms. (144 steps per ms) remains 11/11 properties
// Phase 1: matrix 2078 rows 1406 cols
Loading property file /tmp/ReachabilityCardinality8475027730360541159.prop.
[2025-05-30 07:04:44] [INFO ] Computed 270 invariants in 94 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 84/217 variables, 17/150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 84/234 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 184/401 variables, 49/283 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 184/467 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :14 after 20
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :20 after 38
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :38 after 64
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :64 after 267
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :267 after 5399
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :5399 after 40350
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :40350 after 4.47131e+11
At refinement iteration 8 (OVERLAPS) 978/1379 variables, 195/662 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :4.47131e+11 after 6.89325e+17
At refinement iteration 9 (INCLUDED_ONLY) 0/1379 variables, 978/1640 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1379 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 27/1406 variables, 9/1649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5231ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 23 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1371 transition count 1976
Reduce places removed 102 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 106 rules applied. Total rules applied 243 place count 1269 transition count 1972
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 247 place count 1265 transition count 1972
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 247 place count 1265 transition count 1850
Deduced a syphon composed of 122 places in 4 ms
Ensure Unique test removed 44 places
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 535 place count 1099 transition count 1850
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 535 place count 1099 transition count 1849
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 537 place count 1098 transition count 1849
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 545 place count 1090 transition count 1821
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 554 place count 1089 transition count 1821
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 557 place count 1089 transition count 1818
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 558 place count 1088 transition count 1818
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 558 place count 1088 transition count 1816
Deduced a syphon composed of 2 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 563 place count 1085 transition count 1816
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 10 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 639 place count 1047 transition count 1778
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 647 place count 1047 transition count 1770
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 655 place count 1039 transition count 1770
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 660 place count 1039 transition count 1770
Applied a total of 660 rules in 641 ms. Remains 1039 /1406 variables (removed 367) and now considering 1770/2078 (removed 308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 657 ms. Remains : 1039/1406 places, 1770/2078 transitions.
RANDOM walk for 40000 steps (331 resets) in 408 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (53 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (52 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (61 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (61 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (60 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (53 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (58 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (51 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 121434 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 11
Probabilistic random walk after 121434 steps, saw 59255 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1770 rows 1039 cols
[2025-05-30 07:04:53] [INFO ] Computed 189 invariants in 31 ms
[2025-05-30 07:04:53] [INFO ] State equation strengthened by 33 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/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 112/245 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 140/385 variables, 35/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 637/1022 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1022 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 17/1039 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1039 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1770/2809 variables, 1039/1228 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 33/1261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2809 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:04:57] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:04:57] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 11 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/2809 variables, 2/1263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2809 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/2809 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2809/2809 variables, and 1263 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6497 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 134/134 constraints, State Equation: 1039/1039 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 11/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 112/245 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 140/385 variables, 35/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 637/1022 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1022 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1022 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 17/1039 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1039 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-06a-ReachabilityFireability-2025-00 is UNSAT
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06a-ReachabilityFireability-2025-06 is UNSAT
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06a-ReachabilityFireability-2025-13 is UNSAT
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06a-ReachabilityFireability-2025-14 is UNSAT
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 1770/2809 variables, 1039/1230 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem ASLink-PT-06a-ReachabilityFireability-2025-08 is UNSAT
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06a-ReachabilityFireability-2025-08 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/2809 variables, 33/1263 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2809 variables, 4/1267 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2809 variables, 0/1267 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/2809 variables, 0/1267 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2809/2809 variables, and 1267 constraints, problems are : Problem set: 5 solved, 6 unsolved in 21541 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 134/134 constraints, State Equation: 1039/1039 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28120ms problems are : Problem set: 5 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9717 ms.
Support contains 71 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 1770/1770 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 1039 transition count 1768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1037 transition count 1768
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 1037 transition count 1763
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 17 place count 1029 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 1028 transition count 1754
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 1028 transition count 1754
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 1026 transition count 1752
Applied a total of 23 rules in 198 ms. Remains 1026 /1039 variables (removed 13) and now considering 1752/1770 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 1026/1039 places, 1752/1770 transitions.
RANDOM walk for 40000 steps (359 resets) in 365 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (56 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (59 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (58 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 250419 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 6
Probabilistic random walk after 250419 steps, saw 49424 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 1752 rows 1026 cols
[2025-05-30 07:05:35] [INFO ] Computed 186 invariants in 21 ms
[2025-05-30 07:05:35] [INFO ] State equation strengthened by 34 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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 225/345 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 644/989 variables, 122/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 37/1026 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1752/2778 variables, 1026/1212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2778 variables, 34/1246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2778 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/2778 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2778/2778 variables, and 1246 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2124 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1026/1026 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 6/4 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 225/345 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 644/989 variables, 122/178 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 07:05:37] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:05:38] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 2/180 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 07:05:38] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 1/181 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 07:05:39] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 41 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/989 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/989 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 37/1026 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1026 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1752/2778 variables, 1026/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2778 variables, 34/1250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2778 variables, 4/1254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2778 variables, 0/1254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2778 variables, 0/1254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2778/2778 variables, and 1254 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10867 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1026/1026 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13043ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 15907 ms.
Support contains 11 out of 1026 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 1752/1752 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1025 transition count 1747
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1020 transition count 1746
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 1019 transition count 1746
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 1019 transition count 1744
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 1015 transition count 1744
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 22 place count 1012 transition count 1724
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 1012 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 1011 transition count 1716
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 1011 transition count 1716
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 1010 transition count 1708
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 1010 transition count 1708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 1009 transition count 1700
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 1009 transition count 1700
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 1008 transition count 1692
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 1008 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 1007 transition count 1684
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 1007 transition count 1684
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 1006 transition count 1676
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 1006 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 1005 transition count 1668
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 1005 transition count 1668
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 1004 transition count 1660
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 1004 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 1003 transition count 1652
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 1003 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 1002 transition count 1644
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 1002 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 1001 transition count 1636
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 1001 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 1000 transition count 1628
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 1000 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 999 transition count 1620
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 999 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 998 transition count 1612
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 998 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 997 transition count 1604
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 997 transition count 1604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 995 transition count 1602
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 995 transition count 1601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 994 transition count 1601
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 63 place count 994 transition count 1601
Applied a total of 63 rules in 1008 ms. Remains 994 /1026 variables (removed 32) and now considering 1601/1752 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1008 ms. Remains : 994/1026 places, 1601/1752 transitions.
RANDOM walk for 40000 steps (391 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (56 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 225507 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 4
Probabilistic random walk after 225507 steps, saw 64552 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 1601 rows 994 cols
[2025-05-30 07:06:08] [INFO ] Computed 183 invariants in 16 ms
[2025-05-30 07:06:08] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 223/244 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 707/951 variables, 121/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 43/994 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/994 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1601/2595 variables, 994/1177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 37/1214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2595 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2595 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 1214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 133/133 constraints, State Equation: 994/994 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 223/244 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 707/951 variables, 121/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 43/994 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/994 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1601/2595 variables, 994/1177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 37/1214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2595 variables, 4/1218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2595 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2595 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 1218 constraints, problems are : Problem set: 0 solved, 4 unsolved in 13669 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 133/133 constraints, State Equation: 994/994 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15408ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4268 ms.
Support contains 11 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 1601/1601 transitions.
Applied a total of 0 rules in 38 ms. Remains 994 /994 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 994/994 places, 1601/1601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 1601/1601 transitions.
Applied a total of 0 rules in 36 ms. Remains 994 /994 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2025-05-30 07:06:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:28] [INFO ] Implicit Places using invariants in 892 ms returned [1, 19, 20, 22, 32, 50, 68, 148, 161, 162, 163, 164, 165, 183, 201, 282, 297, 298, 299, 300, 318, 336, 416, 429, 430, 431, 432, 433, 451, 469, 554, 567, 568, 570, 571, 589, 607, 687, 700, 701, 702, 703, 704, 722, 740, 820, 825, 836, 837, 838, 839, 840, 858, 860, 863, 881, 882, 883, 884, 896, 902, 908, 914, 920, 926, 932, 940, 946, 952, 958]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 903 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 924/994 places, 1601/1601 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 924 transition count 1490
Reduce places removed 111 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 117 rules applied. Total rules applied 228 place count 813 transition count 1484
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 234 place count 807 transition count 1484
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 234 place count 807 transition count 1440
Deduced a syphon composed of 44 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 89 rules applied. Total rules applied 323 place count 762 transition count 1440
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 34 rules applied. Total rules applied 357 place count 746 transition count 1422
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 19 rules applied. Total rules applied 376 place count 728 transition count 1421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 377 place count 727 transition count 1421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 377 place count 727 transition count 1420
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 379 place count 726 transition count 1420
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 394 place count 711 transition count 1405
Iterating global reduction 6 with 15 rules applied. Total rules applied 409 place count 711 transition count 1405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 412 place count 711 transition count 1402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 412 place count 711 transition count 1401
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 414 place count 710 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 418 place count 706 transition count 1397
Iterating global reduction 7 with 4 rules applied. Total rules applied 422 place count 706 transition count 1397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 423 place count 706 transition count 1396
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 539 place count 648 transition count 1338
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 544 place count 643 transition count 1333
Iterating global reduction 8 with 5 rules applied. Total rules applied 549 place count 643 transition count 1333
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 554 place count 643 transition count 1328
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 559 place count 643 transition count 1323
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 569 place count 638 transition count 1318
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 10 with 13 rules applied. Total rules applied 582 place count 638 transition count 1305
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 596 place count 624 transition count 1305
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 11 with 20 rules applied. Total rules applied 616 place count 624 transition count 1305
Applied a total of 616 rules in 232 ms. Remains 624 /924 variables (removed 300) and now considering 1305/1601 (removed 296) transitions.
// Phase 1: matrix 1305 rows 624 cols
[2025-05-30 07:06:29] [INFO ] Computed 95 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:29] [INFO ] Implicit Places using invariants in 493 ms returned [73, 90, 96, 99, 101, 104, 105, 158, 177, 183, 186, 188, 194, 199, 200, 254, 271, 277, 280, 282, 283, 288, 289, 341, 378, 383, 388, 389, 442, 459, 465, 468, 470, 471, 476, 477, 529, 546, 552, 555, 557, 558]
[2025-05-30 07:06:29] [INFO ] Actually due to overlaps returned [194, 283, 383, 471, 558, 90, 96, 101, 177, 183, 188, 271, 277, 282, 459, 465, 470, 546, 552, 557, 73, 158, 254, 341, 378, 442, 529]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 496 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 597/994 places, 1305/1601 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 576 transition count 1284
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 576 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 571 transition count 1279
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 571 transition count 1279
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 70 place count 562 transition count 1270
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 562 transition count 1258
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 94 place count 550 transition count 1258
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 550 transition count 1253
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 104 place count 545 transition count 1253
Applied a total of 104 rules in 162 ms. Remains 545 /597 variables (removed 52) and now considering 1253/1305 (removed 52) transitions.
// Phase 1: matrix 1253 rows 545 cols
[2025-05-30 07:06:29] [INFO ] Computed 68 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:30] [INFO ] Implicit Places using invariants in 370 ms returned [89, 90, 173, 174, 246, 247, 341, 342, 413, 414]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 371 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 535/994 places, 1253/1601 transitions.
Applied a total of 0 rules in 19 ms. Remains 535 /535 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2219 ms. Remains : 535/994 places, 1253/1601 transitions.
RANDOM walk for 40000 steps (641 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (115 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (123 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (66 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 275650 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :1 out of 4
Probabilistic random walk after 275650 steps, saw 181644 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :1
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1253 rows 535 cols
[2025-05-30 07:06:33] [INFO ] Computed 58 invariants in 10 ms
[2025-05-30 07:06:33] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 128/167 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 331/498 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37/535 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1253/1788 variables, 535/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1788 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1788 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1788 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1788/1788 variables, and 598 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 535/535 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 128/167 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 331/498 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37/535 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1253/1788 variables, 535/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1788 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1788 variables, 3/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1788 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1788 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1788/1788 variables, and 601 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4610 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 535/535 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5764ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 14843 steps, including 991 resets, run visited all 3 properties in 137 ms. (steps per millisecond=108 )
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-2025-02 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 139 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 117902 ms.

BK_STOP 1748588799264

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

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