About the Execution of ITS-Tools for MedleyA-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2740.460 | 183166.00 | 396218.00 | 598.20 | TFTFFTTFTFFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100143.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is MedleyA-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100143
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 158K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717381085224
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-03 02:18:07] [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]
[2024-06-03 02:18:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 02:18:08] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2024-06-03 02:18:08] [INFO ] Transformed 252 places.
[2024-06-03 02:18:08] [INFO ] Transformed 543 transitions.
[2024-06-03 02:18:08] [INFO ] Found NUPN structural information;
[2024-06-03 02:18:08] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 589 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
[2024-06-03 02:18:09] [INFO ] Flatten gal took : 361 ms
RANDOM walk for 40000 steps (1534 resets) in 3779 ms. (10 steps per ms) remains 15/16 properties
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4002 steps (35 resets) in 121 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 101 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 98 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 113 ms. (35 steps per ms) remains 15/15 properties
[2024-06-03 02:18:09] [INFO ] Flatten gal took : 230 ms
[2024-06-03 02:18:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4932134401319311673.gal : 98 ms
BEST_FIRST walk for 4004 steps (32 resets) in 514 ms. (7 steps per ms) remains 15/15 properties
[2024-06-03 02:18:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11830504079340885883.prop : 7 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4932134401319311673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11830504079340885883.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (35 resets) in 151 ms. (26 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 181 ms. (21 steps per ms) remains 15/15 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11830504079340885883.prop.
BEST_FIRST walk for 4002 steps (33 resets) in 368 ms. (10 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (31 resets) in 214 ms. (18 steps per ms) remains 15/15 properties
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 4004 steps (34 resets) in 313 ms. (12 steps per ms) remains 15/15 properties
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :10 after 57
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :57 after 123
BEST_FIRST walk for 4002 steps (34 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :123 after 221
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :221 after 284
BEST_FIRST walk for 4004 steps (34 resets) in 164 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (35 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (35 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :284 after 5371
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :5371 after 5405
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :5405 after 5549
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :5549 after 6417
Reachability property MedleyA-PT-18-ReachabilityFireability-2024-13 is true.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 305077 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :4 out of 15
Probabilistic random walk after 305077 steps, saw 59753 distinct states, run finished after 3010 ms. (steps per millisecond=101 ) properties seen :4
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 541 rows 252 cols
[2024-06-03 02:18:13] [INFO ] Computed 7 invariants in 29 ms
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :6417 after 76848
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-18-ReachabilityFireability-2024-04 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 107/252 variables, 7/152 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 107/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 541/793 variables, 252/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 511 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2067 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 127/252 variables, 7/132 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 127/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-03 02:18:16] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 24 ms to minimize.
[2024-06-03 02:18:17] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 4 ms to minimize.
[2024-06-03 02:18:17] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 3 ms to minimize.
[2024-06-03 02:18:17] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 4 ms to minimize.
[2024-06-03 02:18:18] [INFO ] Deduced a trap composed of 53 places in 283 ms of which 4 ms to minimize.
[2024-06-03 02:18:18] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2024-06-03 02:18:18] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 4 ms to minimize.
[2024-06-03 02:18:18] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
Problem MedleyA-PT-18-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-03 02:18:18] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2024-06-03 02:18:19] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 2 ms to minimize.
[2024-06-03 02:18:19] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-06-03 02:18:19] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 4 ms to minimize.
[2024-06-03 02:18:19] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 3 ms to minimize.
[2024-06-03 02:18:19] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
Invariant property MedleyA-PT-18-ReachabilityFireability-2024-12 does not hold.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-18-ReachabilityFireability-2024-10 does not hold.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-06-03 02:18:20] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 5 ms to minimize.
Reachability property MedleyA-PT-18-ReachabilityFireability-2024-06 is true.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-18-ReachabilityFireability-2024-03 does not hold.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property MedleyA-PT-18-ReachabilityFireability-2024-02 is true.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :76848 after 136392
[2024-06-03 02:18:20] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-06-03 02:18:20] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 2 ms to minimize.
[2024-06-03 02:18:20] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 2 ms to minimize.
[2024-06-03 02:18:21] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 4 ms to minimize.
[2024-06-03 02:18:21] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 5 ms to minimize.
SMT process timed out in 7819ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 161 edges and 252 vertex of which 8 / 252 are part of one of the 2 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
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 35 rules applied. Total rules applied 36 place count 246 transition count 498
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 211 transition count 496
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 82 place count 210 transition count 488
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 92 place count 202 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 201 transition count 486
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 93 place count 201 transition count 479
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 107 place count 194 transition count 479
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 140 place count 161 transition count 422
Iterating global reduction 5 with 33 rules applied. Total rules applied 173 place count 161 transition count 422
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 173 place count 161 transition count 419
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 179 place count 158 transition count 419
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 207 place count 144 transition count 405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 210 place count 144 transition count 402
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 213 place count 141 transition count 396
Iterating global reduction 6 with 3 rules applied. Total rules applied 216 place count 141 transition count 396
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 140 transition count 394
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 140 transition count 394
Performed 6 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 230 place count 134 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 134 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 243 place count 134 transition count 400
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 247 place count 130 transition count 396
Iterating global reduction 7 with 4 rules applied. Total rules applied 251 place count 130 transition count 396
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 257 place count 127 transition count 413
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 265 place count 127 transition count 405
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 273 place count 119 transition count 405
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 274 place count 119 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 275 place count 118 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 276 place count 117 transition count 418
Applied a total of 276 rules in 264 ms. Remains 117 /252 variables (removed 135) and now considering 418/541 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 117/252 places, 418/541 transitions.
RANDOM walk for 40000 steps (3308 resets) in 339 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (922 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (965 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (924 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (924 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 756310 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :2 out of 4
Probabilistic random walk after 756310 steps, saw 126264 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :2
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 02:18:25] [INFO ] Flow matrix only has 414 transitions (discarded 4 similar events)
// Phase 1: matrix 414 rows 117 cols
[2024-06-03 02:18:25] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 02:18:25] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 414/531 variables, 117/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 14/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 02:18:25] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 02:18:25] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 02:18:26] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MedleyA-PT-18-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 414/531 variables, 117/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 14/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :136392 after 149396
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/531 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 142 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3254 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4027ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 710 ms.
Support contains 34 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 418/418 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 117 transition count 415
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 415
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 114 transition count 409
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 108 transition count 409
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 106 transition count 405
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 106 transition count 405
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 2 with 4 rules applied. Total rules applied 26 place count 104 transition count 403
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 101 transition count 445
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 42 place count 101 transition count 435
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 51 place count 101 transition count 426
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 66 place count 92 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 75 place count 92 transition count 411
Applied a total of 75 rules in 84 ms. Remains 92 /117 variables (removed 25) and now considering 411/418 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 92/117 places, 411/418 transitions.
RANDOM walk for 40000 steps (3935 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1259 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1304992 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :0 out of 1
Probabilistic random walk after 1304992 steps, saw 231284 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
[2024-06-03 02:18:33] [INFO ] Flow matrix only has 397 transitions (discarded 14 similar events)
// Phase 1: matrix 397 rows 92 cols
[2024-06-03 02:18:33] [INFO ] Computed 7 invariants in 7 ms
[2024-06-03 02:18:33] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 397/489 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 67/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/489 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 02:18:33] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-06-03 02:18:33] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 2 ms to minimize.
[2024-06-03 02:18:33] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 2 ms to minimize.
[2024-06-03 02:18:33] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 397/489 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 67/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :149396 after 173181
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4767 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 5025ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 826 ms.
Support contains 34 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 411/411 transitions.
Applied a total of 0 rules in 13 ms. Remains 92 /92 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 92/92 places, 411/411 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 411/411 transitions.
Applied a total of 0 rules in 12 ms. Remains 92 /92 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-06-03 02:18:38] [INFO ] Flow matrix only has 397 transitions (discarded 14 similar events)
[2024-06-03 02:18:38] [INFO ] Invariant cache hit.
[2024-06-03 02:18:39] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-03 02:18:39] [INFO ] Flow matrix only has 397 transitions (discarded 14 similar events)
[2024-06-03 02:18:39] [INFO ] Invariant cache hit.
[2024-06-03 02:18:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-03 02:18:39] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-03 02:18:39] [INFO ] Redundant transitions in 28 ms returned []
Running 407 sub problems to find dead transitions.
[2024-06-03 02:18:39] [INFO ] Flow matrix only has 397 transitions (discarded 14 similar events)
[2024-06-03 02:18:39] [INFO ] Invariant cache hit.
[2024-06-03 02:18:39] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 4/92 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-03 02:18:43] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-06-03 02:18:44] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-06-03 02:18:44] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2024-06-03 02:18:44] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-06-03 02:18:44] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2024-06-03 02:18:44] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2024-06-03 02:18:44] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 2 ms to minimize.
[2024-06-03 02:18:44] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 2 ms to minimize.
[2024-06-03 02:18:45] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 2 ms to minimize.
[2024-06-03 02:18:45] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2024-06-03 02:18:45] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 2 ms to minimize.
[2024-06-03 02:18:45] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 2 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :173181 after 221874
[2024-06-03 02:18:45] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-06-03 02:18:46] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 2 ms to minimize.
[2024-06-03 02:18:46] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-06-03 02:18:46] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-03 02:18:46] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-06-03 02:18:46] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2024-06-03 02:18:46] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-06-03 02:18:46] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-03 02:18:48] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2024-06-03 02:18:48] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-06-03 02:18:48] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-03 02:18:48] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-06-03 02:18:49] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 2 ms to minimize.
[2024-06-03 02:18:49] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2024-06-03 02:18:49] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-03 02:18:49] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-03 02:18:49] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 10 ms to minimize.
[2024-06-03 02:18:49] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
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 TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
[2024-06-03 02:18:50] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2024-06-03 02:18:51] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
[2024-06-03 02:18:51] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-03 02:18:51] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 14/41 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/41 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 397/489 variables, 92/133 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 67/200 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/200 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 9 (OVERLAPS) 0/489 variables, 0/200 constraints. Problems are: Problem set: 16 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 200 constraints, problems are : Problem set: 16 solved, 391 unsolved in 26925 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 16 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 12/14 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 5/19 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 22/41 constraints. Problems are: Problem set: 16 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/41 constraints. Problems are: Problem set: 16 solved, 391 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 6 (OVERLAPS) 397/489 variables, 92/133 constraints. Problems are: Problem set: 66 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 67/200 constraints. Problems are: Problem set: 66 solved, 341 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :221874 after 690830
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 341/541 constraints. Problems are: Problem set: 66 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 541 constraints, problems are : Problem set: 66 solved, 341 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 341/407 constraints, Known Traps: 34/34 constraints]
After SMT, in 57909ms problems are : Problem set: 66 solved, 341 unsolved
Search for dead transitions found 66 dead transitions in 57921ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/92 places, 345/411 transitions.
Applied a total of 0 rules in 11 ms. Remains 92 /92 variables (removed 0) and now considering 345/345 (removed 0) transitions.
[2024-06-03 02:19:37] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58363 ms. Remains : 92/92 places, 345/411 transitions.
RANDOM walk for 40000 steps (3925 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1233 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1499656 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :0 out of 1
Probabilistic random walk after 1499656 steps, saw 262818 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
[2024-06-03 02:19:40] [INFO ] Flow matrix only has 331 transitions (discarded 14 similar events)
// Phase 1: matrix 331 rows 92 cols
[2024-06-03 02:19:40] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 02:19:40] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 331/423 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 53/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/423 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 02:19:40] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-03 02:19:40] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-06-03 02:19:40] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2024-06-03 02:19:40] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-06-03 02:19:41] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-03 02:19:41] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 331/423 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 53/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 02:19:41] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/423 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 171 ms.
Support contains 34 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 345/345 transitions.
Applied a total of 0 rules in 9 ms. Remains 92 /92 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 92/92 places, 345/345 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 345/345 transitions.
Applied a total of 0 rules in 11 ms. Remains 92 /92 variables (removed 0) and now considering 345/345 (removed 0) transitions.
[2024-06-03 02:19:42] [INFO ] Flow matrix only has 331 transitions (discarded 14 similar events)
[2024-06-03 02:19:42] [INFO ] Invariant cache hit.
[2024-06-03 02:19:42] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-03 02:19:42] [INFO ] Flow matrix only has 331 transitions (discarded 14 similar events)
[2024-06-03 02:19:42] [INFO ] Invariant cache hit.
[2024-06-03 02:19:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-03 02:19:42] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-06-03 02:19:42] [INFO ] Redundant transitions in 18 ms returned []
Running 341 sub problems to find dead transitions.
[2024-06-03 02:19:42] [INFO ] Flow matrix only has 331 transitions (discarded 14 similar events)
[2024-06-03 02:19:42] [INFO ] Invariant cache hit.
[2024-06-03 02:19:42] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 4/92 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-03 02:19:45] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-03 02:19:46] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-03 02:19:47] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2024-06-03 02:19:47] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-03 02:19:48] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-03 02:19:49] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-03 02:19:50] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-06-03 02:19:50] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-06-03 02:19:50] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-06-03 02:19:50] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:19:50] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-06-03 02:19:51] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-03 02:19:51] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-06-03 02:19:51] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2024-06-03 02:19:52] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-06-03 02:19:52] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-03 02:19:52] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:19:52] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-03 02:19:53] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (OVERLAPS) 331/423 variables, 92/148 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 53/201 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Invariant property MedleyA-PT-18-ReachabilityFireability-2024-14 does not hold.
Invariant property MedleyA-PT-18-ReachabilityFireability-2024-09 does not hold.
At refinement iteration 11 (OVERLAPS) 0/423 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 201 constraints, problems are : Problem set: 0 solved, 341 unsolved in 20851 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:20:05] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:20:07] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:20:08] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-06-03 02:20:08] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-03 02:20:08] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-06-03 02:20:08] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-03 02:20:09] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-03 02:20:09] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-06-03 02:20:10] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (OVERLAPS) 331/423 variables, 92/157 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 53/210 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 341/551 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Reachability property MedleyA-PT-18-ReachabilityFireability-2024-00 is true.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :690830 after 1.14521e+06
[2024-06-03 02:20:24] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 552 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 59/59 constraints]
After SMT, in 51303ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 51309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51633 ms. Remains : 92/92 places, 345/345 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 56 edges and 92 vertex of which 3 / 92 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 90 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 48 place count 89 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 89 transition count 279
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 89 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 89 transition count 278
Applied a total of 55 rules in 45 ms. Remains 89 /92 variables (removed 3) and now considering 278/345 (removed 67) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 278 rows 89 cols
[2024-06-03 02:20:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 02:20:33] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 02:20:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 02:20:34] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 02:20:34] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-03 02:20:34] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-03 02:20:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
TRAPS : Iteration 1
[2024-06-03 02:20:35] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-06-03 02:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
TRAPS : Iteration 2
[2024-06-03 02:20:36] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-03 02:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
TRAPS : Iteration 3
[2024-06-03 02:20:36] [INFO ] After 2499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 02:20:36] [INFO ] After 2955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-03 02:20:36] [INFO ] Flatten gal took : 49 ms
[2024-06-03 02:20:37] [INFO ] Flatten gal took : 42 ms
[2024-06-03 02:20:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15417442901021673009.gal : 6 ms
[2024-06-03 02:20:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4470884050239717164.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15417442901021673009.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4470884050239717164.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4470884050239717164.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 41
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :41 after 58
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :58 after 103
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :103 after 384
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :384 after 852
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :852 after 3381
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6867 after 24883
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :24883 after 40668
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :40668 after 91808
Detected timeout of ITS tools.
[2024-06-03 02:20:52] [INFO ] Flatten gal took : 28 ms
[2024-06-03 02:20:52] [INFO ] Applying decomposition
[2024-06-03 02:20:52] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1268405429178157030.txt' '-o' '/tmp/graph1268405429178157030.bin' '-w' '/tmp/graph1268405429178157030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1268405429178157030.bin' '-l' '-1' '-v' '-w' '/tmp/graph1268405429178157030.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:20:52] [INFO ] Decomposing Gal with order
[2024-06-03 02:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:20:52] [INFO ] Removed a total of 583 redundant transitions.
[2024-06-03 02:20:52] [INFO ] Flatten gal took : 109 ms
[2024-06-03 02:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 21 ms.
[2024-06-03 02:20:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1045731067276414440.gal : 9 ms
[2024-06-03 02:20:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3138417527450039401.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1045731067276414440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3138417527450039401.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3138417527450039401.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 102
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :102 after 317
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :317 after 11850
Reachability property MedleyA-PT-18-ReachabilityFireability-2024-15 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,624777,1.81873,59044,902,836,32571,16391,674,320260,201,451653,0
Total reachable state count : 624777
Verifying 1 reachability properties.
Reachability property MedleyA-PT-18-ReachabilityFireability-2024-15 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
MedleyA-PT-18-ReachabilityFireability-2024-15,212,1.85543,59304,87,122,32571,16391,899,320260,239,451653,0
Over-approximation ignoring read arcs solved 0 properties in 20661 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 02:20:54] [INFO ] Flatten gal took : 42 ms
[2024-06-03 02:20:54] [INFO ] Applying decomposition
[2024-06-03 02:20:54] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph567716751271764980.txt' '-o' '/tmp/graph567716751271764980.bin' '-w' '/tmp/graph567716751271764980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph567716751271764980.bin' '-l' '-1' '-v' '-w' '/tmp/graph567716751271764980.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:20:54] [INFO ] Decomposing Gal with order
[2024-06-03 02:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:20:54] [INFO ] Removed a total of 1088 redundant transitions.
[2024-06-03 02:20:54] [INFO ] Flatten gal took : 83 ms
[2024-06-03 02:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 22 ms.
[2024-06-03 02:20:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14736708737409809031.gal : 10 ms
[2024-06-03 02:20:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3716596435922731923.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14736708737409809031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3716596435922731923.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3716596435922731923.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 2516
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2516 after 11206
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11206 after 41821
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :41821 after 622167
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :622167 after 3.4481e+07
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,1.10678e+08,13.1822,250800,4818,576,379536,54390,1454,904863,157,394259,0
Total reachable state count : 110678154
Verifying 1 reachability properties.
Reachability property MedleyA-PT-18-ReachabilityFireability-2024-15 is true.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-18-ReachabilityFireability-2024-15,529,13.3284,250800,178,105,379536,54390,1555,904863,167,394259,17441
All properties solved without resorting to model-checking.
Total runtime 180561 ms.
BK_STOP 1717381268390
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="MedleyA-PT-18"
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-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-18, 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 r576-smll-171734920100143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;