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-171734920100135.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-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717376267617

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-03 00:57:50] [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 00:57:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:57:50] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-06-03 00:57:50] [INFO ] Transformed 248 places.
[2024-06-03 00:57:50] [INFO ] Transformed 591 transitions.
[2024-06-03 00:57:50] [INFO ] Found NUPN structural information;
[2024-06-03 00:57:50] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
RANDOM walk for 40000 steps (1376 resets) in 3769 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 178 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 248 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 108 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
[2024-06-03 00:57:52] [INFO ] Flatten gal took : 493 ms
BEST_FIRST walk for 4002 steps (28 resets) in 65 ms. (60 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (29 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
[2024-06-03 00:57:52] [INFO ] Flatten gal took : 230 ms
BEST_FIRST walk for 4003 steps (28 resets) in 308 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (29 resets) in 192 ms. (20 steps per ms) remains 16/16 properties
[2024-06-03 00:57:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2066730686270186392.gal : 92 ms
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
[2024-06-03 00:57:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16974851347366673083.prop : 4 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/ReachabilityCardinality2066730686270186392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16974851347366673083.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/ReachabilityCardinality16974851347366673083.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 46
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-04 is true.
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :46 after 222
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :222 after 665
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :665 after 845
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :845 after 971
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :971 after 3069
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-15 is true.
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3069 after 30846
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :30846 after 30878
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :30878 after 34278
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :34278 after 36706
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :36706 after 42470
Interrupted probabilistic random walk after 327964 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :9 out of 16
Probabilistic random walk after 327964 steps, saw 60234 distinct states, run finished after 3022 ms. (steps per millisecond=108 ) properties seen :9
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 589 rows 248 cols
[2024-06-03 00:57:55] [INFO ] Computed 7 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MedleyA-PT-17-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 175/248 variables, 7/80 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 175/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Invariant property MedleyA-PT-17-ReachabilityFireability-2024-10 does not hold.
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-01 is true.
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :42470 after 147178
At refinement iteration 5 (OVERLAPS) 589/837 variables, 248/503 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/837 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 503 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1120 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MedleyA-PT-17-ReachabilityFireability-2024-00 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-17-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-17-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 179/248 variables, 7/76 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 179/255 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-03 00:57:57] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 41 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 3 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 3 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 11 ms to minimize.
[2024-06-03 00:57:59] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 5/260 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-03 00:57:59] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 4 ms to minimize.
[2024-06-03 00:57:59] [INFO ] Deduced a trap composed of 34 places in 366 ms of which 13 ms to minimize.
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-08 is true.
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :147178 after 260962
[2024-06-03 00:58:00] [INFO ] Deduced a trap composed of 19 places in 365 ms of which 4 ms to minimize.
[2024-06-03 00:58:00] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 4 ms to minimize.
[2024-06-03 00:58:00] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 5 ms to minimize.
[2024-06-03 00:58:01] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 3 ms to minimize.
[2024-06-03 00:58:01] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 3 ms to minimize.
[2024-06-03 00:58:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:58:01] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 9/269 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/269 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 589/837 variables, 248/517 constraints. Problems are: Problem set: 5 solved, 2 unsolved
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :260962 after 300282
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 2/519 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/837 variables, and 519 constraints, problems are : Problem set: 5 solved, 2 unsolved in 5011 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 14/14 constraints]
After SMT, in 6582ms problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 184 edges and 248 vertex of which 3 / 248 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 246 transition count 563
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 34 rules applied. Total rules applied 58 place count 223 transition count 552
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 67 place count 214 transition count 552
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 67 place count 214 transition count 536
Deduced a syphon composed of 16 places in 12 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 99 place count 198 transition count 536
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 145 place count 152 transition count 455
Iterating global reduction 3 with 46 rules applied. Total rules applied 191 place count 152 transition count 455
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 223 place count 152 transition count 423
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 223 place count 152 transition count 420
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 229 place count 149 transition count 420
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 147 transition count 416
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 147 transition count 416
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 251 place count 138 transition count 407
Performed 11 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 273 place count 127 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 127 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 284 place count 127 transition count 434
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 289 place count 122 transition count 429
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 122 transition count 429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 298 place count 120 transition count 432
Free-agglomeration rule applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 316 place count 120 transition count 414
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 348 place count 102 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 351 place count 102 transition count 397
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 102 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 355 place count 100 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 356 place count 99 transition count 424
Applied a total of 356 rules in 407 ms. Remains 99 /248 variables (removed 149) and now considering 424/589 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 99/248 places, 424/589 transitions.
RANDOM walk for 40000 steps (3329 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (626 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (634 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 974562 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :1 out of 2
Probabilistic random walk after 974562 steps, saw 174864 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:58:06] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
// Phase 1: matrix 387 rows 99 cols
[2024-06-03 00:58:06] [INFO ] Computed 7 invariants in 6 ms
[2024-06-03 00:58:06] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 387/486 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 27/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/486 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 27/27 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:58:06] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2024-06-03 00:58:06] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2024-06-03 00:58:06] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 387/486 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 27/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :300282 after 412008
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:58:09] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 353 ms.
Support contains 32 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 98 transition count 423
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 98 transition count 422
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 97 transition count 422
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 97 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 96 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 96 transition count 414
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 12 place count 96 transition count 410
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 16 place count 94 transition count 420
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 18 place count 94 transition count 418
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 21 place count 94 transition count 415
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 27 place count 91 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 35 place count 91 transition count 404
Applied a total of 35 rules in 91 ms. Remains 91 /99 variables (removed 8) and now considering 404/424 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 91/99 places, 404/424 transitions.
RANDOM walk for 40000 steps (3623 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (732 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
Invariant property MedleyA-PT-17-ReachabilityFireability-2024-09 does not hold.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :412008 after 608254
Interrupted probabilistic random walk after 1322755 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1322755 steps, saw 235154 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
[2024-06-03 00:58:12] [INFO ] Flow matrix only has 366 transitions (discarded 38 similar events)
// Phase 1: matrix 366 rows 91 cols
[2024-06-03 00:58:12] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:58:12] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/457 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 34/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:58:13] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:58:13] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:58:13] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 366/457 variables, 91/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 34/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:58:14] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1401 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1614ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 594 ms.
Support contains 32 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 404/404 transitions.
Applied a total of 0 rules in 12 ms. Remains 91 /91 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 91/91 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 404/404 transitions.
Applied a total of 0 rules in 10 ms. Remains 91 /91 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-06-03 00:58:15] [INFO ] Flow matrix only has 366 transitions (discarded 38 similar events)
[2024-06-03 00:58:15] [INFO ] Invariant cache hit.
[2024-06-03 00:58:15] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-03 00:58:15] [INFO ] Flow matrix only has 366 transitions (discarded 38 similar events)
[2024-06-03 00:58:15] [INFO ] Invariant cache hit.
[2024-06-03 00:58:15] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-03 00:58:15] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-06-03 00:58:15] [INFO ] Redundant transitions in 31 ms returned []
Running 398 sub problems to find dead transitions.
[2024-06-03 00:58:15] [INFO ] Flow matrix only has 366 transitions (discarded 38 similar events)
[2024-06-03 00:58:15] [INFO ] Invariant cache hit.
[2024-06-03 00:58:15] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:58:19] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :608254 after 671560
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-06-03 00:58:20] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 7 ms to minimize.
[2024-06-03 00:58:21] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:58:21] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2024-06-03 00:58:21] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 2 ms to minimize.
[2024-06-03 00:58:21] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2024-06-03 00:58:21] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:58:21] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-03 00:58:21] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:58:22] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 20/27 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-06-03 00:58:23] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 2 ms to minimize.
[2024-06-03 00:58:23] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 1 ms to minimize.
[2024-06-03 00:58:24] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:58:24] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 4/31 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-06-03 00:58:26] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-06-03 00:58:26] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-06-03 00:58:27] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 3/34 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/34 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 7 (OVERLAPS) 366/457 variables, 91/125 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 34/159 constraints. Problems are: Problem set: 32 solved, 366 unsolved
Invariant property MedleyA-PT-17-ReachabilityFireability-2024-06 does not hold.
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-03 is true.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/159 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 10 (OVERLAPS) 0/457 variables, 0/159 constraints. Problems are: Problem set: 32 solved, 366 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 159 constraints, problems are : Problem set: 32 solved, 366 unsolved in 22680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 32 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 4/5 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 5/91 variables, 6/11 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 23/34 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-06-03 00:58:41] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/35 constraints. Problems are: Problem set: 32 solved, 366 unsolved
[2024-06-03 00:58:44] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 3 ms to minimize.
[2024-06-03 00:58:44] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/37 constraints. Problems are: Problem set: 32 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 32 solved, 366 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 8 (OVERLAPS) 366/457 variables, 91/128 constraints. Problems are: Problem set: 82 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 34/162 constraints. Problems are: Problem set: 82 solved, 316 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :671560 after 6.16907e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 316/478 constraints. Problems are: Problem set: 82 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/457 variables, and 478 constraints, problems are : Problem set: 82 solved, 316 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 316/398 constraints, Known Traps: 30/30 constraints]
After SMT, in 53803ms problems are : Problem set: 82 solved, 316 unsolved
Search for dead transitions found 82 dead transitions in 53821ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/91 places, 322/404 transitions.
Applied a total of 0 rules in 19 ms. Remains 91 /91 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-06-03 00:59:09] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54235 ms. Remains : 91/91 places, 322/404 transitions.
RANDOM walk for 40000 steps (3628 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (738 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1710747 steps, run timeout after 3001 ms. (steps per millisecond=570 ) properties seen :0 out of 1
Probabilistic random walk after 1710747 steps, saw 298685 distinct states, run finished after 3001 ms. (steps per millisecond=570 ) properties seen :0
[2024-06-03 00:59:12] [INFO ] Flow matrix only has 284 transitions (discarded 38 similar events)
// Phase 1: matrix 284 rows 91 cols
[2024-06-03 00:59:12] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:59:12] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 284/375 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 34/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:59:12] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:59:12] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 284/375 variables, 91/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 34/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:59:13] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:59:13] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 12 ms to minimize.
[2024-06-03 00:59:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1532ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 32 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 91/91 places, 322/322 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 322/322 transitions.
Applied a total of 0 rules in 12 ms. Remains 91 /91 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-06-03 00:59:14] [INFO ] Flow matrix only has 284 transitions (discarded 38 similar events)
[2024-06-03 00:59:14] [INFO ] Invariant cache hit.
[2024-06-03 00:59:14] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-03 00:59:14] [INFO ] Flow matrix only has 284 transitions (discarded 38 similar events)
[2024-06-03 00:59:14] [INFO ] Invariant cache hit.
[2024-06-03 00:59:14] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-03 00:59:14] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-03 00:59:14] [INFO ] Redundant transitions in 5 ms returned []
Running 316 sub problems to find dead transitions.
[2024-06-03 00:59:14] [INFO ] Flow matrix only has 284 transitions (discarded 38 similar events)
[2024-06-03 00:59:14] [INFO ] Invariant cache hit.
[2024-06-03 00:59:14] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:17] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-03 00:59:17] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-03 00:59:17] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:59:17] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-03 00:59:18] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-06-03 00:59:18] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-06-03 00:59:18] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 5 ms to minimize.
[2024-06-03 00:59:18] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-06-03 00:59:18] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-06-03 00:59:18] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-03 00:59:19] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-03 00:59:20] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:59:20] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:21] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-03 00:59:21] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:59:21] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:59:21] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-03 00:59:21] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:59:21] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:59:22] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:59:22] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:23] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:59:23] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:25] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:27] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 2 ms to minimize.
[2024-06-03 00:59:28] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:29] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2024-06-03 00:59:30] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:59:30] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:59:30] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:32] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 11 (OVERLAPS) 284/375 variables, 91/136 constraints. Problems are: Problem set: 0 solved, 316 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :6.16907e+06 after 7.02968e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 34/170 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 14 (OVERLAPS) 0/375 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 170 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 5/91 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 284/375 variables, 91/136 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 34/170 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 316/486 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-03 00:59:57] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 487 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 39/39 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60675 ms. Remains : 91/91 places, 322/322 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 74 edges and 91 vertex of which 8 / 91 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 86 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 86 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 28 place count 86 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 85 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 85 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 85 transition count 239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 84 transition count 238
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 84 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 83 transition count 237
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 42 place count 83 transition count 237
Applied a total of 42 rules in 49 ms. Remains 83 /91 variables (removed 8) and now considering 237/322 (removed 85) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 237 rows 83 cols
[2024-06-03 01:00:14] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:00:14] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 01:00:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 01:00:15] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 01:00:15] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 01:00:16] [INFO ] After 1729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-03 01:00:16] [INFO ] Flatten gal took : 35 ms
[2024-06-03 01:00:16] [INFO ] Flatten gal took : 31 ms
[2024-06-03 01:00:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18196925673953361813.gal : 6 ms
[2024-06-03 01:00:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14850781173369463783.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18196925673953361813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14850781173369463783.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 ...330
Loading property file /tmp/ReachabilityCardinality14850781173369463783.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 54
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54 after 117
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :117 after 360
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1664 after 1874
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1874 after 3155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3155 after 8854
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8854 after 11274
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :11274 after 16868
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16868 after 103703
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :103703 after 435240
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-11 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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,936440,6.36476,154040,2,24287,19,316568,6,0,571,378214,0
Total reachable state count : 936440

Verifying 1 reachability properties.
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-11 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-17-ReachabilityFireability-2024-11,1122,6.36955,154040,2,1003,19,316568,7,0,626,378214,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 8323 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 01:00:23] [INFO ] Flatten gal took : 53 ms
[2024-06-03 01:00:23] [INFO ] Applying decomposition
[2024-06-03 01:00:23] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15053123984114495402.txt' '-o' '/tmp/graph15053123984114495402.bin' '-w' '/tmp/graph15053123984114495402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15053123984114495402.bin' '-l' '-1' '-v' '-w' '/tmp/graph15053123984114495402.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:00:23] [INFO ] Decomposing Gal with order
[2024-06-03 01:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:00:23] [INFO ] Removed a total of 550 redundant transitions.
[2024-06-03 01:00:24] [INFO ] Flatten gal took : 210 ms
[2024-06-03 01:00:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 31 ms.
[2024-06-03 01:00:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6780479157262684227.gal : 16 ms
[2024-06-03 01:00:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5772028942684506650.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/ReachabilityCardinality6780479157262684227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5772028942684506650.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/ReachabilityCardinality5772028942684506650.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 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 8144
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8144 after 9044
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9044 after 9044
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9044 after 9044
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9044 after 9044
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :52109 after 67285
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :67285 after 70709
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :70709 after 70709
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70709 after 155904
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-11 is true.
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.4215e+06,27.5624,538004,6542,14331,68008,418125,857,864355,379,8.39249e+06,0
Total reachable state count : 7421505

Verifying 1 reachability properties.
Reachability property MedleyA-PT-17-ReachabilityFireability-2024-11 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-17-ReachabilityFireability-2024-11,72,27.6909,538004,76,84,68008,418125,1038,864355,441,8.39249e+06,0
All properties solved without resorting to model-checking.
Total runtime 181768 ms.

BK_STOP 1717376451943

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

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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 '' 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 ;