fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624188800230
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CloudReconfiguration-PT-315

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
778.235 52771.00 86612.00 162.60 FTTFFFFTFTFTTTTT 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.r480-tall-171624188800230.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 ltsminxred
Input is CloudReconfiguration-PT-315, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188800230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 19:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 19:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 19:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 19:47 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-315-ReachabilityCardinality-2024-00
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-01
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-02
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-03
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-04
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-05
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-06
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-07
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-08
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-09
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-10
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-11
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-12
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-13
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-14
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717184085790

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-315
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:34:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:34:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:34:47] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-31 19:34:47] [INFO ] Transformed 2585 places.
[2024-05-31 19:34:47] [INFO ] Transformed 3095 transitions.
[2024-05-31 19:34:47] [INFO ] Found NUPN structural information;
[2024-05-31 19:34:47] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (318 resets) in 2494 ms. (16 steps per ms) remains 11/15 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (97 resets) in 354 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (97 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (92 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (100 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (101 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (92 resets) in 117 ms. (338 steps per ms) remains 10/11 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (94 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (93 resets) in 317 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (94 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (96 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (89 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-31 19:34:49] [INFO ] Computed 4 invariants in 58 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2395/2574 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2574 variables, 2395/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2574 variables, 0/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5659 variables, 2574/5152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5659 variables, 0/5152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/5661 variables, 1/5153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5661 variables, 1/5154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5661 variables, 0/5154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/5663 variables, 1/5155 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5663 variables, 1/5156 constraints. Problems are: Problem set: 0 solved, 10 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, 10 unsolved in 5130 ms.
Refiners :[Domain max(s): 2576/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2576/2585 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2395/2574 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2574 variables, 2395/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2574 variables, 0/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5659 variables, 2574/5152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5659 variables, 10/5162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5659/5680 variables, and 5162 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5016 ms.
Refiners :[Domain max(s): 2574/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2574/2585 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 10387ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 179 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2563 edges and 2585 vertex of which 415 / 2585 are part of one of the 46 SCC in 13 ms
Free SCC test removed 369 places
Drop transitions (Empty/Sink Transition effects.) removed 452 transitions
Reduce isomorphic transitions removed 452 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1156 transitions
Trivial Post-agglo rules discarded 1156 transitions
Performed 1156 trivial Post agglomeration. Transition count delta: 1156
Iterating post reduction 0 with 1156 rules applied. Total rules applied 1157 place count 2216 transition count 1487
Reduce places removed 1156 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 1248 rules applied. Total rules applied 2405 place count 1060 transition count 1395
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 43 rules applied. Total rules applied 2448 place count 1025 transition count 1387
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 9 rules applied. Total rules applied 2457 place count 1022 transition count 1381
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 11 rules applied. Total rules applied 2468 place count 1019 transition count 1373
Reduce places removed 5 places and 0 transitions.
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Iterating post reduction 5 with 118 rules applied. Total rules applied 2586 place count 1014 transition count 1260
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 116 rules applied. Total rules applied 2702 place count 901 transition count 1257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2703 place count 900 transition count 1257
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 39 Pre rules applied. Total rules applied 2703 place count 900 transition count 1218
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 2781 place count 861 transition count 1218
Discarding 102 places :
Symmetric choice reduction at 8 with 102 rule applications. Total rules 2883 place count 759 transition count 1116
Iterating global reduction 8 with 102 rules applied. Total rules applied 2985 place count 759 transition count 1116
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 10 rules applied. Total rules applied 2995 place count 759 transition count 1106
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 6 rules applied. Total rules applied 3001 place count 757 transition count 1102
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 3007 place count 755 transition count 1098
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3009 place count 753 transition count 1098
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 3009 place count 753 transition count 1092
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 3021 place count 747 transition count 1092
Discarding 51 places :
Symmetric choice reduction at 12 with 51 rule applications. Total rules 3072 place count 696 transition count 1041
Iterating global reduction 12 with 51 rules applied. Total rules applied 3123 place count 696 transition count 1041
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 24 rules applied. Total rules applied 3147 place count 696 transition count 1017
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 13 with 16 rules applied. Total rules applied 3163 place count 684 transition count 1013
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 3165 place count 682 transition count 1013
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 3171 place count 676 transition count 1004
Iterating global reduction 15 with 6 rules applied. Total rules applied 3177 place count 676 transition count 1004
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3178 place count 676 transition count 1003
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 3180 place count 674 transition count 999
Iterating global reduction 16 with 2 rules applied. Total rules applied 3182 place count 674 transition count 999
Performed 192 Post agglomeration using F-continuation condition with reduction of 53 identical transitions.
Deduced a syphon composed of 192 places in 1 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 16 with 384 rules applied. Total rules applied 3566 place count 482 transition count 754
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 16 with 13 rules applied. Total rules applied 3579 place count 482 transition count 741
Performed 58 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 17 with 116 rules applied. Total rules applied 3695 place count 424 transition count 766
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 17 with 24 rules applied. Total rules applied 3719 place count 424 transition count 742
Discarding 13 places :
Symmetric choice reduction at 18 with 13 rule applications. Total rules 3732 place count 411 transition count 716
Iterating global reduction 18 with 13 rules applied. Total rules applied 3745 place count 411 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3746 place count 411 transition count 715
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 19 with 48 rules applied. Total rules applied 3794 place count 411 transition count 667
Free-agglomeration rule applied 34 times.
Iterating global reduction 19 with 34 rules applied. Total rules applied 3828 place count 411 transition count 633
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 35 rules applied. Total rules applied 3863 place count 377 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 20 with 6 rules applied. Total rules applied 3869 place count 377 transition count 626
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3870 place count 377 transition count 625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 3871 place count 376 transition count 625
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 21 with 13 rules applied. Total rules applied 3884 place count 376 transition count 625
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3886 place count 376 transition count 623
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 21 with 5 rules applied. Total rules applied 3891 place count 376 transition count 623
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 3892 place count 376 transition count 622
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 3893 place count 375 transition count 621
Applied a total of 3893 rules in 599 ms. Remains 375 /2585 variables (removed 2210) and now considering 621/3095 (removed 2474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 375/2585 places, 621/3095 transitions.
RANDOM walk for 40000 steps (17 resets) in 831 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (22 resets) in 255 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (23 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (21 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (20 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (28 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (32 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (17 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (25 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (9 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 646706 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :5 out of 10
Probabilistic random walk after 646706 steps, saw 133964 distinct states, run finished after 3016 ms. (steps per millisecond=214 ) properties seen :5
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-31 19:35:04] [INFO ] Flow matrix only has 618 transitions (discarded 3 similar events)
// Phase 1: matrix 618 rows 375 cols
[2024-05-31 19:35:04] [INFO ] Computed 4 invariants in 3 ms
[2024-05-31 19:35:04] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 301/375 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 618/993 variables, 375/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/993 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 383 constraints, problems are : Problem set: 0 solved, 5 unsolved in 561 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 375/375 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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 301/375 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 618/993 variables, 375/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/993 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/993 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 388 constraints, problems are : Problem set: 0 solved, 5 unsolved in 659 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 375/375 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 454 ms.
Support contains 44 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 621/621 transitions.
Graph (trivial) has 370 edges and 375 vertex of which 90 / 375 are part of one of the 29 SCC in 0 ms
Free SCC test removed 61 places
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 104 transitions.
Graph (complete) has 683 edges and 314 vertex of which 308 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 308 transition count 448
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 146 place count 244 transition count 436
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 14 rules applied. Total rules applied 160 place count 243 transition count 423
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 172 place count 231 transition count 423
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 172 place count 231 transition count 405
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 208 place count 213 transition count 405
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 212 place count 209 transition count 399
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 209 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 218 place count 209 transition count 397
Performed 40 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 298 place count 169 transition count 345
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 319 place count 169 transition count 324
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 324 place count 164 transition count 315
Iterating global reduction 6 with 5 rules applied. Total rules applied 329 place count 164 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 330 place count 164 transition count 314
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 336 place count 161 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 338 place count 161 transition count 309
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 352 place count 154 transition count 327
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 366 place count 154 transition count 313
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 371 place count 149 transition count 299
Iterating global reduction 9 with 5 rules applied. Total rules applied 376 place count 149 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 377 place count 149 transition count 298
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 379 place count 147 transition count 296
Iterating global reduction 10 with 2 rules applied. Total rules applied 381 place count 147 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 385 place count 147 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 11 with 15 rules applied. Total rules applied 400 place count 147 transition count 277
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 402 place count 145 transition count 275
Iterating global reduction 11 with 2 rules applied. Total rules applied 404 place count 145 transition count 275
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 406 place count 143 transition count 273
Iterating global reduction 11 with 2 rules applied. Total rules applied 408 place count 143 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 410 place count 143 transition count 271
Free-agglomeration rule applied 6 times.
Iterating global reduction 12 with 6 rules applied. Total rules applied 416 place count 143 transition count 265
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 422 place count 137 transition count 265
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 425 place count 137 transition count 265
Applied a total of 425 rules in 82 ms. Remains 137 /375 variables (removed 238) and now considering 265/621 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 137/375 places, 265/621 transitions.
RANDOM walk for 40000 steps (213 resets) in 225 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1390799 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 2
Probabilistic random walk after 1390799 steps, saw 255686 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
[2024-05-31 19:35:09] [INFO ] Flow matrix only has 257 transitions (discarded 8 similar events)
// Phase 1: matrix 257 rows 137 cols
[2024-05-31 19:35:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 19:35:09] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 205/259 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 128/387 variables, 77/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/394 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/394 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 205/259 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 128/387 variables, 77/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/394 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/394 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 44 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 137/137 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 265/265 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-31 19:35:10] [INFO ] Flow matrix only has 257 transitions (discarded 8 similar events)
[2024-05-31 19:35:10] [INFO ] Invariant cache hit.
[2024-05-31 19:35:10] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 19:35:10] [INFO ] Flow matrix only has 257 transitions (discarded 8 similar events)
[2024-05-31 19:35:10] [INFO ] Invariant cache hit.
[2024-05-31 19:35:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 19:35:10] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [93, 131]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 234 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/137 places, 264/265 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 134 transition count 268
Applied a total of 2 rules in 11 ms. Remains 134 /135 variables (removed 1) and now considering 268/264 (removed -4) transitions.
[2024-05-31 19:35:10] [INFO ] Flow matrix only has 260 transitions (discarded 8 similar events)
// Phase 1: matrix 260 rows 134 cols
[2024-05-31 19:35:10] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 19:35:10] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 19:35:10] [INFO ] Flow matrix only has 260 transitions (discarded 8 similar events)
[2024-05-31 19:35:10] [INFO ] Invariant cache hit.
[2024-05-31 19:35:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 19:35:10] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 134/137 places, 268/265 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 511 ms. Remains : 134/137 places, 268/265 transitions.
RANDOM walk for 40000 steps (130 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (29 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1213696 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 2
Probabilistic random walk after 1213696 steps, saw 223517 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) properties seen :0
[2024-05-31 19:35:13] [INFO ] Flow matrix only has 260 transitions (discarded 8 similar events)
[2024-05-31 19:35:13] [INFO ] Invariant cache hit.
[2024-05-31 19:35:13] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 205/259 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 132/391 variables, 77/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/394 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 205/259 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 132/391 variables, 77/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/394 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/394 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 145 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 44 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 134/134 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 268/268 transitions.
Applied a total of 0 rules in 5 ms. Remains 134 /134 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-31 19:35:14] [INFO ] Flow matrix only has 260 transitions (discarded 8 similar events)
[2024-05-31 19:35:14] [INFO ] Invariant cache hit.
[2024-05-31 19:35:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 19:35:14] [INFO ] Flow matrix only has 260 transitions (discarded 8 similar events)
[2024-05-31 19:35:14] [INFO ] Invariant cache hit.
[2024-05-31 19:35:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 19:35:14] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-31 19:35:14] [INFO ] Redundant transitions in 11 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-31 19:35:14] [INFO ] Flow matrix only has 260 transitions (discarded 8 similar events)
[2024-05-31 19:35:14] [INFO ] Invariant cache hit.
[2024-05-31 19:35:14] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD164 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 2 (OVERLAPS) 260/394 variables, 134/135 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 8/143 constraints. Problems are: Problem set: 9 solved, 258 unsolved
[2024-05-31 19:35:17] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 12 ms to minimize.
[2024-05-31 19:35:18] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:35:18] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 3/146 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/146 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/146 constraints. Problems are: Problem set: 9 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 146 constraints, problems are : Problem set: 9 solved, 258 unsolved in 8296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 9 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/3 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/393 variables, 133/136 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 8/144 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 258/402 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/402 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/403 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/404 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/404 constraints. Problems are: Problem set: 9 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/404 constraints. Problems are: Problem set: 9 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 404 constraints, problems are : Problem set: 9 solved, 258 unsolved in 12047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 258/267 constraints, Known Traps: 3/3 constraints]
After SMT, in 20529ms problems are : Problem set: 9 solved, 258 unsolved
Search for dead transitions found 9 dead transitions in 20532ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 259/268 transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 6 places and 29 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 128 transition count 230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 243
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 126 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 9 rules in 16 ms. Remains 126 /134 variables (removed 8) and now considering 242/259 (removed 17) transitions.
[2024-05-31 19:35:34] [INFO ] Flow matrix only has 236 transitions (discarded 6 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-05-31 19:35:34] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 19:35:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 19:35:35] [INFO ] Flow matrix only has 236 transitions (discarded 6 similar events)
[2024-05-31 19:35:35] [INFO ] Invariant cache hit.
[2024-05-31 19:35:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 19:35:35] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/134 places, 242/268 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20860 ms. Remains : 126/134 places, 242/268 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40000 steps (148 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1501779 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :0 out of 2
Probabilistic random walk after 1501779 steps, saw 277467 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
[2024-05-31 19:35:38] [INFO ] Flow matrix only has 236 transitions (discarded 6 similar events)
// Phase 1: matrix 236 rows 124 cols
[2024-05-31 19:35:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 19:35:38] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 165/207 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 138/345 variables, 70/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/359 variables, 11/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 129 constraints, problems are : Problem set: 0 solved, 2 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem CloudReconfiguration-PT-315-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 11/42 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/207 variables, 42/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/345 variables, 70/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 4/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem CloudReconfiguration-PT-315-ReachabilityCardinality-2024-07 is UNSAT
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 359/360 variables, and 129 constraints, problems are : Problem set: 2 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/124 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 51348 ms.
ITS solved all properties within timeout

BK_STOP 1717184138561

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-315"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudReconfiguration-PT-315, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624188800230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-315.tgz
mv CloudReconfiguration-PT-315 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;