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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 19:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 19:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 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 660K 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-308-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716264426167

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-308
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 04:07:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 04:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:07:07] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-21 04:07:07] [INFO ] Transformed 2585 places.
[2024-05-21 04:07:07] [INFO ] Transformed 3095 transitions.
[2024-05-21 04:07:07] [INFO ] Found NUPN structural information;
[2024-05-21 04:07:07] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (288 resets) in 1913 ms. (20 steps per ms) remains 13/16 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (77 resets) in 519 ms. (76 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (78 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (76 resets) in 725 ms. (55 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (80 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (73 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (74 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (81 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (30 resets) in 54 ms. (727 steps per ms) remains 11/13 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (76 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (77 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (82 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (76 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-21 04:07:09] [INFO ] Computed 4 invariants in 46 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2382/2575 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2575 variables, 2382/2579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2575 variables, 0/2579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3087/5662 variables, 2575/5154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5662 variables, 0/5154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 6/5668 variables, 3/5157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5668 variables, 3/5160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5668 variables, 0/5160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5303ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 193 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2478 edges and 2585 vertex of which 367 / 2585 are part of one of the 42 SCC in 12 ms
Free SCC test removed 325 places
Drop transitions (Empty/Sink Transition effects.) removed 399 transitions
Reduce isomorphic transitions removed 399 transitions.
Graph (complete) has 2976 edges and 2260 vertex of which 2249 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.12 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1164 transitions
Trivial Post-agglo rules discarded 1164 transitions
Performed 1164 trivial Post agglomeration. Transition count delta: 1164
Iterating post reduction 0 with 1167 rules applied. Total rules applied 1169 place count 2249 transition count 1523
Reduce places removed 1164 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 1237 rules applied. Total rules applied 2406 place count 1085 transition count 1450
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Iterating post reduction 2 with 185 rules applied. Total rules applied 2591 place count 1059 transition count 1291
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 3 with 188 rules applied. Total rules applied 2779 place count 902 transition count 1260
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2785 place count 896 transition count 1260
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 2785 place count 896 transition count 1220
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 2865 place count 856 transition count 1220
Discarding 97 places :
Symmetric choice reduction at 5 with 97 rule applications. Total rules 2962 place count 759 transition count 1123
Iterating global reduction 5 with 97 rules applied. Total rules applied 3059 place count 759 transition count 1123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 3062 place count 759 transition count 1120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3063 place count 758 transition count 1120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 3063 place count 758 transition count 1114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 3075 place count 752 transition count 1114
Discarding 47 places :
Symmetric choice reduction at 7 with 47 rule applications. Total rules 3122 place count 705 transition count 1067
Iterating global reduction 7 with 47 rules applied. Total rules applied 3169 place count 705 transition count 1067
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 16 rules applied. Total rules applied 3185 place count 705 transition count 1051
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 9 rules applied. Total rules applied 3194 place count 698 transition count 1049
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 3 rules applied. Total rules applied 3197 place count 697 transition count 1047
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3199 place count 695 transition count 1047
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 3204 place count 690 transition count 1039
Iterating global reduction 11 with 5 rules applied. Total rules applied 3209 place count 690 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3211 place count 688 transition count 1035
Iterating global reduction 11 with 2 rules applied. Total rules applied 3213 place count 688 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3215 place count 686 transition count 1031
Iterating global reduction 11 with 2 rules applied. Total rules applied 3217 place count 686 transition count 1031
Performed 179 Post agglomeration using F-continuation condition with reduction of 45 identical transitions.
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 11 with 358 rules applied. Total rules applied 3575 place count 507 transition count 807
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 3591 place count 507 transition count 791
Performed 66 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 12 with 132 rules applied. Total rules applied 3723 place count 441 transition count 830
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 12 with 32 rules applied. Total rules applied 3755 place count 441 transition count 798
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 3762 place count 434 transition count 784
Iterating global reduction 13 with 7 rules applied. Total rules applied 3769 place count 434 transition count 784
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 13 with 53 rules applied. Total rules applied 3822 place count 434 transition count 731
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3823 place count 433 transition count 730
Iterating global reduction 13 with 1 rules applied. Total rules applied 3824 place count 433 transition count 730
Free-agglomeration rule applied 23 times.
Iterating global reduction 13 with 23 rules applied. Total rules applied 3847 place count 433 transition count 707
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 13 with 23 rules applied. Total rules applied 3870 place count 410 transition count 707
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 3875 place count 410 transition count 702
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 14 with 28 rules applied. Total rules applied 3903 place count 410 transition count 702
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 3907 place count 410 transition count 698
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 3908 place count 410 transition count 698
Applied a total of 3908 rules in 598 ms. Remains 410 /2585 variables (removed 2175) and now considering 698/3095 (removed 2397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 607 ms. Remains : 410/2585 places, 698/3095 transitions.
RANDOM walk for 40000 steps (1160 resets) in 772 ms. (51 steps per ms) remains 10/11 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (299 resets) in 178 ms. (223 steps per ms) remains 9/10 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (288 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (290 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (295 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (296 resets) in 33 ms. (1176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (160 resets) in 24 ms. (1600 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (292 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (297 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (285 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
[2024-05-21 04:07:15] [INFO ] Flow matrix only has 692 transitions (discarded 6 similar events)
// Phase 1: matrix 692 rows 410 cols
[2024-05-21 04:07:15] [INFO ] Computed 1 invariants in 3 ms
[2024-05-21 04:07:15] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 67/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 635/873 variables, 238/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/873 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/873 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 217/1090 variables, 160/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 12/1102 variables, 12/415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1102 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1102 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 415 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 410/410 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 67/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 635/873 variables, 238/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/873 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/873 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 217/1090 variables, 160/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 12/1102 variables, 12/424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1102 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1102 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 424 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 410/410 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 4535ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 5289 ms.
Support contains 167 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 698/698 transitions.
Graph (trivial) has 63 edges and 410 vertex of which 8 / 410 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 406 transition count 685
Reduce places removed 5 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 401 transition count 678
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 26 place count 394 transition count 677
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 26 place count 394 transition count 672
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 36 place count 389 transition count 672
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 39 place count 386 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 386 transition count 669
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 385 transition count 668
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 385 transition count 668
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 3 with 14 rules applied. Total rules applied 58 place count 378 transition count 661
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 61 place count 378 transition count 658
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 376 transition count 656
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 376 transition count 656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 376 transition count 655
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 72 place count 373 transition count 657
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 76 place count 373 transition count 653
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 77 place count 372 transition count 651
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 372 transition count 651
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 84 place count 372 transition count 645
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 87 place count 372 transition count 642
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 90 place count 369 transition count 642
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 94 place count 369 transition count 642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 95 place count 369 transition count 641
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 96 place count 368 transition count 640
Iterating global reduction 8 with 1 rules applied. Total rules applied 97 place count 368 transition count 640
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 98 place count 368 transition count 640
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 99 place count 368 transition count 639
Applied a total of 99 rules in 166 ms. Remains 368 /410 variables (removed 42) and now considering 639/698 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 368/410 places, 639/698 transitions.
RANDOM walk for 40000 steps (1282 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (291 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (317 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (302 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (264 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (321 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 558063 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 5
Probabilistic random walk after 558063 steps, saw 117953 distinct states, run finished after 3004 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-21 04:07:28] [INFO ] Flow matrix only has 633 transitions (discarded 6 similar events)
// Phase 1: matrix 633 rows 368 cols
[2024-05-21 04:07:28] [INFO ] Computed 1 invariants in 6 ms
[2024-05-21 04:07:28] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 622/847 variables, 225/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 153/1000 variables, 142/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/1001 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1001 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1001/1001 variables, and 373 constraints, problems are : Problem set: 0 solved, 5 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 368/368 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 622/847 variables, 225/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 153/1000 variables, 142/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 5/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1001 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1001 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1001/1001 variables, and 378 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 368/368 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2825ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1263 ms.
Support contains 167 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 639/639 transitions.
Applied a total of 0 rules in 21 ms. Remains 368 /368 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 368/368 places, 639/639 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 639/639 transitions.
Applied a total of 0 rules in 11 ms. Remains 368 /368 variables (removed 0) and now considering 639/639 (removed 0) transitions.
[2024-05-21 04:07:33] [INFO ] Flow matrix only has 633 transitions (discarded 6 similar events)
[2024-05-21 04:07:33] [INFO ] Invariant cache hit.
[2024-05-21 04:07:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 04:07:33] [INFO ] Flow matrix only has 633 transitions (discarded 6 similar events)
[2024-05-21 04:07:33] [INFO ] Invariant cache hit.
[2024-05-21 04:07:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 04:07:33] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-21 04:07:33] [INFO ] Redundant transitions in 35 ms returned []
Running 638 sub problems to find dead transitions.
[2024-05-21 04:07:33] [INFO ] Flow matrix only has 633 transitions (discarded 6 similar events)
[2024-05-21 04:07:33] [INFO ] Invariant cache hit.
[2024-05-21 04:07:33] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/368 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 3 (OVERLAPS) 633/1001 variables, 368/369 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 638 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 1001/1001 variables, and 373 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 368/368 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/368 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 3 (OVERLAPS) 633/1001 variables, 368/369 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 638/1011 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-05-21 04:08:22] [INFO ] Deduced a trap composed of 107 places in 75 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1001 variables, and 1012 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 368/368 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 1/1 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 638 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60698 ms. Remains : 368/368 places, 639/639 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 368 transition count 633
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 365 transition count 630
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 365 transition count 630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 365 transition count 628
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 365 transition count 628
Applied a total of 15 rules in 29 ms. Remains 365 /368 variables (removed 3) and now considering 628/639 (removed 11) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 628 rows 365 cols
[2024-05-21 04:08:33] [INFO ] Computed 1 invariants in 2 ms
[2024-05-21 04:08:33] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 04:08:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 04:08:34] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-21 04:08:34] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-21 04:08:35] [INFO ] After 1308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1506 ms.
[2024-05-21 04:08:35] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-21 04:08:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 368 places, 639 transitions and 1508 arcs took 6 ms.
[2024-05-21 04:08:35] [INFO ] Flatten gal took : 70 ms
Total runtime 88181 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-308

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/408/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: 584
MODEL NAME: /home/mcc/execution/408/model
368 places, 639 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.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-04 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716265105531

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

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

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