About the Execution of GreatSPN+red for CloudReconfiguration-PT-310
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
789.104 | 16830.00 | 33723.00 | 137.70 | TTFTTFTFFFTTTTFF | normal |
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-171624187200191.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-310, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187200191
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-310-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-310-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716266336077
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-310
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 04:38:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 04:38:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:38:57] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-21 04:38:57] [INFO ] Transformed 2585 places.
[2024-05-21 04:38:57] [INFO ] Transformed 3095 transitions.
[2024-05-21 04:38:57] [INFO ] Found NUPN structural information;
[2024-05-21 04:38:57] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (316 resets) in 1695 ms. (23 steps per ms) remains 13/16 properties
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (97 resets) in 509 ms. (78 steps per ms) remains 11/13 properties
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (99 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (103 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (97 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (93 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (100 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (94 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (92 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (90 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-21 04:38:59] [INFO ] Computed 4 invariants in 48 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2452/2574 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2574 variables, 2452/2578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2574 variables, 0/2578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5659 variables, 2574/5152 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5659 variables, 0/5152 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/5661 variables, 1/5153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5661 variables, 1/5154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5661 variables, 0/5154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2/5663 variables, 1/5155 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5663 variables, 1/5156 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5663/5680 variables, and 5156 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5099 ms.
Refiners :[Domain max(s): 2576/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2576/2585 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2452/2574 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2574 variables, 2452/2578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2574 variables, 0/2578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5659 variables, 2574/5152 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5659 variables, 11/5163 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5659/5680 variables, and 5163 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5021 ms.
Refiners :[Domain max(s): 2574/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2574/2585 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 10320ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 122 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2639 edges and 2585 vertex of which 587 / 2585 are part of one of the 53 SCC in 11 ms
Free SCC test removed 534 places
Drop transitions (Empty/Sink Transition effects.) removed 651 transitions
Reduce isomorphic transitions removed 651 transitions.
Graph (complete) has 2724 edges and 2051 vertex of which 2037 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.6 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1118 transitions
Trivial Post-agglo rules discarded 1118 transitions
Performed 1118 trivial Post agglomeration. Transition count delta: 1118
Iterating post reduction 0 with 1125 rules applied. Total rules applied 1127 place count 2037 transition count 1310
Reduce places removed 1118 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 1202 rules applied. Total rules applied 2329 place count 919 transition count 1226
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 2364 place count 889 transition count 1221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2367 place count 888 transition count 1219
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 2371 place count 887 transition count 1216
Reduce places removed 2 places and 0 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 5 with 118 rules applied. Total rules applied 2489 place count 885 transition count 1100
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 126 rules applied. Total rules applied 2615 place count 769 transition count 1090
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2618 place count 766 transition count 1090
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 38 Pre rules applied. Total rules applied 2618 place count 766 transition count 1052
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 2694 place count 728 transition count 1052
Discarding 99 places :
Symmetric choice reduction at 8 with 99 rule applications. Total rules 2793 place count 629 transition count 953
Iterating global reduction 8 with 99 rules applied. Total rules applied 2892 place count 629 transition count 953
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 12 rules applied. Total rules applied 2904 place count 629 transition count 941
Reduce places removed 3 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 9 with 5 rules applied. Total rules applied 2909 place count 626 transition count 939
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 10 with 4 rules applied. Total rules applied 2913 place count 625 transition count 936
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2916 place count 622 transition count 936
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 7 Pre rules applied. Total rules applied 2916 place count 622 transition count 929
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 2930 place count 615 transition count 929
Discarding 53 places :
Symmetric choice reduction at 12 with 53 rule applications. Total rules 2983 place count 562 transition count 876
Iterating global reduction 12 with 53 rules applied. Total rules applied 3036 place count 562 transition count 876
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 12 with 26 rules applied. Total rules applied 3062 place count 562 transition count 850
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 20 rules applied. Total rules applied 3082 place count 550 transition count 842
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 5 rules applied. Total rules applied 3087 place count 546 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3088 place count 545 transition count 841
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 3100 place count 533 transition count 822
Iterating global reduction 16 with 12 rules applied. Total rules applied 3112 place count 533 transition count 822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3116 place count 533 transition count 818
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 3120 place count 529 transition count 810
Iterating global reduction 17 with 4 rules applied. Total rules applied 3124 place count 529 transition count 810
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3125 place count 528 transition count 808
Iterating global reduction 17 with 1 rules applied. Total rules applied 3126 place count 528 transition count 808
Performed 165 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 17 with 330 rules applied. Total rules applied 3456 place count 363 transition count 601
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 17 with 13 rules applied. Total rules applied 3469 place count 363 transition count 588
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3473 place count 361 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3474 place count 361 transition count 585
Performed 47 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 19 with 94 rules applied. Total rules applied 3568 place count 314 transition count 612
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 19 with 29 rules applied. Total rules applied 3597 place count 314 transition count 583
Discarding 10 places :
Symmetric choice reduction at 20 with 10 rule applications. Total rules 3607 place count 304 transition count 563
Iterating global reduction 20 with 10 rules applied. Total rules applied 3617 place count 304 transition count 563
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 3618 place count 303 transition count 561
Iterating global reduction 20 with 1 rules applied. Total rules applied 3619 place count 303 transition count 561
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 20 with 37 rules applied. Total rules applied 3656 place count 303 transition count 524
Free-agglomeration rule applied 9 times.
Iterating global reduction 20 with 9 rules applied. Total rules applied 3665 place count 303 transition count 515
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 20 with 9 rules applied. Total rules applied 3674 place count 294 transition count 515
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 3677 place count 294 transition count 512
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3678 place count 294 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 3679 place count 293 transition count 512
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 22 with 8 rules applied. Total rules applied 3687 place count 293 transition count 512
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 3688 place count 293 transition count 511
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 22 with 5 rules applied. Total rules applied 3693 place count 293 transition count 511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 3694 place count 292 transition count 510
Applied a total of 3694 rules in 569 ms. Remains 292 /2585 variables (removed 2293) and now considering 510/3095 (removed 2585) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 580 ms. Remains : 292/2585 places, 510/3095 transitions.
RANDOM walk for 40000 steps (1310 resets) in 896 ms. (44 steps per ms) remains 6/11 properties
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (316 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (161 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (292 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (309 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (202 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (388 resets) in 76 ms. (519 steps per ms) remains 5/6 properties
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 04:39:10] [INFO ] Flow matrix only has 507 transitions (discarded 3 similar events)
// Phase 1: matrix 507 rows 292 cols
[2024-05-21 04:39:10] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 04:39:10] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 117/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 385/565 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 143/708 variables, 64/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/708 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 65/773 variables, 29/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 24/797 variables, 17/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/797 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/799 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/799 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/799 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 299 constraints, problems are : Problem set: 0 solved, 5 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 292/292 constraints, ReadFeed: 5/5 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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CloudReconfiguration-PT-310-ReachabilityFireability-2024-10 is UNSAT
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudReconfiguration-PT-310-ReachabilityFireability-2024-12 is UNSAT
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 117/180 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 385/565 variables, 180/182 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 2/184 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 143/708 variables, 64/248 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/708 variables, 3/251 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 3/254 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/254 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 65/773 variables, 29/283 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/773 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem CloudReconfiguration-PT-310-ReachabilityFireability-2024-00 is UNSAT
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 24/797 variables, 17/300 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/797 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/799 variables, 2/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/799 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/799 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 302 constraints, problems are : Problem set: 3 solved, 2 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 292/292 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1295ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 494 ms.
Support contains 23 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 510/510 transitions.
Graph (trivial) has 302 edges and 292 vertex of which 61 / 292 are part of one of the 23 SCC in 0 ms
Free SCC test removed 38 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 254 transition count 385
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 112 place count 203 transition count 376
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 124 place count 200 transition count 367
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 132 place count 192 transition count 367
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 132 place count 192 transition count 354
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 158 place count 179 transition count 354
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 166 place count 171 transition count 342
Iterating global reduction 4 with 8 rules applied. Total rules applied 174 place count 171 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 176 place count 171 transition count 340
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 178 place count 169 transition count 337
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 169 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 169 transition count 336
Performed 38 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 257 place count 131 transition count 281
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 269 place count 131 transition count 269
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 274 place count 126 transition count 262
Iterating global reduction 7 with 5 rules applied. Total rules applied 279 place count 126 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 282 place count 126 transition count 259
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 308 place count 113 transition count 294
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 336 place count 113 transition count 266
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 346 place count 103 transition count 235
Iterating global reduction 9 with 10 rules applied. Total rules applied 356 place count 103 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 360 place count 103 transition count 231
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 364 place count 99 transition count 227
Iterating global reduction 10 with 4 rules applied. Total rules applied 368 place count 99 transition count 227
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 380 place count 99 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 391 place count 99 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 391 place count 99 transition count 203
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 393 place count 98 transition count 203
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 400 place count 98 transition count 196
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 408 place count 91 transition count 195
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 409 place count 90 transition count 193
Iterating global reduction 12 with 1 rules applied. Total rules applied 410 place count 90 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 412 place count 90 transition count 191
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 418 place count 90 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 419 place count 90 transition count 190
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 420 place count 89 transition count 188
Iterating global reduction 13 with 1 rules applied. Total rules applied 421 place count 89 transition count 188
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 422 place count 89 transition count 188
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 423 place count 88 transition count 187
Iterating global reduction 13 with 1 rules applied. Total rules applied 424 place count 88 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 425 place count 87 transition count 186
Applied a total of 425 rules in 95 ms. Remains 87 /292 variables (removed 205) and now considering 186/510 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 87/292 places, 186/510 transitions.
RANDOM walk for 40000 steps (477 resets) in 130 ms. (305 steps per ms) remains 1/2 properties
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (158 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
[2024-05-21 04:39:12] [INFO ] Flow matrix only has 178 transitions (discarded 8 similar events)
// Phase 1: matrix 178 rows 87 cols
[2024-05-21 04:39:12] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 04:39:12] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/259 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/265 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/259 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/265 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA CloudReconfiguration-PT-310-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 15584 ms.
ITS solved all properties within timeout
BK_STOP 1716266352907
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-310"
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-310, 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-171624187200191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-310.tgz
mv CloudReconfiguration-PT-310 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 '
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 ;