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.r091-tall-171624187400287.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 greatspnxred
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 r091-tall-171624187400287
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:59:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 07:59:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:59:12] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-05-21 07:59:12] [INFO ] Transformed 3554 places.
[2024-05-21 07:59:12] [INFO ] Transformed 4263 transitions.
[2024-05-21 07:59:12] [INFO ] Found NUPN structural information;
[2024-05-21 07:59:12] [INFO ] Parsed PT model containing 3554 places and 4263 transitions and 8889 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (227 resets) in 2063 ms. (19 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 144 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 146 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 210 ms. (18 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 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 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 155516 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 15
Probabilistic random walk after 155516 steps, saw 41052 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 4263 rows 3554 cols
[2024-05-21 07:59:16] [INFO ] Computed 5 invariants in 62 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
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 5061 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
At refinement iteration 6 (INCLUDED_ONLY) 0/7792 variables, 15/7102 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 10415ms 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 12 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.6 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 2 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 2 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 792 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 802 ms. Remains : 526/3554 places, 893/4263 transitions.
RANDOM walk for 40000 steps (1558 resets) in 810 ms. (49 steps per ms) remains 7/15 properties
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (273 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (251 resets) in 151 ms. (263 steps per ms) remains 6/7 properties
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (278 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (285 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (252 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (37 resets) in 117 ms. (338 steps per ms) remains 6/6 properties
[2024-05-21 07:59:28] [INFO ] Flow matrix only has 887 transitions (discarded 6 similar events)
// Phase 1: matrix 887 rows 526 cols
[2024-05-21 07:59:28] [INFO ] Computed 1 invariants in 6 ms
[2024-05-21 07:59:28] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/282 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 777/1059 variables, 282/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1059 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 320/1379 variables, 214/499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1379 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1379 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 6 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) 34/1413 variables, 30/532 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1413 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1413 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1413/1413 variables, and 532 constraints, problems are : Problem set: 1 solved, 5 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 526/526 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 71/264 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 731/995 variables, 264/265 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/995 variables, 2/267 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/995 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 351/1346 variables, 211/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1346 variables, 3/481 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1346 variables, 5/486 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1346 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 60/1406 variables, 46/532 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1406 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/1412 variables, 4/536 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1412 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/1413 variables, 1/537 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1413 variables, 0/537 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1413 variables, 0/537 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1413/1413 variables, and 537 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2956 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 526/526 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3990ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 0 properties in 3851 ms.
Support contains 193 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 893/893 transitions.
Graph (trivial) has 183 edges and 526 vertex of which 32 / 526 are part of one of the 14 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 1080 edges and 508 vertex of which 507 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 507 transition count 827
Reduce places removed 29 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 1 with 32 rules applied. Total rules applied 64 place count 478 transition count 824
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 78 place count 477 transition count 811
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 96 place count 464 transition count 806
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 96 place count 464 transition count 800
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 108 place count 458 transition count 800
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 457 transition count 799
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 457 transition count 799
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 457 transition count 798
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 149 place count 438 transition count 779
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 154 place count 438 transition count 774
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 158 place count 434 transition count 769
Iterating global reduction 6 with 4 rules applied. Total rules applied 162 place count 434 transition count 769
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 163 place count 434 transition count 768
Performed 7 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 177 place count 427 transition count 773
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 190 place count 427 transition count 760
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 191 place count 426 transition count 758
Iterating global reduction 8 with 1 rules applied. Total rules applied 192 place count 426 transition count 758
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 208 place count 426 transition count 742
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 209 place count 425 transition count 741
Iterating global reduction 8 with 1 rules applied. Total rules applied 210 place count 425 transition count 741
Free-agglomeration rule applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 223 place count 425 transition count 728
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 236 place count 412 transition count 728
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 239 place count 412 transition count 725
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 250 place count 412 transition count 725
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 252 place count 412 transition count 723
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 254 place count 412 transition count 723
Applied a total of 254 rules in 192 ms. Remains 412 /526 variables (removed 114) and now considering 723/893 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 412/526 places, 723/893 transitions.
RANDOM walk for 40000 steps (1616 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (297 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (293 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (285 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (284 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (260 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 604848 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :1 out of 5
Probabilistic random walk after 604848 steps, saw 126256 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :1
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-21 07:59:40] [INFO ] Flow matrix only has 713 transitions (discarded 10 similar events)
// Phase 1: matrix 713 rows 412 cols
[2024-05-21 07:59:40] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 07:59:40] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 100/261 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 640/901 variables, 261/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 205/1106 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1106 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1106 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 18/1124 variables, 16/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1125 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1125 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1125 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 419 constraints, problems are : Problem set: 0 solved, 4 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 412/412 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/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 100/261 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 640/901 variables, 261/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 205/1106 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1106 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1106 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1106 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 18/1124 variables, 16/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/1125 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1125 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1125 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 423 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 412/412 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2520ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1563 ms.
Support contains 124 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 723/723 transitions.
Graph (trivial) has 211 edges and 412 vertex of which 43 / 412 are part of one of the 19 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 388 transition count 657
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 35 rules applied. Total rules applied 57 place count 367 transition count 643
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 69 place count 356 transition count 642
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 69 place count 356 transition count 634
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 85 place count 348 transition count 634
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 93 place count 340 transition count 624
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 340 transition count 624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 340 transition count 623
Performed 23 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 148 place count 317 transition count 596
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 160 place count 317 transition count 584
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 163 place count 314 transition count 579
Iterating global reduction 5 with 3 rules applied. Total rules applied 166 place count 314 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 314 transition count 578
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 169 place count 312 transition count 575
Iterating global reduction 6 with 2 rules applied. Total rules applied 171 place count 312 transition count 575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 172 place count 312 transition count 574
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 188 place count 304 transition count 574
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 195 place count 304 transition count 567
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 197 place count 302 transition count 563
Iterating global reduction 8 with 2 rules applied. Total rules applied 199 place count 302 transition count 563
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 201 place count 301 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 202 place count 301 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 223 place count 301 transition count 556
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 224 place count 300 transition count 555
Iterating global reduction 9 with 1 rules applied. Total rules applied 225 place count 300 transition count 555
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 230 place count 300 transition count 550
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 235 place count 295 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 236 place count 295 transition count 549
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 246 place count 295 transition count 549
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 247 place count 295 transition count 548
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 248 place count 294 transition count 547
Iterating global reduction 11 with 1 rules applied. Total rules applied 249 place count 294 transition count 547
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 250 place count 294 transition count 546
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 251 place count 294 transition count 546
Applied a total of 251 rules in 124 ms. Remains 294 /412 variables (removed 118) and now considering 546/723 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 294/412 places, 546/723 transitions.
RANDOM walk for 40000 steps (1719 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (346 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (326 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (320 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 688534 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 3
Probabilistic random walk after 688534 steps, saw 154985 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
[2024-05-21 07:59:47] [INFO ] Flow matrix only has 535 transitions (discarded 11 similar events)
// Phase 1: matrix 535 rows 294 cols
[2024-05-21 07:59:47] [INFO ] Computed 3 invariants in 6 ms
[2024-05-21 07:59:47] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 102/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 519/745 variables, 226/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/745 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 83/828 variables, 67/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/829 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/829 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/829 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 829/829 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 294/294 constraints, ReadFeed: 5/5 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 102/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 519/745 variables, 226/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/745 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 83/828 variables, 67/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/829 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/829 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/829 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 829/829 variables, and 305 constraints, problems are : Problem set: 0 solved, 3 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 294/294 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 390 ms.
Support contains 100 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 546/546 transitions.
Graph (trivial) has 82 edges and 294 vertex of which 8 / 294 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 290 transition count 529
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 13 rules applied. Total rules applied 23 place count 281 transition count 525
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 28 place count 277 transition count 524
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 28 place count 277 transition count 520
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 36 place count 273 transition count 520
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 271 transition count 516
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 271 transition count 516
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 54 place count 264 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 262 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 262 transition count 507
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
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 68 place count 257 transition count 521
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 257 transition count 519
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 72 place count 255 transition count 515
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 255 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 255 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 81 place count 255 transition count 508
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 255 transition count 507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 83 place count 254 transition count 507
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 86 place count 254 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 87 place count 254 transition count 506
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 88 place count 253 transition count 505
Iterating global reduction 7 with 1 rules applied. Total rules applied 89 place count 253 transition count 505
Applied a total of 89 rules in 65 ms. Remains 253 /294 variables (removed 41) and now considering 505/546 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 253/294 places, 505/546 transitions.
RANDOM walk for 40000 steps (1799 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (346 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (339 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 887566 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 2
Probabilistic random walk after 887566 steps, saw 191282 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2024-05-21 07:59:52] [INFO ] Flow matrix only has 491 transitions (discarded 14 similar events)
// Phase 1: matrix 491 rows 253 cols
[2024-05-21 07:59:52] [INFO ] Computed 3 invariants in 4 ms
[2024-05-21 07:59:52] [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) 91/191 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 474/665 variables, 191/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 78/743 variables, 61/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/744 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/744 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 262 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 253/253 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) 91/191 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 474/665 variables, 191/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 78/743 variables, 61/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/744 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/744 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 253/253 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1038ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 100 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 505/505 transitions.
Applied a total of 0 rules in 6 ms. Remains 253 /253 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 253/253 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 505/505 transitions.
Applied a total of 0 rules in 6 ms. Remains 253 /253 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-21 07:59:53] [INFO ] Flow matrix only has 491 transitions (discarded 14 similar events)
[2024-05-21 07:59:53] [INFO ] Invariant cache hit.
[2024-05-21 07:59:54] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-21 07:59:54] [INFO ] Flow matrix only has 491 transitions (discarded 14 similar events)
[2024-05-21 07:59:54] [INFO ] Invariant cache hit.
[2024-05-21 07:59:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 07:59:54] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [92, 203, 246]
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 571 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/253 places, 503/505 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 248 transition count 508
Applied a total of 4 rules in 9 ms. Remains 248 /250 variables (removed 2) and now considering 508/503 (removed -5) transitions.
[2024-05-21 07:59:54] [INFO ] Flow matrix only has 494 transitions (discarded 14 similar events)
// Phase 1: matrix 494 rows 248 cols
[2024-05-21 07:59:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 07:59:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 07:59:54] [INFO ] Flow matrix only has 494 transitions (discarded 14 similar events)
[2024-05-21 07:59:54] [INFO ] Invariant cache hit.
[2024-05-21 07:59:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 07:59:54] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 248/253 places, 508/505 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 829 ms. Remains : 248/253 places, 508/505 transitions.
RANDOM walk for 40000 steps (1754 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (322 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (313 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 827184 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 2
Probabilistic random walk after 827184 steps, saw 184745 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
[2024-05-21 07:59:57] [INFO ] Flow matrix only has 494 transitions (discarded 14 similar events)
[2024-05-21 07:59:57] [INFO ] Invariant cache hit.
[2024-05-21 07:59:57] [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) 69/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 474/643 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 99/742 variables, 79/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/742 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 742/742 variables, and 256 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 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) 69/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 474/643 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 99/742 variables, 79/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/742 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 742/742 variables, and 258 constraints, problems are : Problem set: 0 solved, 2 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 885ms 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 41 ms.
Support contains 57 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 508/508 transitions.
Graph (trivial) has 156 edges and 248 vertex of which 20 / 248 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 238 transition count 471
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 221 transition count 464
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 214 transition count 463
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 50 place count 214 transition count 458
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 60 place count 209 transition count 458
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 63 place count 206 transition count 453
Iterating global reduction 3 with 3 rules applied. Total rules applied 66 place count 206 transition count 453
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 206 transition count 452
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 105 place count 187 transition count 431
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 114 place count 187 transition count 422
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 115 place count 186 transition count 420
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 186 transition count 420
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 126 place count 181 transition count 421
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 130 place count 181 transition count 417
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 132 place count 179 transition count 413
Iterating global reduction 6 with 2 rules applied. Total rules applied 134 place count 179 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 135 place count 179 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 7 with 39 rules applied. Total rules applied 174 place count 179 transition count 373
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 175 place count 178 transition count 372
Iterating global reduction 7 with 1 rules applied. Total rules applied 176 place count 178 transition count 372
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 180 place count 178 transition count 368
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 186 place count 174 transition count 366
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 187 place count 174 transition count 365
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 189 place count 174 transition count 365
Applied a total of 189 rules in 39 ms. Remains 174 /248 variables (removed 74) and now considering 365/508 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 174/248 places, 365/508 transitions.
RANDOM walk for 40000 steps (1980 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (332 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1853810 steps, run timeout after 3001 ms. (steps per millisecond=617 ) properties seen :0 out of 1
Probabilistic random walk after 1853810 steps, saw 418625 distinct states, run finished after 3001 ms. (steps per millisecond=617 ) properties seen :0
[2024-05-21 08:00:01] [INFO ] Flow matrix only has 351 transitions (discarded 14 similar events)
// Phase 1: matrix 351 rows 174 cols
[2024-05-21 08:00:01] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 08:00:01] [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) 329/443 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/525 variables, 60/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/525 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 174/174 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) 329/443 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/525 variables, 60/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/525 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 57 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 365/365 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 174/174 places, 365/365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 365/365 transitions.
Applied a total of 0 rules in 10 ms. Remains 174 /174 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2024-05-21 08:00:02] [INFO ] Flow matrix only has 351 transitions (discarded 14 similar events)
[2024-05-21 08:00:02] [INFO ] Invariant cache hit.
[2024-05-21 08:00:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 08:00:02] [INFO ] Flow matrix only has 351 transitions (discarded 14 similar events)
[2024-05-21 08:00:02] [INFO ] Invariant cache hit.
[2024-05-21 08:00:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 08:00:02] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 08:00:02] [INFO ] Redundant transitions in 40 ms returned []
Running 360 sub problems to find dead transitions.
[2024-05-21 08:00:02] [INFO ] Flow matrix only has 351 transitions (discarded 14 similar events)
[2024-05-21 08:00:02] [INFO ] Invariant cache hit.
[2024-05-21 08:00:02] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 4 (OVERLAPS) 351/524 variables, 173/175 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 5/180 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 7 (OVERLAPS) 1/525 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 0/525 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 181 constraints, problems are : Problem set: 3 solved, 357 unsolved in 16958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/173 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 351/524 variables, 173/175 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 5/180 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 280/460 constraints. Problems are: Problem set: 3 solved, 357 unsolved
[2024-05-21 08:00:24] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 6 ms to minimize.
[2024-05-21 08:00:26] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 2/462 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/462 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 1/525 variables, 1/463 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 77/540 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 0/540 constraints. Problems are: Problem set: 3 solved, 357 unsolved
At refinement iteration 12 (OVERLAPS) 0/525 variables, 0/540 constraints. Problems are: Problem set: 3 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 540 constraints, problems are : Problem set: 3 solved, 357 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 357/360 constraints, Known Traps: 2/2 constraints]
After SMT, in 47271ms problems are : Problem set: 3 solved, 357 unsolved
Search for dead transitions found 3 dead transitions in 47277ms
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 : 174/174 places, 362/365 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 173 transition count 367
Applied a total of 2 rules in 6 ms. Remains 173 /174 variables (removed 1) and now considering 367/362 (removed -5) transitions.
[2024-05-21 08:00:50] [INFO ] Flow matrix only has 353 transitions (discarded 14 similar events)
// Phase 1: matrix 353 rows 173 cols
[2024-05-21 08:00:50] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 08:00:50] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 08:00:50] [INFO ] Flow matrix only has 353 transitions (discarded 14 similar events)
[2024-05-21 08:00:50] [INFO ] Invariant cache hit.
[2024-05-21 08:00:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 08:00:50] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 173/174 places, 367/365 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 47891 ms. Remains : 173/174 places, 367/365 transitions.
RANDOM walk for 40000 steps (1928 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (332 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1761290 steps, run timeout after 3001 ms. (steps per millisecond=586 ) properties seen :0 out of 1
Probabilistic random walk after 1761290 steps, saw 393282 distinct states, run finished after 3001 ms. (steps per millisecond=586 ) properties seen :0
[2024-05-21 08:00:53] [INFO ] Flow matrix only has 353 transitions (discarded 14 similar events)
[2024-05-21 08:00:53] [INFO ] Invariant cache hit.
[2024-05-21 08:00:53] [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) 69/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 340/466 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/526 variables, 47/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/526 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 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) 69/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 340/466 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/526 variables, 47/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/526 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 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
Parikh walk visited 0 properties in 11 ms.
Support contains 57 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 367/367 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 173/173 places, 367/367 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 367/367 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-21 08:00:53] [INFO ] Flow matrix only has 353 transitions (discarded 14 similar events)
[2024-05-21 08:00:53] [INFO ] Invariant cache hit.
[2024-05-21 08:00:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 08:00:54] [INFO ] Flow matrix only has 353 transitions (discarded 14 similar events)
[2024-05-21 08:00:54] [INFO ] Invariant cache hit.
[2024-05-21 08:00:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 08:00:54] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-21 08:00:54] [INFO ] Redundant transitions in 48 ms returned []
Running 354 sub problems to find dead transitions.
[2024-05-21 08:00:54] [INFO ] Flow matrix only has 353 transitions (discarded 14 similar events)
[2024-05-21 08:00:54] [INFO ] Invariant cache hit.
[2024-05-21 08:00:54] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (OVERLAPS) 353/525 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 354 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (OVERLAPS) 1/526 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 9 (OVERLAPS) 0/526 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 181 constraints, problems are : Problem set: 0 solved, 354 unsolved in 14369 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (OVERLAPS) 353/525 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 277/457 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-21 08:01:14] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 9 (OVERLAPS) 1/526 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 77/536 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 12 (OVERLAPS) 0/526 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 536 constraints, problems are : Problem set: 0 solved, 354 unsolved in 28110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 1/1 constraints]
After SMT, in 42858ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 42862ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43186 ms. Remains : 173/173 places, 367/367 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 173 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 172 transition count 352
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 168 transition count 348
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 168 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 168 transition count 346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 166 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 166 transition count 341
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 166 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 165 transition count 340
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 165 transition count 340
Applied a total of 36 rules in 19 ms. Remains 165 /173 variables (removed 8) and now considering 340/367 (removed 27) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 340 rows 165 cols
[2024-05-21 08:01:37] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 08:01:37] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:01:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 08:01:37] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 08:01:37] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 08:01:37] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 606 ms.
[2024-05-21 08:01:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 26 ms.
[2024-05-21 08:01:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 367 transitions and 1106 arcs took 13 ms.
[2024-05-21 08:01:38] [INFO ] Flatten gal took : 67 ms
Total runtime 145952 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-402

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 173
TRANSITIONS: 367
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 682
MODEL NAME: /home/mcc/execution/411/model
173 places, 367 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-402-ReachabilityFireability-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716280594385

--------------------
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
MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r091-tall-171624187400287"
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 ;