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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 19:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 19:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 19:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 661K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-319-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716275449197

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-319
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:10:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 07:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:10:50] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-21 07:10:50] [INFO ] Transformed 2587 places.
[2024-05-21 07:10:50] [INFO ] Transformed 3099 transitions.
[2024-05-21 07:10:50] [INFO ] Found NUPN structural information;
[2024-05-21 07:10:50] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 281 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 (478 resets) in 1904 ms. (20 steps per ms) remains 15/16 properties
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4003 steps (18 resets) in 188 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (21 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (17 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (14 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (19 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (18 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 188549 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 15
Probabilistic random walk after 188549 steps, saw 56198 distinct states, run finished after 3005 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 3099 rows 2587 cols
[2024-05-21 07:10:54] [INFO ] Computed 4 invariants in 52 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2355/2576 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2576 variables, 2355/2580 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2576 variables, 0/2580 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3089/5665 variables, 2576/5156 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5665 variables, 0/5156 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/5667 variables, 1/5157 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5667 variables, 1/5158 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5667/5686 variables, and 5158 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5043 ms.
Refiners :[Domain max(s): 2577/2587 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2577/2587 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/221 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2355/2576 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2576 variables, 2355/2580 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2576 variables, 0/2580 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3089/5665 variables, 2576/5156 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5665 variables, 15/5171 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5665/5686 variables, and 5171 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5031 ms.
Refiners :[Domain max(s): 2576/2587 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2576/2587 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 10397ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 221 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2413 edges and 2587 vertex of which 356 / 2587 are part of one of the 38 SCC in 10 ms
Free SCC test removed 318 places
Drop transitions (Empty/Sink Transition effects.) removed 390 transitions
Reduce isomorphic transitions removed 390 transitions.
Graph (complete) has 2995 edges and 2269 vertex of which 2255 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.7 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1094 transitions
Trivial Post-agglo rules discarded 1094 transitions
Performed 1094 trivial Post agglomeration. Transition count delta: 1094
Iterating post reduction 0 with 1100 rules applied. Total rules applied 1102 place count 2255 transition count 1600
Reduce places removed 1094 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 1164 rules applied. Total rules applied 2266 place count 1161 transition count 1530
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 32 rules applied. Total rules applied 2298 place count 1134 transition count 1525
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 2304 place count 1132 transition count 1521
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 8 rules applied. Total rules applied 2312 place count 1130 transition count 1515
Reduce places removed 4 places and 0 transitions.
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Iterating post reduction 5 with 180 rules applied. Total rules applied 2492 place count 1126 transition count 1339
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 193 rules applied. Total rules applied 2685 place count 950 transition count 1322
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2689 place count 946 transition count 1322
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 35 Pre rules applied. Total rules applied 2689 place count 946 transition count 1287
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 2759 place count 911 transition count 1287
Discarding 105 places :
Symmetric choice reduction at 8 with 105 rule applications. Total rules 2864 place count 806 transition count 1182
Iterating global reduction 8 with 105 rules applied. Total rules applied 2969 place count 806 transition count 1182
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 11 rules applied. Total rules applied 2980 place count 806 transition count 1171
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 2983 place count 804 transition count 1170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2984 place count 803 transition count 1170
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 2984 place count 803 transition count 1164
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 2996 place count 797 transition count 1164
Discarding 46 places :
Symmetric choice reduction at 11 with 46 rule applications. Total rules 3042 place count 751 transition count 1117
Iterating global reduction 11 with 46 rules applied. Total rules applied 3088 place count 751 transition count 1117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 14 rules applied. Total rules applied 3102 place count 751 transition count 1103
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 6 rules applied. Total rules applied 3108 place count 746 transition count 1102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3109 place count 745 transition count 1102
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 3114 place count 740 transition count 1094
Iterating global reduction 14 with 5 rules applied. Total rules applied 3119 place count 740 transition count 1094
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3120 place count 740 transition count 1093
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 3122 place count 738 transition count 1089
Iterating global reduction 15 with 2 rules applied. Total rules applied 3124 place count 738 transition count 1089
Performed 182 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 15 with 364 rules applied. Total rules applied 3488 place count 556 transition count 874
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 15 with 18 rules applied. Total rules applied 3506 place count 556 transition count 856
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3508 place count 555 transition count 855
Performed 61 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 16 with 122 rules applied. Total rules applied 3630 place count 494 transition count 899
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 16 with 31 rules applied. Total rules applied 3661 place count 494 transition count 868
Discarding 5 places :
Symmetric choice reduction at 17 with 5 rule applications. Total rules 3666 place count 489 transition count 858
Iterating global reduction 17 with 5 rules applied. Total rules applied 3671 place count 489 transition count 858
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 17 with 41 rules applied. Total rules applied 3712 place count 489 transition count 817
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3713 place count 488 transition count 816
Iterating global reduction 17 with 1 rules applied. Total rules applied 3714 place count 488 transition count 816
Free-agglomeration rule applied 42 times.
Iterating global reduction 17 with 42 rules applied. Total rules applied 3756 place count 488 transition count 774
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 43 rules applied. Total rules applied 3799 place count 446 transition count 773
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 18 with 7 rules applied. Total rules applied 3806 place count 446 transition count 766
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 18 with 30 rules applied. Total rules applied 3836 place count 446 transition count 766
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 3840 place count 446 transition count 762
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 18 with 6 rules applied. Total rules applied 3846 place count 446 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3847 place count 445 transition count 761
Applied a total of 3847 rules in 824 ms. Remains 445 /2587 variables (removed 2142) and now considering 761/3099 (removed 2338) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 841 ms. Remains : 445/2587 places, 761/3099 transitions.
RANDOM walk for 40000 steps (1979 resets) in 815 ms. (49 steps per ms) remains 8/15 properties
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (544 resets) in 116 ms. (341 steps per ms) remains 7/8 properties
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (580 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (498 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (534 resets) in 82 ms. (481 steps per ms) remains 6/7 properties
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (536 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (551 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (558 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
[2024-05-21 07:11:06] [INFO ] Flow matrix only has 757 transitions (discarded 4 similar events)
// Phase 1: matrix 757 rows 445 cols
[2024-05-21 07:11:06] [INFO ] Computed 2 invariants in 7 ms
[2024-05-21 07:11:06] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CloudReconfiguration-PT-319-ReachabilityFireability-2024-03 is UNSAT
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 173/286 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 599/885 variables, 286/288 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 2/290 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 212/1097 variables, 92/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1097 variables, 3/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 80/1177 variables, 49/434 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1177 variables, 0/434 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 19/1196 variables, 14/448 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1196 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 5/1201 variables, 3/451 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1201 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/1202 variables, 1/452 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1202 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 452 constraints, problems are : Problem set: 1 solved, 5 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 445/445 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/95 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 182/277 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 575/852 variables, 277/279 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/852 variables, 2/281 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 211/1063 variables, 86/367 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 3/370 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 5/375 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 96/1159 variables, 53/428 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1159 variables, 0/428 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 34/1193 variables, 22/450 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 07:11:08] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1193 variables, 1/451 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1193 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 8/1201 variables, 6/457 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1201 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/1202 variables, 1/458 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1202 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1202 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 458 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 445/445 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 3471ms problems are : Problem set: 1 solved, 5 unsolved
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1877 ms.
Support contains 94 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 761/761 transitions.
Graph (trivial) has 351 edges and 445 vertex of which 67 / 445 are part of one of the 26 SCC in 1 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 404 transition count 621
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 73 rules applied. Total rules applied 135 place count 343 transition count 609
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 22 rules applied. Total rules applied 157 place count 341 transition count 589
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 179 place count 323 transition count 585
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 179 place count 323 transition count 570
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 209 place count 308 transition count 570
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 218 place count 299 transition count 558
Iterating global reduction 4 with 9 rules applied. Total rules applied 227 place count 299 transition count 558
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 299 transition count 556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 298 transition count 554
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 298 transition count 554
Performed 37 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 305 place count 261 transition count 510
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 327 place count 261 transition count 488
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 329 place count 259 transition count 484
Iterating global reduction 6 with 2 rules applied. Total rules applied 331 place count 259 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 333 place count 258 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 334 place count 258 transition count 482
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 366 place count 242 transition count 524
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 387 place count 242 transition count 503
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 394 place count 235 transition count 485
Iterating global reduction 8 with 7 rules applied. Total rules applied 401 place count 235 transition count 485
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 403 place count 233 transition count 483
Iterating global reduction 8 with 2 rules applied. Total rules applied 405 place count 233 transition count 483
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 411 place count 233 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 438 place count 233 transition count 450
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 448 place count 233 transition count 440
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 458 place count 223 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 460 place count 223 transition count 438
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 463 place count 223 transition count 438
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 469 place count 223 transition count 438
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 470 place count 223 transition count 437
Applied a total of 470 rules in 130 ms. Remains 223 /445 variables (removed 222) and now considering 437/761 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 223/445 places, 437/761 transitions.
RANDOM walk for 40000 steps (3274 resets) in 180 ms. (220 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (113 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (718 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (624 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (760 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 832158 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :1 out of 4
Probabilistic random walk after 832158 steps, saw 176193 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :1
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-21 07:11:15] [INFO ] Flow matrix only has 430 transitions (discarded 7 similar events)
// Phase 1: matrix 430 rows 223 cols
[2024-05-21 07:11:15] [INFO ] Computed 2 invariants in 8 ms
[2024-05-21 07:11:15] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/162 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 399/561 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 84/645 variables, 54/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/653 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 230 constraints, problems are : Problem set: 0 solved, 3 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 223/223 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/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/162 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 399/561 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 84/645 variables, 54/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/653 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 07:11:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/653 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/653 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 234 constraints, problems are : Problem set: 0 solved, 3 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 223/223 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 315 ms.
Support contains 71 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 437/437 transitions.
Graph (trivial) has 79 edges and 223 vertex of which 19 / 223 are part of one of the 7 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 211 transition count 406
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 207 transition count 401
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 21 place count 202 transition count 399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 202 transition count 397
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 200 transition count 397
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 199 transition count 396
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 199 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 199 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 198 transition count 394
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 44 place count 191 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 46 place count 191 transition count 385
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 52 place count 188 transition count 402
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 61 place count 188 transition count 393
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 63 place count 186 transition count 385
Iterating global reduction 7 with 2 rules applied. Total rules applied 65 place count 186 transition count 385
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 67 place count 184 transition count 383
Iterating global reduction 7 with 2 rules applied. Total rules applied 69 place count 184 transition count 383
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 75 place count 184 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 82 place count 184 transition count 370
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 84 place count 184 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 86 place count 182 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 87 place count 182 transition count 367
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 88 place count 182 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 89 place count 182 transition count 366
Applied a total of 89 rules in 73 ms. Remains 182 /223 variables (removed 41) and now considering 366/437 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 182/223 places, 366/437 transitions.
RANDOM walk for 40000 steps (4458 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (50 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1092 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1130089 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 2
Probabilistic random walk after 1130089 steps, saw 231621 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
[2024-05-21 07:11:20] [INFO ] Flow matrix only has 358 transitions (discarded 8 similar events)
// Phase 1: matrix 358 rows 182 cols
[2024-05-21 07:11:20] [INFO ] Computed 2 invariants in 7 ms
[2024-05-21 07:11:20] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 344/477 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/539 variables, 48/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/540 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/540 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 344/477 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/539 variables, 48/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/540 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 07:11:20] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/540 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 803ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 142 ms.
Support contains 71 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 366/366 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 182/182 places, 366/366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 366/366 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-21 07:11:20] [INFO ] Flow matrix only has 358 transitions (discarded 8 similar events)
[2024-05-21 07:11:20] [INFO ] Invariant cache hit.
[2024-05-21 07:11:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 07:11:21] [INFO ] Flow matrix only has 358 transitions (discarded 8 similar events)
[2024-05-21 07:11:21] [INFO ] Invariant cache hit.
[2024-05-21 07:11:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 07:11:21] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 07:11:21] [INFO ] Redundant transitions in 33 ms returned []
Running 362 sub problems to find dead transitions.
[2024-05-21 07:11:21] [INFO ] Flow matrix only has 358 transitions (discarded 8 similar events)
[2024-05-21 07:11:21] [INFO ] Invariant cache hit.
[2024-05-21 07:11:21] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 358/537 variables, 179/181 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/540 variables, 3/189 constraints. Problems are: Problem set: 14 solved, 348 unsolved
[2024-05-21 07:11:29] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/190 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/190 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/190 constraints. Problems are: Problem set: 14 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 190 constraints, problems are : Problem set: 14 solved, 348 unsolved in 14871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 14 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 3 (OVERLAPS) 358/537 variables, 179/182 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 5/187 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 293/480 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/480 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 3/540 variables, 3/483 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 55/538 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/538 constraints. Problems are: Problem set: 14 solved, 348 unsolved
At refinement iteration 10 (OVERLAPS) 0/540 variables, 0/538 constraints. Problems are: Problem set: 14 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 538 constraints, problems are : Problem set: 14 solved, 348 unsolved in 21263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 348/362 constraints, Known Traps: 1/1 constraints]
After SMT, in 36345ms problems are : Problem set: 14 solved, 348 unsolved
Search for dead transitions found 14 dead transitions in 36349ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/182 places, 352/366 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 5 places and 20 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 177 transition count 332
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 15 ms. Remains 177 /182 variables (removed 5) and now considering 332/352 (removed 20) transitions.
[2024-05-21 07:11:57] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
// Phase 1: matrix 328 rows 177 cols
[2024-05-21 07:11:57] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 07:11:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 07:11:57] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
[2024-05-21 07:11:57] [INFO ] Invariant cache hit.
[2024-05-21 07:11:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:11:57] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 177/182 places, 332/366 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36852 ms. Remains : 177/182 places, 332/366 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (4367 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (51 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1157 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1132588 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 2
Probabilistic random walk after 1132588 steps, saw 232179 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2024-05-21 07:12:00] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
// Phase 1: matrix 328 rows 176 cols
[2024-05-21 07:12:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 07:12:00] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 319/451 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 52/503 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/504 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/504 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 319/451 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 52/503 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 07:12:01] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/504 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/504 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 187 ms.
Support contains 70 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 176/176 places, 332/332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-21 07:12:01] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
[2024-05-21 07:12:01] [INFO ] Invariant cache hit.
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 07:12:01] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
[2024-05-21 07:12:01] [INFO ] Invariant cache hit.
[2024-05-21 07:12:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 07:12:02] [INFO ] Redundant transitions in 16 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-21 07:12:02] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
[2024-05-21 07:12:02] [INFO ] Invariant cache hit.
[2024-05-21 07:12:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 328/501 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 3/504 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-21 07:12:08] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 0/504 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 183 constraints, problems are : Problem set: 0 solved, 328 unsolved in 14890 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 328/501 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 273/452 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (OVERLAPS) 3/504 variables, 3/455 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 55/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (OVERLAPS) 0/504 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 511 constraints, problems are : Problem set: 0 solved, 328 unsolved in 19577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 1/1 constraints]
After SMT, in 34616ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 34623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34831 ms. Remains : 176/176 places, 332/332 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 176 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 175 transition count 327
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 172 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 172 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 172 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 172 transition count 321
Applied a total of 15 rules in 15 ms. Remains 172 /176 variables (removed 4) and now considering 321/332 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 321 rows 172 cols
[2024-05-21 07:12:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 07:12:36] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:12:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 07:12:36] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 07:12:37] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 07:12:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-05-21 07:12:37] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 07:12:37] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 634 ms.
[2024-05-21 07:12:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-21 07:12:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 332 transitions and 884 arcs took 7 ms.
[2024-05-21 07:12:37] [INFO ] Flatten gal took : 63 ms
Total runtime 107221 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-319

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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: 657
MODEL NAME: /home/mcc/execution/413/model
176 places, 332 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-319-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-319-ReachabilityFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716276270389

--------------------
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-319"
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-319, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187300263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-319.tgz
mv CloudReconfiguration-PT-319 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;