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.r480-tall-171624188900263.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 ltsminxred
Input is CloudReconfiguration-PT-319, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188900263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 19:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 19:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 19:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 661K May 18 16:42 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 CloudReconfiguration-PT-319-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717186379877

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-319
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:13:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:13:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:13:01] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-31 20:13:01] [INFO ] Transformed 2587 places.
[2024-05-31 20:13:01] [INFO ] Transformed 3099 transitions.
[2024-05-31 20:13:01] [INFO ] Found NUPN structural information;
[2024-05-31 20:13:01] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (488 resets) in 2359 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 140 ms. (28 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (14 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (17 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (15 resets) in 100 ms. (39 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (20 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (18 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (18 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 187440 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 16
Probabilistic random walk after 187440 steps, saw 55432 distinct states, run finished after 3017 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 3099 rows 2587 cols
[2024-05-31 20:13:05] [INFO ] Computed 4 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2332/2576 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2576 variables, 2332/2580 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2576 variables, 0/2580 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3089/5665 variables, 2576/5156 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5665 variables, 0/5156 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/5667 variables, 1/5157 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5667 variables, 1/5158 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5667/5686 variables, and 5158 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5069 ms.
Refiners :[Domain max(s): 2577/2587 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2577/2587 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2332/2576 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2576 variables, 2332/2580 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2576 variables, 0/2580 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3089/5665 variables, 2576/5156 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5665 variables, 16/5172 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5665/5686 variables, and 5172 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5028 ms.
Refiners :[Domain max(s): 2576/2587 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2576/2587 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10366ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 244 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2369 edges and 2587 vertex of which 327 / 2587 are part of one of the 35 SCC in 10 ms
Free SCC test removed 292 places
Drop transitions (Empty/Sink Transition effects.) removed 357 transitions
Reduce isomorphic transitions removed 357 transitions.
Graph (complete) has 3028 edges and 2295 vertex of which 2281 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.7 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1072 transitions
Trivial Post-agglo rules discarded 1072 transitions
Performed 1072 trivial Post agglomeration. Transition count delta: 1072
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1080 place count 2281 transition count 1655
Reduce places removed 1072 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 1142 rules applied. Total rules applied 2222 place count 1209 transition count 1585
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 32 rules applied. Total rules applied 2254 place count 1182 transition count 1580
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 2260 place count 1180 transition count 1576
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 8 rules applied. Total rules applied 2268 place count 1178 transition count 1570
Reduce places removed 4 places and 0 transitions.
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 187
Iterating post reduction 5 with 191 rules applied. Total rules applied 2459 place count 1174 transition count 1383
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 205 rules applied. Total rules applied 2664 place count 987 transition count 1365
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2668 place count 983 transition count 1365
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 38 Pre rules applied. Total rules applied 2668 place count 983 transition count 1327
Deduced a syphon composed of 38 places in 7 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 2744 place count 945 transition count 1327
Discarding 104 places :
Symmetric choice reduction at 8 with 104 rule applications. Total rules 2848 place count 841 transition count 1223
Iterating global reduction 8 with 104 rules applied. Total rules applied 2952 place count 841 transition count 1223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 11 rules applied. Total rules applied 2963 place count 841 transition count 1212
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 2966 place count 839 transition count 1211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2967 place count 838 transition count 1211
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 2967 place count 838 transition count 1206
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 2977 place count 833 transition count 1206
Discarding 45 places :
Symmetric choice reduction at 11 with 45 rule applications. Total rules 3022 place count 788 transition count 1160
Iterating global reduction 11 with 45 rules applied. Total rules applied 3067 place count 788 transition count 1160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 12 rules applied. Total rules applied 3079 place count 788 transition count 1148
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 5 rules applied. Total rules applied 3084 place count 784 transition count 1147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3085 place count 783 transition count 1147
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 3090 place count 778 transition count 1139
Iterating global reduction 14 with 5 rules applied. Total rules applied 3095 place count 778 transition count 1139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3096 place count 778 transition count 1138
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 3098 place count 776 transition count 1134
Iterating global reduction 15 with 2 rules applied. Total rules applied 3100 place count 776 transition count 1134
Performed 179 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 15 with 358 rules applied. Total rules applied 3458 place count 597 transition count 928
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 3478 place count 597 transition count 908
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3480 place count 596 transition count 907
Performed 61 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 16 with 122 rules applied. Total rules applied 3602 place count 535 transition count 942
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 16 with 28 rules applied. Total rules applied 3630 place count 535 transition count 914
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 3634 place count 531 transition count 906
Iterating global reduction 17 with 4 rules applied. Total rules applied 3638 place count 531 transition count 906
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 17 with 42 rules applied. Total rules applied 3680 place count 531 transition count 864
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3681 place count 530 transition count 863
Iterating global reduction 17 with 1 rules applied. Total rules applied 3682 place count 530 transition count 863
Free-agglomeration rule applied 43 times.
Iterating global reduction 17 with 43 rules applied. Total rules applied 3725 place count 530 transition count 820
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 44 rules applied. Total rules applied 3769 place count 487 transition count 819
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 18 with 7 rules applied. Total rules applied 3776 place count 487 transition count 812
Partial Free-agglomeration rule applied 33 times.
Drop transitions (Partial Free agglomeration) removed 33 transitions
Iterating global reduction 18 with 33 rules applied. Total rules applied 3809 place count 487 transition count 812
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 3814 place count 487 transition count 807
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 3819 place count 487 transition count 807
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3820 place count 486 transition count 806
Applied a total of 3820 rules in 698 ms. Remains 486 /2587 variables (removed 2101) and now considering 806/3099 (removed 2293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 486/2587 places, 806/3099 transitions.
RANDOM walk for 40000 steps (1665 resets) in 840 ms. (47 steps per ms) remains 7/16 properties
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (517 resets) in 121 ms. (327 steps per ms) remains 5/7 properties
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (486 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (485 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (486 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (407 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (499 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
[2024-05-31 20:13:17] [INFO ] Flow matrix only has 803 transitions (discarded 3 similar events)
// Phase 1: matrix 803 rows 486 cols
[2024-05-31 20:13:17] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 20:13:17] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CloudReconfiguration-PT-319-ReachabilityFireability-2024-03 is UNSAT
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 204/316 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 631/947 variables, 316/318 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/947 variables, 2/320 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/947 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 220/1167 variables, 93/413 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1167 variables, 3/416 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 94/1261 variables, 56/472 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1261 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/1283 variables, 17/489 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1283 variables, 0/489 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/1288 variables, 3/492 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1288 variables, 0/492 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1289 variables, 1/493 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1289 variables, 0/493 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1289 variables, 0/493 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1289/1289 variables, and 493 constraints, problems are : Problem set: 1 solved, 4 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 486/486 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 213/307 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 607/914 variables, 307/309 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 2/311 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/914 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 219/1133 variables, 87/398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1133 variables, 3/401 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1133 variables, 4/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 20:13:19] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1133 variables, 1/406 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1133 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 108/1241 variables, 59/465 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1241 variables, 0/465 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 39/1280 variables, 26/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1280 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/1288 variables, 6/497 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 0/497 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1289 variables, 1/498 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1289 variables, 0/498 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1289 variables, 0/498 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1289/1289 variables, and 498 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 486/486 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 3173ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 1353 ms.
Support contains 94 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 806/806 transitions.
Graph (trivial) has 403 edges and 486 vertex of which 75 / 486 are part of one of the 30 SCC in 1 ms
Free SCC test removed 45 places
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 441 transition count 641
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 90 rules applied. Total rules applied 169 place count 363 transition count 629
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 192 place count 361 transition count 608
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 216 place count 342 transition count 603
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 216 place count 342 transition count 584
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 254 place count 323 transition count 584
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 264 place count 313 transition count 571
Iterating global reduction 4 with 10 rules applied. Total rules applied 274 place count 313 transition count 571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 275 place count 313 transition count 570
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 276 place count 312 transition count 568
Iterating global reduction 5 with 1 rules applied. Total rules applied 277 place count 312 transition count 568
Performed 40 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 357 place count 272 transition count 519
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 380 place count 272 transition count 496
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 382 place count 270 transition count 492
Iterating global reduction 6 with 2 rules applied. Total rules applied 384 place count 270 transition count 492
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 6 with 4 rules applied. Total rules applied 388 place count 268 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 390 place count 268 transition count 488
Performed 21 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 432 place count 247 transition count 526
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 452 place count 247 transition count 506
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 460 place count 239 transition count 486
Iterating global reduction 8 with 8 rules applied. Total rules applied 468 place count 239 transition count 486
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 470 place count 237 transition count 484
Iterating global reduction 8 with 2 rules applied. Total rules applied 472 place count 237 transition count 484
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 478 place count 237 transition count 478
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 504 place count 237 transition count 452
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 505 place count 236 transition count 451
Iterating global reduction 9 with 1 rules applied. Total rules applied 506 place count 236 transition count 451
Free-agglomeration rule applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 519 place count 236 transition count 438
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 532 place count 223 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 535 place count 223 transition count 435
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 540 place count 223 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 541 place count 223 transition count 434
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 542 place count 222 transition count 433
Iterating global reduction 10 with 1 rules applied. Total rules applied 543 place count 222 transition count 433
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 548 place count 222 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 550 place count 222 transition count 431
Applied a total of 550 rules in 150 ms. Remains 222 /486 variables (removed 264) and now considering 431/806 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 222/486 places, 431/806 transitions.
RANDOM walk for 40000 steps (3149 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (724 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (686 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (742 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (746 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 943831 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :2 out of 4
Probabilistic random walk after 943831 steps, saw 200349 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :2
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-31 20:13:25] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
// Phase 1: matrix 423 rows 222 cols
[2024-05-31 20:13:25] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 20:13:25] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 391/552 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 84/636 variables, 53/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/636 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/636 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/645 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 391/552 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 84/636 variables, 53/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/636 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/636 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:13:26] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/636 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/645 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/645 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/645 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 71 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 431/431 transitions.
Graph (trivial) has 77 edges and 222 vertex of which 19 / 222 are part of one of the 7 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 210 transition count 400
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 206 transition count 395
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 21 place count 201 transition count 393
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 21 place count 201 transition count 390
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 198 transition count 390
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 197 transition count 389
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 197 transition count 389
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 3 with 2 rules applied. Total rules applied 31 place count 197 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 196 transition count 387
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 44 place count 190 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 45 place count 190 transition count 380
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 6 with 6 rules applied. Total rules applied 51 place count 187 transition count 397
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 60 place count 187 transition count 388
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 62 place count 185 transition count 380
Iterating global reduction 7 with 2 rules applied. Total rules applied 64 place count 185 transition count 380
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 66 place count 183 transition count 378
Iterating global reduction 7 with 2 rules applied. Total rules applied 68 place count 183 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 74 place count 183 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 82 place count 183 transition count 364
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 84 place count 183 transition count 362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 86 place count 181 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 87 place count 181 transition count 361
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 88 place count 181 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 89 place count 181 transition count 360
Applied a total of 89 rules in 65 ms. Remains 181 /222 variables (removed 41) and now considering 360/431 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 181/222 places, 360/431 transitions.
RANDOM walk for 40000 steps (4069 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1086 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1036 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1185171 steps, run timeout after 3006 ms. (steps per millisecond=394 ) properties seen :0 out of 2
Probabilistic random walk after 1185171 steps, saw 249313 distinct states, run finished after 3009 ms. (steps per millisecond=393 ) properties seen :0
[2024-05-31 20:13:29] [INFO ] Flow matrix only has 351 transitions (discarded 9 similar events)
// Phase 1: matrix 351 rows 181 cols
[2024-05-31 20:13:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:13:29] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 339/472 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 59/531 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 339/472 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 59/531 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/532 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:13:30] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/532 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 71 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 360/360 transitions.
Applied a total of 0 rules in 7 ms. Remains 181 /181 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 181/181 places, 360/360 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 360/360 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2024-05-31 20:13:30] [INFO ] Flow matrix only has 351 transitions (discarded 9 similar events)
[2024-05-31 20:13:30] [INFO ] Invariant cache hit.
[2024-05-31 20:13:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 20:13:30] [INFO ] Flow matrix only has 351 transitions (discarded 9 similar events)
[2024-05-31 20:13:30] [INFO ] Invariant cache hit.
[2024-05-31 20:13:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:13:30] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-31 20:13:30] [INFO ] Redundant transitions in 38 ms returned []
Running 356 sub problems to find dead transitions.
[2024-05-31 20:13:30] [INFO ] Flow matrix only has 351 transitions (discarded 9 similar events)
[2024-05-31 20:13:30] [INFO ] Invariant cache hit.
[2024-05-31 20:13:30] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 351/529 variables, 178/180 constraints. Problems are: Problem set: 0 solved, 356 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/532 variables, 3/188 constraints. Problems are: Problem set: 12 solved, 344 unsolved
[2024-05-31 20:13:37] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 1/189 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/189 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/189 constraints. Problems are: Problem set: 12 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 189 constraints, problems are : Problem set: 12 solved, 344 unsolved in 12614 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 12 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 1/3 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 351/529 variables, 178/181 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 5/186 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 294/480 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/480 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 7 (OVERLAPS) 3/532 variables, 3/483 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 50/533 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/533 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/533 constraints. Problems are: Problem set: 12 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 533 constraints, problems are : Problem set: 12 solved, 344 unsolved in 19721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 344/356 constraints, Known Traps: 1/1 constraints]
After SMT, in 32579ms problems are : Problem set: 12 solved, 344 unsolved
Search for dead transitions found 12 dead transitions in 32589ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 181/181 places, 348/360 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 5 places and 20 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 176 transition count 328
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 11 ms. Remains 176 /181 variables (removed 5) and now considering 328/348 (removed 20) transitions.
[2024-05-31 20:14:03] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
// Phase 1: matrix 323 rows 176 cols
[2024-05-31 20:14:03] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 20:14:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 20:14:03] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
[2024-05-31 20:14:03] [INFO ] Invariant cache hit.
[2024-05-31 20:14:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:14:03] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 176/181 places, 328/360 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33142 ms. Remains : 176/181 places, 328/360 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (4022 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1053 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1061 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1134046 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 2
Probabilistic random walk after 1134046 steps, saw 239021 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2024-05-31 20:14:06] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
// Phase 1: matrix 323 rows 175 cols
[2024-05-31 20:14:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:14:06] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 316/448 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/497 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/498 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/498 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 316/448 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/497 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/498 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/498 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 184 constraints, problems are : Problem set: 0 solved, 2 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 166 ms.
Support contains 70 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 328/328 transitions.
Applied a total of 0 rules in 8 ms. Remains 175 /175 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 175/175 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 328/328 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2024-05-31 20:14:07] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
[2024-05-31 20:14:07] [INFO ] Invariant cache hit.
[2024-05-31 20:14:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 20:14:07] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
[2024-05-31 20:14:07] [INFO ] Invariant cache hit.
[2024-05-31 20:14:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:14:08] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-31 20:14:08] [INFO ] Redundant transitions in 13 ms returned []
Running 324 sub problems to find dead transitions.
[2024-05-31 20:14:08] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
[2024-05-31 20:14:08] [INFO ] Invariant cache hit.
[2024-05-31 20:14:08] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 323/495 variables, 172/174 constraints. Problems are: Problem set: 0 solved, 324 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 3/498 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 182 constraints, problems are : Problem set: 0 solved, 324 unsolved in 10511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 323/495 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 274/453 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 3/498 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 50/506 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 506 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 1/1 constraints]
After SMT, in 28515ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 28524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28745 ms. Remains : 175/175 places, 328/328 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 6 place count 175 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 174 transition count 322
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 171 transition count 319
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 171 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 171 transition count 317
Applied a total of 15 rules in 24 ms. Remains 171 /175 variables (removed 4) and now considering 317/328 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 317 rows 171 cols
[2024-05-31 20:14:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:14:36] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 20:14:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 20:14:36] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 20:14:37] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:14:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-05-31 20:14:37] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 20:14:37] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 679 ms.
[2024-05-31 20:14:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 20:14:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 328 transitions and 880 arcs took 11 ms.
[2024-05-31 20:14:37] [INFO ] Flatten gal took : 65 ms
Total runtime 96377 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CloudReconfiguration-PT-319-ReachabilityFireability-2024-04
Could not compute solution for formula : CloudReconfiguration-PT-319-ReachabilityFireability-2024-14

BK_STOP 1717186477882

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name CloudReconfiguration-PT-319-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/621/inv_0_
rfs formula name CloudReconfiguration-PT-319-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/621/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CloudReconfiguration-PT-319"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudReconfiguration-PT-319, 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 r480-tall-171624188900263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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