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.r069-tall-171620504800567.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 CloudDeployment-PT-3b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 308K 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 CloudDeployment-PT-3b-ReachabilityFireability-2024-00
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-01
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-02
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-03
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-04
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-05
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-06
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-07
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-08
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-09
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-10
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-11
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-12
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-13
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-14
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716465941161

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 12:05:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 12:05:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:05:42] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-23 12:05:42] [INFO ] Transformed 859 places.
[2024-05-23 12:05:42] [INFO ] Transformed 1152 transitions.
[2024-05-23 12:05:42] [INFO ] Found NUPN structural information;
[2024-05-23 12:05:42] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (410 resets) in 1415 ms. (28 steps per ms) remains 11/16 properties
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (81 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 290 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (78 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (69 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (76 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (56 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (69 resets) in 181 ms. (219 steps per ms) remains 10/11 properties
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (61 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (73 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (83 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
// Phase 1: matrix 1152 rows 859 cols
[2024-05-23 12:05:43] [INFO ] Computed 13 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 709/858 variables, 12/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/858 variables, 709/871 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1152/2010 variables, 858/1729 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2010 variables, 0/1729 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem CloudDeployment-PT-3b-ReachabilityFireability-2024-02 is UNSAT
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1/2011 variables, 1/1730 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2011 variables, 1/1731 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2011 variables, 0/1731 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/2011 variables, 0/1731 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2011/2011 variables, and 1731 constraints, problems are : Problem set: 1 solved, 9 unsolved in 2842 ms.
Refiners :[Domain max(s): 859/859 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 859/859 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 717/858 variables, 12/154 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/858 variables, 717/871 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1152/2010 variables, 858/1729 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2010 variables, 9/1738 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2010 variables, 0/1738 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/2011 variables, 1/1739 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2011 variables, 1/1740 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2011/2011 variables, and 1740 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5013 ms.
Refiners :[Domain max(s): 859/859 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 859/859 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 8151ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 141 out of 859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Graph (trivial) has 589 edges and 859 vertex of which 64 / 859 are part of one of the 9 SCC in 9 ms
Free SCC test removed 55 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 1785 edges and 804 vertex of which 799 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 799 transition count 851
Reduce places removed 232 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 238 rules applied. Total rules applied 473 place count 567 transition count 845
Reduce places removed 2 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 2 with 55 rules applied. Total rules applied 528 place count 565 transition count 792
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 582 place count 512 transition count 791
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 582 place count 512 transition count 748
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 668 place count 469 transition count 748
Discarding 108 places :
Symmetric choice reduction at 4 with 108 rule applications. Total rules 776 place count 361 transition count 640
Iterating global reduction 4 with 108 rules applied. Total rules applied 884 place count 361 transition count 640
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 888 place count 361 transition count 636
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 888 place count 361 transition count 633
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 894 place count 358 transition count 633
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 895 place count 357 transition count 632
Iterating global reduction 5 with 1 rules applied. Total rules applied 896 place count 357 transition count 632
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 982 place count 314 transition count 589
Performed 31 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1044 place count 283 transition count 692
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1052 place count 283 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 1078 place count 283 transition count 658
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 1091 place count 283 transition count 645
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1108 place count 270 transition count 641
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1109 place count 270 transition count 640
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 1119 place count 270 transition count 640
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1120 place count 270 transition count 639
Applied a total of 1120 rules in 272 ms. Remains 270 /859 variables (removed 589) and now considering 639/1152 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 270/859 places, 639/1152 transitions.
RANDOM walk for 40000 steps (957 resets) in 405 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (151 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (144 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (139 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (142 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (84 resets) in 34 ms. (1142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (128 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (147 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (156 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (146 resets) in 37 ms. (1052 steps per ms) remains 8/9 properties
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 12:05:52] [INFO ] Flow matrix only has 627 transitions (discarded 12 similar events)
// Phase 1: matrix 627 rows 270 cols
[2024-05-23 12:05:52] [INFO ] Computed 11 invariants in 4 ms
[2024-05-23 12:05:52] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 81/193 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 582/775 variables, 193/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 22/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 112/887 variables, 69/295 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/887 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/887 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 10/897 variables, 8/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/897 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/897 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 897/897 variables, and 306 constraints, problems are : Problem set: 0 solved, 8 unsolved in 942 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 270/270 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 81/193 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 582/775 variables, 193/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 22/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 112/887 variables, 69/296 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/887 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/887 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/887 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 10/897 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/897 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/897 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 897/897 variables, and 314 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2656 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 270/270 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3691ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 2286 ms.
Support contains 108 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 639/639 transitions.
Graph (trivial) has 84 edges and 270 vertex of which 12 / 270 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1145 edges and 263 vertex of which 262 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 262 transition count 615
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 25 place count 253 transition count 611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 249 transition count 611
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 29 place count 249 transition count 604
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 43 place count 242 transition count 604
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 240 transition count 602
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 240 transition count 602
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 69 place count 229 transition count 591
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 226 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 102 place count 226 transition count 574
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 226 transition count 571
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 223 transition count 571
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 223 transition count 568
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 120 place count 223 transition count 568
Applied a total of 120 rules in 106 ms. Remains 223 /270 variables (removed 47) and now considering 568/639 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 223/270 places, 568/639 transitions.
RANDOM walk for 40000 steps (1009 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (153 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (146 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (169 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 560180 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 4
Probabilistic random walk after 560180 steps, saw 118780 distinct states, run finished after 3004 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-23 12:06:01] [INFO ] Flow matrix only has 543 transitions (discarded 25 similar events)
// Phase 1: matrix 543 rows 223 cols
[2024-05-23 12:06:01] [INFO ] Computed 13 invariants in 5 ms
[2024-05-23 12:06:01] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 114/222 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 543/765 variables, 222/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 25/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/766 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/766 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 535 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 223/223 constraints, ReadFeed: 25/25 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/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 114/222 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 543/765 variables, 222/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 25/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/766 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/766 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 766/766 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1820 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 223/223 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2455ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 929 ms.
Support contains 108 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 223 /223 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 223/223 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 223 /223 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-23 12:06:05] [INFO ] Flow matrix only has 543 transitions (discarded 25 similar events)
[2024-05-23 12:06:05] [INFO ] Invariant cache hit.
[2024-05-23 12:06:05] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 12:06:05] [INFO ] Flow matrix only has 543 transitions (discarded 25 similar events)
[2024-05-23 12:06:05] [INFO ] Invariant cache hit.
[2024-05-23 12:06:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:06:05] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-23 12:06:05] [INFO ] Redundant transitions in 81 ms returned []
Running 567 sub problems to find dead transitions.
[2024-05-23 12:06:05] [INFO ] Flow matrix only has 543 transitions (discarded 25 similar events)
[2024-05-23 12:06:05] [INFO ] Invariant cache hit.
[2024-05-23 12:06:05] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (OVERLAPS) 543/765 variables, 222/235 constraints. Problems are: Problem set: 0 solved, 567 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 25/260 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/766 variables, 1/261 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 0/261 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 7 (OVERLAPS) 0/766 variables, 0/261 constraints. Problems are: Problem set: 63 solved, 504 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 261 constraints, problems are : Problem set: 63 solved, 504 unsolved in 24204 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 223/223 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 63 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 7/7 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/7 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 2 (OVERLAPS) 6/222 variables, 6/13 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/13 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 543/765 variables, 222/235 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 25/260 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 504/764 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/764 constraints. Problems are: Problem set: 63 solved, 504 unsolved
At refinement iteration 8 (OVERLAPS) 1/766 variables, 1/765 constraints. Problems are: Problem set: 63 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/766 variables, and 765 constraints, problems are : Problem set: 63 solved, 504 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 223/223 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 504/567 constraints, Known Traps: 0/0 constraints]
After SMT, in 55292ms problems are : Problem set: 63 solved, 504 unsolved
Search for dead transitions found 63 dead transitions in 55299ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 223/223 places, 505/568 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 505
Applied a total of 1 rules in 14 ms. Remains 222 /223 variables (removed 1) and now considering 505/505 (removed 0) transitions.
[2024-05-23 12:07:01] [INFO ] Flow matrix only has 480 transitions (discarded 25 similar events)
// Phase 1: matrix 480 rows 222 cols
[2024-05-23 12:07:01] [INFO ] Computed 18 invariants in 4 ms
[2024-05-23 12:07:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-23 12:07:01] [INFO ] Flow matrix only has 480 transitions (discarded 25 similar events)
[2024-05-23 12:07:01] [INFO ] Invariant cache hit.
[2024-05-23 12:07:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:07:01] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 222/223 places, 505/568 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56118 ms. Remains : 222/223 places, 505/568 transitions.
RANDOM walk for 40000 steps (1009 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (161 resets) in 26 ms. (1481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (146 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (149 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (170 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 621183 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 4
Probabilistic random walk after 621183 steps, saw 131663 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-23 12:07:04] [INFO ] Flow matrix only has 480 transitions (discarded 25 similar events)
[2024-05-23 12:07:04] [INFO ] Invariant cache hit.
[2024-05-23 12:07:04] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 113/221 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 480/701 variables, 221/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 25/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/702 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/702 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 702/702 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 396 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 222/222 constraints, ReadFeed: 25/25 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/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 113/221 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 480/701 variables, 221/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 25/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/702 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/702 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 702/702 variables, and 269 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1587 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 222/222 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2040ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 916 ms.
Support contains 108 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 505/505 transitions.
Applied a total of 0 rules in 10 ms. Remains 222 /222 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 222/222 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 505/505 transitions.
Applied a total of 0 rules in 10 ms. Remains 222 /222 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-23 12:07:07] [INFO ] Flow matrix only has 480 transitions (discarded 25 similar events)
[2024-05-23 12:07:07] [INFO ] Invariant cache hit.
[2024-05-23 12:07:07] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 12:07:07] [INFO ] Flow matrix only has 480 transitions (discarded 25 similar events)
[2024-05-23 12:07:07] [INFO ] Invariant cache hit.
[2024-05-23 12:07:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:07:07] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-23 12:07:07] [INFO ] Redundant transitions in 44 ms returned []
Running 504 sub problems to find dead transitions.
[2024-05-23 12:07:07] [INFO ] Flow matrix only has 480 transitions (discarded 25 similar events)
[2024-05-23 12:07:07] [INFO ] Invariant cache hit.
[2024-05-23 12:07:07] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 480/701 variables, 221/239 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 25/264 constraints. Problems are: Problem set: 0 solved, 504 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (OVERLAPS) 1/702 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 9 (OVERLAPS) 0/702 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 504 unsolved
No progress, stopping.
After SMT solving in domain Real declared 702/702 variables, and 265 constraints, problems are : Problem set: 0 solved, 504 unsolved in 28831 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 222/222 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 480/701 variables, 221/239 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 25/264 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 504/768 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 8 (OVERLAPS) 1/702 variables, 1/769 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/702 variables, and 769 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 222/222 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 0/0 constraints]
After SMT, in 59623ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 59629ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60020 ms. Remains : 222/222 places, 505/505 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 222 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 221 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 221 transition count 472
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 221 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 220 transition count 471
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 220 transition count 471
Applied a total of 30 rules in 45 ms. Remains 220 /222 variables (removed 2) and now considering 471/505 (removed 34) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 471 rows 220 cols
[2024-05-23 12:08:07] [INFO ] Computed 18 invariants in 4 ms
[2024-05-23 12:08:07] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-23 12:08:07] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 12:08:07] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 5 ms returned sat
[2024-05-23 12:08:08] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 12:08:08] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 12:08:08] [INFO ] After 1170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1339 ms.
[2024-05-23 12:08:08] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-23 12:08:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 222 places, 505 transitions and 2731 arcs took 9 ms.
[2024-05-23 12:08:09] [INFO ] Flatten gal took : 96 ms
Total runtime 146985 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-3b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 222
TRANSITIONS: 505
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.016s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 628
MODEL NAME: /home/mcc/execution/410/model
222 places, 505 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 CloudDeployment-PT-3b-ReachabilityFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-05 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-2024-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716468092212

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="CloudDeployment-PT-3b"
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 CloudDeployment-PT-3b, 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 r069-tall-171620504800567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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