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-171624189000287.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-402, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 4.0K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 19:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 19:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 19:43 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 912K 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-402-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-402-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717187641780

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-402
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:34:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:34:03] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-31 20:34:03] [INFO ] Transformed 3554 places.
[2024-05-31 20:34:03] [INFO ] Transformed 4263 transitions.
[2024-05-31 20:34:03] [INFO ] Found NUPN structural information;
[2024-05-31 20:34:03] [INFO ] Parsed PT model containing 3554 places and 4263 transitions and 8889 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (225 resets) in 1683 ms. (23 steps per ms) remains 15/16 properties
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 174957 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 15
Probabilistic random walk after 174957 steps, saw 45969 distinct states, run finished after 3010 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 4263 rows 3554 cols
[2024-05-31 20:34:07] [INFO ] Computed 5 invariants in 67 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 3283/3541 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3541 variables, 3283/3546 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3541 variables, 0/3546 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 4251/7792 variables, 3541/7087 constraints. Problems are: Problem set: 0 solved, 15 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 7792/7817 variables, and 7087 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5070 ms.
Refiners :[Domain max(s): 3541/3554 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 3541/3554 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 3283/3541 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3541 variables, 3283/3546 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3541 variables, 0/3546 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 4251/7792 variables, 3541/7087 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7792/7817 variables, and 7102 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5027 ms.
Refiners :[Domain max(s): 3541/3554 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 3541/3554 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 10407ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 258 out of 3554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3554/3554 places, 4263/4263 transitions.
Graph (trivial) has 3455 edges and 3554 vertex of which 680 / 3554 are part of one of the 67 SCC in 11 ms
Free SCC test removed 613 places
Drop transitions (Empty/Sink Transition effects.) removed 745 transitions
Reduce isomorphic transitions removed 745 transitions.
Graph (complete) has 3890 edges and 2941 vertex of which 2924 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.7 ms
Discarding 17 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1504 transitions
Trivial Post-agglo rules discarded 1504 transitions
Performed 1504 trivial Post agglomeration. Transition count delta: 1504
Iterating post reduction 0 with 1509 rules applied. Total rules applied 1511 place count 2924 transition count 1998
Reduce places removed 1504 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 1607 rules applied. Total rules applied 3118 place count 1420 transition count 1895
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 211
Iterating post reduction 2 with 254 rules applied. Total rules applied 3372 place count 1380 transition count 1681
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 3 with 248 rules applied. Total rules applied 3620 place count 1169 transition count 1644
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 3626 place count 1163 transition count 1644
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 53 Pre rules applied. Total rules applied 3626 place count 1163 transition count 1591
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 3732 place count 1110 transition count 1591
Discarding 120 places :
Symmetric choice reduction at 5 with 120 rule applications. Total rules 3852 place count 990 transition count 1471
Iterating global reduction 5 with 120 rules applied. Total rules applied 3972 place count 990 transition count 1471
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 10 rules applied. Total rules applied 3982 place count 990 transition count 1461
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 3988 place count 986 transition count 1459
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 3991 place count 985 transition count 1457
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 3994 place count 984 transition count 1455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3995 place count 983 transition count 1455
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 3995 place count 983 transition count 1449
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 4007 place count 977 transition count 1449
Discarding 60 places :
Symmetric choice reduction at 10 with 60 rule applications. Total rules 4067 place count 917 transition count 1389
Iterating global reduction 10 with 60 rules applied. Total rules applied 4127 place count 917 transition count 1389
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 21 rules applied. Total rules applied 4148 place count 917 transition count 1368
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 13 rules applied. Total rules applied 4161 place count 907 transition count 1365
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 12 with 3 rules applied. Total rules applied 4164 place count 906 transition count 1363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4166 place count 904 transition count 1363
Discarding 11 places :
Symmetric choice reduction at 14 with 11 rule applications. Total rules 4177 place count 893 transition count 1346
Iterating global reduction 14 with 11 rules applied. Total rules applied 4188 place count 893 transition count 1346
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 4194 place count 887 transition count 1334
Iterating global reduction 14 with 6 rules applied. Total rules applied 4200 place count 887 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 4201 place count 886 transition count 1332
Iterating global reduction 14 with 1 rules applied. Total rules applied 4202 place count 886 transition count 1332
Performed 232 Post agglomeration using F-continuation condition with reduction of 58 identical transitions.
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 14 with 464 rules applied. Total rules applied 4666 place count 654 transition count 1042
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 14 with 20 rules applied. Total rules applied 4686 place count 654 transition count 1022
Performed 74 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 15 with 148 rules applied. Total rules applied 4834 place count 580 transition count 1080
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 15 with 43 rules applied. Total rules applied 4877 place count 580 transition count 1037
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 4889 place count 568 transition count 1012
Iterating global reduction 16 with 12 rules applied. Total rules applied 4901 place count 568 transition count 1012
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 16 with 71 rules applied. Total rules applied 4972 place count 568 transition count 941
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 4974 place count 566 transition count 939
Iterating global reduction 16 with 2 rules applied. Total rules applied 4976 place count 566 transition count 939
Free-agglomeration rule applied 37 times.
Iterating global reduction 16 with 37 rules applied. Total rules applied 5013 place count 566 transition count 902
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 16 with 37 rules applied. Total rules applied 5050 place count 529 transition count 902
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 5053 place count 529 transition count 899
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 5055 place count 529 transition count 898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 5057 place count 527 transition count 898
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 5058 place count 527 transition count 897
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 18 with 28 rules applied. Total rules applied 5086 place count 527 transition count 897
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 5089 place count 527 transition count 894
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 5092 place count 527 transition count 894
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 5093 place count 526 transition count 893
Applied a total of 5093 rules in 759 ms. Remains 526 /3554 variables (removed 3028) and now considering 893/4263 (removed 3370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 526/3554 places, 893/4263 transitions.
RANDOM walk for 40000 steps (1521 resets) in 621 ms. (64 steps per ms) remains 9/15 properties
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (264 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (262 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (174 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (268 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (277 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (277 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (250 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (277 resets) in 54 ms. (727 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (40 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
[2024-05-31 20:34:19] [INFO ] Flow matrix only has 887 transitions (discarded 6 similar events)
// Phase 1: matrix 887 rows 526 cols
[2024-05-31 20:34:19] [INFO ] Computed 1 invariants in 13 ms
[2024-05-31 20:34:19] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 65/294 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 809/1103 variables, 294/295 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1103 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 289/1392 variables, 212/509 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1392 variables, 3/512 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1392 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem CloudReconfiguration-PT-402-ReachabilityFireability-2024-15 is UNSAT
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 21/1413 variables, 20/532 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1413 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1413 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1413/1413 variables, and 532 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 526/526 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 69/276 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 763/1039 variables, 276/277 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 2/279 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 320/1359 variables, 209/488 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 3/491 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1359 variables, 8/499 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1359 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 47/1406 variables, 36/535 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1406 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 6/1412 variables, 4/539 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1412 variables, 0/539 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 1/1413 variables, 1/540 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1413 variables, 0/540 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1413 variables, 0/540 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1413/1413 variables, and 540 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3956 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 526/526 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 5287ms problems are : Problem set: 1 solved, 8 unsolved
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 11215 ms.
Support contains 156 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 893/893 transitions.
Graph (trivial) has 295 edges and 526 vertex of which 54 / 526 are part of one of the 23 SCC in 1 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Graph (complete) has 1057 edges and 495 vertex of which 494 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 494 transition count 792
Reduce places removed 40 places and 0 transitions.
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 1 with 46 rules applied. Total rules applied 89 place count 454 transition count 786
Reduce places removed 1 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 23 rules applied. Total rules applied 112 place count 453 transition count 764
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 141 place count 431 transition count 757
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 141 place count 431 transition count 746
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 163 place count 420 transition count 746
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 167 place count 416 transition count 742
Iterating global reduction 4 with 4 rules applied. Total rules applied 171 place count 416 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 416 transition count 741
Performed 33 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 238 place count 383 transition count 706
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 247 place count 383 transition count 697
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 251 place count 379 transition count 692
Iterating global reduction 6 with 4 rules applied. Total rules applied 255 place count 379 transition count 692
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 256 place count 379 transition count 691
Performed 11 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 278 place count 368 transition count 696
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 296 place count 368 transition count 678
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 298 place count 366 transition count 674
Iterating global reduction 8 with 2 rules applied. Total rules applied 300 place count 366 transition count 674
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 301 place count 365 transition count 672
Iterating global reduction 8 with 1 rules applied. Total rules applied 302 place count 365 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 304 place count 364 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 305 place count 364 transition count 686
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 9 with 23 rules applied. Total rules applied 328 place count 364 transition count 663
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 329 place count 363 transition count 662
Iterating global reduction 9 with 1 rules applied. Total rules applied 330 place count 363 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 332 place count 362 transition count 667
Free-agglomeration rule applied 16 times.
Iterating global reduction 9 with 16 rules applied. Total rules applied 348 place count 362 transition count 651
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 364 place count 346 transition count 651
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 368 place count 346 transition count 647
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 384 place count 346 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 385 place count 346 transition count 646
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 386 place count 345 transition count 645
Iterating global reduction 11 with 1 rules applied. Total rules applied 387 place count 345 transition count 645
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 388 place count 345 transition count 645
Applied a total of 388 rules in 175 ms. Remains 345 /526 variables (removed 181) and now considering 645/893 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 345/526 places, 645/893 transitions.
RANDOM walk for 40000 steps (1728 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (310 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (302 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (308 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (284 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 608573 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 4
Probabilistic random walk after 608573 steps, saw 129705 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-05-31 20:34:39] [INFO ] Flow matrix only has 633 transitions (discarded 12 similar events)
// Phase 1: matrix 633 rows 345 cols
[2024-05-31 20:34:39] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 20:34:39] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 114/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 619/889 variables, 270/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/889 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/889 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 88/977 variables, 74/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/978 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/978 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 978/978 variables, and 353 constraints, problems are : Problem set: 0 solved, 4 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 345/345 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 114/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 619/889 variables, 270/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/889 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/889 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 88/977 variables, 74/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/978 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/978 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 978/978 variables, and 357 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 345/345 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1827ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1254 ms.
Support contains 133 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 645/645 transitions.
Graph (trivial) has 78 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 342 transition count 631
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 334 transition count 628
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 331 transition count 627
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 24 place count 331 transition count 623
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 32 place count 327 transition count 623
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 325 transition count 619
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 325 transition count 619
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 52 place count 317 transition count 611
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 315 transition count 609
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 315 transition count 609
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 66 place count 310 transition count 625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 310 transition count 624
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 69 place count 308 transition count 620
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 308 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 308 transition count 619
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 79 place count 308 transition count 612
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 308 transition count 611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 307 transition count 611
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 84 place count 307 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 85 place count 307 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 86 place count 306 transition count 609
Iterating global reduction 7 with 1 rules applied. Total rules applied 87 place count 306 transition count 609
Applied a total of 87 rules in 91 ms. Remains 306 /345 variables (removed 39) and now considering 609/645 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 306/345 places, 609/645 transitions.
RANDOM walk for 40000 steps (1718 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (320 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (314 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (296 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 711591 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 3
Probabilistic random walk after 711591 steps, saw 149443 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
[2024-05-31 20:34:45] [INFO ] Flow matrix only has 595 transitions (discarded 14 similar events)
// Phase 1: matrix 595 rows 306 cols
[2024-05-31 20:34:45] [INFO ] Computed 3 invariants in 6 ms
[2024-05-31 20:34:45] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 581/817 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 83/900 variables, 69/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/901 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/901 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 315 constraints, problems are : Problem set: 0 solved, 3 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 306/306 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 581/817 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 83/900 variables, 69/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/900 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/901 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/901 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 901/901 variables, and 318 constraints, problems are : Problem set: 0 solved, 3 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 306/306 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1468ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 416 ms.
Support contains 100 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 609/609 transitions.
Graph (trivial) has 113 edges and 306 vertex of which 20 / 306 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 296 transition count 577
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 285 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 283 transition count 573
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 29 place count 283 transition count 570
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 280 transition count 570
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 278 transition count 567
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 278 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 278 transition count 566
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 64 place count 266 transition count 553
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 71 place count 266 transition count 546
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 72 place count 265 transition count 545
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 265 transition count 545
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 5 with 2 rules applied. Total rules applied 75 place count 264 transition count 544
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 76 place count 264 transition count 543
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 82 place count 261 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 83 place count 261 transition count 542
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 85 place count 259 transition count 538
Iterating global reduction 7 with 2 rules applied. Total rules applied 87 place count 259 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 97 place count 259 transition count 528
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 98 place count 258 transition count 527
Iterating global reduction 7 with 1 rules applied. Total rules applied 99 place count 258 transition count 527
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 102 place count 258 transition count 524
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 105 place count 255 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 106 place count 255 transition count 523
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 110 place count 255 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 111 place count 255 transition count 522
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 112 place count 255 transition count 522
Applied a total of 112 rules in 110 ms. Remains 255 /306 variables (removed 51) and now considering 522/609 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 255/306 places, 522/609 transitions.
RANDOM walk for 40000 steps (1768 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (335 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (316 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 873634 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 2
Probabilistic random walk after 873634 steps, saw 178315 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2024-05-31 20:34:50] [INFO ] Flow matrix only has 508 transitions (discarded 14 similar events)
// Phase 1: matrix 508 rows 255 cols
[2024-05-31 20:34:50] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 20:34:50] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 93/193 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 493/686 variables, 193/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 76/762 variables, 61/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/762 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/763 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/763 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/763 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 255/255 constraints, ReadFeed: 6/6 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/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 93/193 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 493/686 variables, 193/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 76/762 variables, 61/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/762 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/763 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/763 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/763 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/763 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 255/255 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 86 ms.
Support contains 57 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 522/522 transitions.
Graph (trivial) has 163 edges and 255 vertex of which 20 / 255 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 245 transition count 485
Reduce places removed 17 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 24 rules applied. Total rules applied 42 place count 228 transition count 478
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 50 place count 221 transition count 477
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 50 place count 221 transition count 473
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 217 transition count 473
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 61 place count 214 transition count 468
Iterating global reduction 3 with 3 rules applied. Total rules applied 64 place count 214 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 214 transition count 467
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 101 place count 196 transition count 448
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 110 place count 196 transition count 439
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 195 transition count 437
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 195 transition count 437
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 5 with 2 rules applied. Total rules applied 114 place count 194 transition count 436
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 117 place count 194 transition count 433
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 129 place count 188 transition count 437
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 135 place count 188 transition count 431
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 137 place count 186 transition count 427
Iterating global reduction 7 with 2 rules applied. Total rules applied 139 place count 186 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 140 place count 186 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 8 with 35 rules applied. Total rules applied 175 place count 186 transition count 391
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 176 place count 185 transition count 390
Iterating global reduction 8 with 1 rules applied. Total rules applied 177 place count 185 transition count 390
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 181 place count 185 transition count 386
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 187 place count 181 transition count 384
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 188 place count 181 transition count 383
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 189 place count 181 transition count 383
Applied a total of 189 rules in 38 ms. Remains 181 /255 variables (removed 74) and now considering 383/522 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 181/255 places, 383/522 transitions.
RANDOM walk for 40000 steps (1960 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (354 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1598722 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :0 out of 1
Probabilistic random walk after 1598722 steps, saw 286099 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :0
[2024-05-31 20:34:55] [INFO ] Flow matrix only has 368 transitions (discarded 15 similar events)
// Phase 1: matrix 368 rows 181 cols
[2024-05-31 20:34:55] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 20:34:55] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 352/481 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 67/548 variables, 51/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/549 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/549 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 352/481 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 67/548 variables, 51/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/549 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/549 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 57 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 181/181 places, 383/383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2024-05-31 20:34:55] [INFO ] Flow matrix only has 368 transitions (discarded 15 similar events)
[2024-05-31 20:34:55] [INFO ] Invariant cache hit.
[2024-05-31 20:34:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:34:55] [INFO ] Flow matrix only has 368 transitions (discarded 15 similar events)
[2024-05-31 20:34:55] [INFO ] Invariant cache hit.
[2024-05-31 20:34:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:34:55] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [67, 151, 174]
Discarding 3 places :
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 240 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 178/181 places, 381/383 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 177 transition count 380
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 0 with 2 rules applied. Total rules applied 4 place count 176 transition count 381
Applied a total of 4 rules in 8 ms. Remains 176 /178 variables (removed 2) and now considering 381/381 (removed 0) transitions.
[2024-05-31 20:34:55] [INFO ] Flow matrix only has 366 transitions (discarded 15 similar events)
// Phase 1: matrix 366 rows 176 cols
[2024-05-31 20:34:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:34:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:34:55] [INFO ] Flow matrix only has 366 transitions (discarded 15 similar events)
[2024-05-31 20:34:55] [INFO ] Invariant cache hit.
[2024-05-31 20:34:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:34:56] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 176/181 places, 381/383 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 452 ms. Remains : 176/181 places, 381/383 transitions.
RANDOM walk for 40000 steps (1964 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (354 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1504495 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :0 out of 1
Probabilistic random walk after 1504495 steps, saw 315411 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :0
[2024-05-31 20:34:59] [INFO ] Flow matrix only has 366 transitions (discarded 15 similar events)
[2024-05-31 20:34:59] [INFO ] Invariant cache hit.
[2024-05-31 20:34:59] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/457 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/542 variables, 62/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/542 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 5/5 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/457 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/542 variables, 62/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/542 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 57 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 381/381 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 176/176 places, 381/381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 381/381 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 381/381 (removed 0) transitions.
[2024-05-31 20:34:59] [INFO ] Flow matrix only has 366 transitions (discarded 15 similar events)
[2024-05-31 20:34:59] [INFO ] Invariant cache hit.
[2024-05-31 20:34:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:34:59] [INFO ] Flow matrix only has 366 transitions (discarded 15 similar events)
[2024-05-31 20:34:59] [INFO ] Invariant cache hit.
[2024-05-31 20:34:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:34:59] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-31 20:34:59] [INFO ] Redundant transitions in 40 ms returned []
Running 376 sub problems to find dead transitions.
[2024-05-31 20:34:59] [INFO ] Flow matrix only has 366 transitions (discarded 15 similar events)
[2024-05-31 20:34:59] [INFO ] Invariant cache hit.
[2024-05-31 20:34:59] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (OVERLAPS) 366/541 variables, 175/177 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 5/182 constraints. Problems are: Problem set: 3 solved, 373 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 7 (OVERLAPS) 1/542 variables, 1/183 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 9 (OVERLAPS) 0/542 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 183 constraints, problems are : Problem set: 3 solved, 373 unsolved in 15472 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 366/541 variables, 175/177 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 5/182 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 294/476 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/476 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 8 (OVERLAPS) 1/542 variables, 1/477 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 79/556 constraints. Problems are: Problem set: 3 solved, 373 unsolved
[2024-05-31 20:35:28] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 1/557 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/557 constraints. Problems are: Problem set: 3 solved, 373 unsolved
At refinement iteration 12 (OVERLAPS) 0/542 variables, 0/557 constraints. Problems are: Problem set: 3 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 557 constraints, problems are : Problem set: 3 solved, 373 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 373/376 constraints, Known Traps: 1/1 constraints]
After SMT, in 45840ms problems are : Problem set: 3 solved, 373 unsolved
Search for dead transitions found 3 dead transitions in 45845ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 176/176 places, 378/381 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 175 transition count 383
Applied a total of 2 rules in 14 ms. Remains 175 /176 variables (removed 1) and now considering 383/378 (removed -5) transitions.
[2024-05-31 20:35:45] [INFO ] Flow matrix only has 368 transitions (discarded 15 similar events)
// Phase 1: matrix 368 rows 175 cols
[2024-05-31 20:35:45] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 20:35:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 20:35:45] [INFO ] Flow matrix only has 368 transitions (discarded 15 similar events)
[2024-05-31 20:35:45] [INFO ] Invariant cache hit.
[2024-05-31 20:35:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:35:45] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 175/176 places, 383/381 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46362 ms. Remains : 175/176 places, 383/381 transitions.
RANDOM walk for 40000 steps (1931 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (310 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1571065 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :0 out of 1
Probabilistic random walk after 1571065 steps, saw 332307 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :0
[2024-05-31 20:35:49] [INFO ] Flow matrix only has 368 transitions (discarded 15 similar events)
[2024-05-31 20:35:49] [INFO ] Invariant cache hit.
[2024-05-31 20:35:49] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/484 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 59/543 variables, 47/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/543 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, ReadFeed: 5/5 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/484 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 59/543 variables, 47/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/543 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 456 steps, including 16 resets, run visited all 1 properties in 5 ms. (steps per millisecond=91 )
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 106503 ms.
ITS solved all properties within timeout

BK_STOP 1717187749660

--------------------
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

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

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