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.r560-tall-171734905900193.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 FireWire-PT-18, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717352490154

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:21:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:21:31] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 18:21:31] [INFO ] Transformed 437 places.
[2024-06-02 18:21:31] [INFO ] Transformed 707 transitions.
[2024-06-02 18:21:31] [INFO ] Found NUPN structural information;
[2024-06-02 18:21:31] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 196 ms.
Graph (trivial) has 325 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 11 ms
Free SCC test removed 9 places
Structural test allowed to assert that 66 places are NOT stable. Took 32 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (644 resets) in 2047 ms. (19 steps per ms) remains 265/371 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 265/265 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 33 ms. (11 steps per ms) remains 265/265 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 265/265 properties
BEST_FIRST walk for 401 steps (8 resets) in 20 ms. (19 steps per ms) remains 265/265 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 265/265 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 265/265 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 265/265 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 265/265 properties
[2024-06-02 18:21:32] [INFO ] Flow matrix only has 695 transitions (discarded 2 similar events)
// Phase 1: matrix 695 rows 428 cols
[2024-06-02 18:21:32] [INFO ] Computed 9 invariants in 23 ms
[2024-06-02 18:21:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 265/265 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 163/428 variables, 9/274 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 163/437 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 (/ 1.0 214.0))
(s5 0.0)
(s6 0.0)
(s7 (/ 1.0 214.0))
(s8 (/ 207.0 214.0))
(s9 (/ 1.0 214.0))
(s10 0.0)
(s11 (/ 1.0 214.0))
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 (/ 1.0 214.0))
(s16 (/ 1.0 214.0))
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 (/ 1.0 214.0))
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 (/ 1.0 214.0))
(s57 (/ 1.0 214.0))
(s58 (/ 1.0 214.0))
(s59 (/ 1.0 214.0))
(s60 (/ 1.0 214.0))
(s61 (/ 1.0 214.0))
(s62 (/ 1.0 214.0))
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 207.0 214.0))
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 (/ 1.0 214.0))
(s81 (/ 1.0 214.0))
(s82 (/ 1.0 214.0))
(s83 (/ 1.0 214.0))
(s84 (/ 1.0 214.0))
(s85 (/ 1.0 214.0))
(s86 (/ 1.0 214.0))
(s87 (/ 1.0 214.0))
(s88 (/ 205.0 214.0))
(s89 (/ 1.0 214.0))
(s90 0.0)
(s91 0.0)
(s92 (/ 1.0 214.0))
(s93 (/ 1.0 214.0))
(s94 0.0)
(s95 0.0)
(s96 (/ 1.0 214.0))
(s97 0.0)
(s98 (/ 105.0 107.0))
(s99 0.0)
(s100 (/ 1.0 214.0))
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 (/ 1.0 214.0))
(s107 0.0)
(s108 (/ 1.0 214.0))
(s109 (/ 1.0 214.0))
(s110 (/ 1.0 214.0))
(s111 (/ 1.0 214.0))
(s112 (/ 1.0 214.0))
(s113 (/ 1.0 214.0))
(s114 (/ 1.0 214.0))
(s115 (/ 1.0 214.0))
(s116 (/ 1.0 214.0))
(s117 (/ 1.0 214.0))
(s118 (/ 1.0 214.0))
(s119 (/ 1.0 214.0))
(s120 (/ 1.0 214.0))
(s121 (/ 1.0 214.0))
(s122 (/ 1.0 214.0))
(s123 (/ 1.0 214.0))
(s124 (/ 1.0 214.0))
(s125 (/ 1.0 214.0))
(s126 (/ 1.0 214.0))
(s127 (/ 1.0 214.0))
(s128 (/ 1.0 214.0))
(s129 (/ 1.0 214.0))
(s130 (/ 1.0 214.0))
(s131 (/ 1.0 214.0))
(s132 (/ 1.0 214.0))
(s133 (/ 1.0 214.0))
(s134 (/ 1.0 214.0))
(s135 (/ 1.0 214.0))
(s136 (/ 1.0 214.0))
(s137 (/ 1.0 214.0))
(s138 (/ 1.0 214.0))
(s139 (/ 1.0 214.0))
(s140 (/ 1.0 214.0))
(s141 (/ 1.0 214.0))
(s142 (/ 1.0 214.0))
(s143 (/ 1.0 214.0))
(s144 (/ 1.0 214.0))
(s145 (/ 1.0 214.0))
(s146 (/ 1.0 214.0))
(s147 (/ 1.0 214.0))
(s148 (/ 1.0 214.0))
(s149 (/ 1.0 214.0))
(s150 (/ 1.0 214.0))
(s151 (/ 1.0 214.0))
(s152 (/ 1.0 214.0))
(s153 (/ 1.0 214.0))
(s154 (/ 1.0 214.0))
(s155 (/ 1.0 214.0))
(s156 (/ 1.0 214.0))
(s157 (/ 1.0 214.0))
(s158 (/ 1.0 214.0))
(s159 (/ 1.0 214.0))
(s160 (/ 1.0 214.0))
(s161 (/ 1.0 214.0))
(s162 (/ 1.0 214.0))
(s163 (/ 1.0 214.0))
(s164 (/ 1.0 214.0))
(s165 (/ 1.0 214.0))
(s166 (/ 1.0 214.0))
(s167 (/ 1.0 214.0))
(s168 (/ 1.0 214.0))
(s169 (/ 1.0 214.0))
(s170 (/ 1.0 214.0))
(s171 (/ 1.0 214.0))
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 (/ 1.0 214.0))
(s176 (/ 1.0 214.0))
(s177 (/ 1.0 214.0))
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 (/ 1.0 214.0))
(s184 (/ 1.0 214.0))
(s185 (/ 1.0 214.0))
(s186 (/ 1.0 214.0))
(s187 (/ 1.0 214.0))
(s188 (/ 1.0 214.0))
(s189 (/ 1.0 214.0))
(s190 (/ 1.0 214.0))
(s191 (/ 1.0 214.0))
(s192 (/ 1.0 214.0))
(s193 (/ 1.0 214.0))
(s194 (/ 1.0 214.0))
(s195 (/ 1.0 214.0))
(s196 (/ 1.0 214.0))
(s197 (/ 1.0 214.0))
(s198 (/ 1.0 214.0))
(s199 (/ 1.0 214.0))
(s200 0.0)
(s201 (/ 1.0 214.0))
(s202 (/ 1.0 214.0))
(s203 (/ 1.0 214.0))
(s204 0.0)
(s205 (/ 1.0 214.0))
(s206 (/ 1.0 214.0))
(s207 (/ 1.0 214.0))
(s208 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1123 variables, and 437 constraints, problems are : Problem set: 0 solved, 265 unsolved in 5074 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/428 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 265/265 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 163/428 variables, 9/274 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 163/437 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 244 places in 216 ms of which 29 ms to minimize.
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 4 ms to minimize.
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 3 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 80 places in 175 ms of which 5 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 132 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 128 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 116 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 113 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 137 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 142 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 151 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 151 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 3 ms to minimize.
SMT process timed out in 10347ms, After SMT, problems are : Problem set: 0 solved, 265 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 265 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 697/697 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 424 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 424 transition count 654
Reduce places removed 40 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 1 with 42 rules applied. Total rules applied 86 place count 384 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 383 transition count 652
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 87 place count 383 transition count 645
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 101 place count 376 transition count 645
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 114 place count 363 transition count 631
Iterating global reduction 3 with 13 rules applied. Total rules applied 127 place count 363 transition count 631
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 363 transition count 629
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 132 place count 360 transition count 569
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 360 transition count 569
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 360 transition count 567
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 175 place count 341 transition count 548
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 189 place count 334 transition count 555
Free-agglomeration rule applied 15 times.
Iterating global reduction 5 with 15 rules applied. Total rules applied 204 place count 334 transition count 540
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 222 place count 319 transition count 537
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 225 place count 319 transition count 534
Applied a total of 225 rules in 147 ms. Remains 319 /428 variables (removed 109) and now considering 534/697 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 319/428 places, 534/697 transitions.
RANDOM walk for 4000000 steps (247919 resets) in 43635 ms. (91 steps per ms) remains 123/265 properties
BEST_FIRST walk for 40003 steps (565 resets) in 131 ms. (303 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (583 resets) in 113 ms. (350 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (579 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (578 resets) in 95 ms. (416 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (579 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (589 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (590 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (581 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (593 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (583 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (596 resets) in 97 ms. (408 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (578 resets) in 100 ms. (396 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (591 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (578 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (595 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (589 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (574 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (563 resets) in 92 ms. (430 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (576 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (585 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (579 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (592 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (580 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (603 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (603 resets) in 92 ms. (430 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (576 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (571 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (569 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (580 resets) in 94 ms. (421 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (583 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (593 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (579 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (568 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (595 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (580 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (591 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (561 resets) in 94 ms. (421 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (580 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (584 resets) in 94 ms. (421 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (590 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (562 resets) in 92 ms. (430 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (581 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (590 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (597 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (580 resets) in 148 ms. (268 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (591 resets) in 110 ms. (360 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (574 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (601 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (586 resets) in 91 ms. (434 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (557 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
[2024-06-02 18:21:56] [INFO ] Flow matrix only has 532 transitions (discarded 2 similar events)
// Phase 1: matrix 532 rows 319 cols
[2024-06-02 18:21:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:21:56] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 166/289 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 20/309 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 530/839 variables, 309/316 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/839 variables, 23/339 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/839 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 12/851 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/851 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/851 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 349 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7429 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 319/319 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 166/289 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 107 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 107 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 95 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 105 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:22:05] [INFO ] Deduced a trap composed of 105 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:22:05] [INFO ] Deduced a trap composed of 117 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:22:05] [INFO ] Deduced a trap composed of 118 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:06] [INFO ] Deduced a trap composed of 118 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:22:06] [INFO ] Deduced a trap composed of 93 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:22:06] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:22:06] [INFO ] Deduced a trap composed of 108 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 20/309 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:07] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-06-02 18:22:08] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:22:08] [INFO ] Deduced a trap composed of 122 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:22:08] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:09] [INFO ] Deduced a trap composed of 111 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:11] [INFO ] Deduced a trap composed of 109 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 105 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:12] [INFO ] Deduced a trap composed of 125 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 530/839 variables, 309/337 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/839 variables, 23/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/839 variables, 123/483 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/839 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 17 (OVERLAPS) 12/851 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/851 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 19 (OVERLAPS) 0/851 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 495 constraints, problems are : Problem set: 0 solved, 123 unsolved in 37832 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 319/319 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 23/23 constraints]
After SMT, in 45298ms problems are : Problem set: 0 solved, 123 unsolved
Parikh walk visited 2 properties in 8218 ms.
Support contains 121 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 534/534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 319 transition count 494
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 279 transition count 494
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 279 transition count 493
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 278 transition count 493
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 273 transition count 487
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 273 transition count 487
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 138 place count 250 transition count 464
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 250 transition count 462
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 168 place count 236 transition count 503
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 236 transition count 502
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 180 place count 236 transition count 491
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 188 place count 236 transition count 483
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 196 place count 228 transition count 483
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 199 place count 228 transition count 619
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 202 place count 225 transition count 619
Applied a total of 202 rules in 98 ms. Remains 225 /319 variables (removed 94) and now considering 619/534 (removed -85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 225/319 places, 619/534 transitions.
RANDOM walk for 4000000 steps (155469 resets) in 43964 ms. (90 steps per ms) remains 61/121 properties
BEST_FIRST walk for 400001 steps (4040 resets) in 871 ms. (458 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4040 resets) in 898 ms. (444 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (4123 resets) in 1350 ms. (296 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (4063 resets) in 920 ms. (434 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4030 resets) in 1141 ms. (350 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4055 resets) in 1287 ms. (310 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4091 resets) in 1091 ms. (366 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (4078 resets) in 1008 ms. (396 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (4050 resets) in 894 ms. (446 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4096 resets) in 949 ms. (421 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4063 resets) in 1069 ms. (373 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4032 resets) in 1008 ms. (396 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4084 resets) in 1270 ms. (314 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4088 resets) in 1372 ms. (291 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (4112 resets) in 1037 ms. (385 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4054 resets) in 902 ms. (442 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4099 resets) in 1048 ms. (381 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4083 resets) in 957 ms. (417 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4078 resets) in 1412 ms. (283 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (4070 resets) in 914 ms. (437 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4070 resets) in 961 ms. (415 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (4040 resets) in 942 ms. (424 steps per ms) remains 60/61 properties
BEST_FIRST walk for 400004 steps (4032 resets) in 1348 ms. (296 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (4089 resets) in 1349 ms. (296 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400004 steps (4093 resets) in 1350 ms. (296 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (4088 resets) in 915 ms. (436 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (4101 resets) in 959 ms. (416 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (4084 resets) in 1104 ms. (361 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (4035 resets) in 1103 ms. (362 steps per ms) remains 56/59 properties
BEST_FIRST walk for 400004 steps (4055 resets) in 885 ms. (451 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (4103 resets) in 921 ms. (433 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4087 resets) in 913 ms. (437 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4118 resets) in 1346 ms. (296 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4065 resets) in 1343 ms. (297 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4103 resets) in 1340 ms. (298 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4058 resets) in 914 ms. (437 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4097 resets) in 899 ms. (444 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4061 resets) in 882 ms. (453 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4013 resets) in 902 ms. (442 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4050 resets) in 946 ms. (422 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400000 steps (4046 resets) in 940 ms. (425 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4061 resets) in 910 ms. (439 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4066 resets) in 980 ms. (407 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4077 resets) in 904 ms. (441 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4082 resets) in 916 ms. (436 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4056 resets) in 891 ms. (448 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4025 resets) in 960 ms. (416 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4039 resets) in 1211 ms. (330 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (4110 resets) in 914 ms. (437 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (4035 resets) in 920 ms. (434 steps per ms) remains 54/56 properties
BEST_FIRST walk for 400002 steps (4060 resets) in 919 ms. (434 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4070 resets) in 971 ms. (411 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4062 resets) in 916 ms. (436 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4068 resets) in 893 ms. (447 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4066 resets) in 732 ms. (545 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4041 resets) in 706 ms. (565 steps per ms) remains 54/54 properties
[2024-06-02 18:23:25] [INFO ] Flow matrix only has 614 transitions (discarded 5 similar events)
// Phase 1: matrix 614 rows 225 cols
[2024-06-02 18:23:25] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:23:25] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 125/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 34/213 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 610/823 variables, 213/220 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 71/291 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 14/837 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 2/839 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 303 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 225/225 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 125/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 34/213 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:23:28] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:23:29] [INFO ] Deduced a trap composed of 127 places in 101 ms of which 1 ms to minimize.
[2024-06-02 18:23:29] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:23:29] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:23:29] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:23:29] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:23:29] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:23:29] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 610/823 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 71/299 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 54/353 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 1 ms to minimize.
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 127 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/823 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/823 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 14/837 variables, 10/370 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 15 (OVERLAPS) 2/839 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 17 (OVERLAPS) 0/839 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 372 constraints, problems are : Problem set: 0 solved, 54 unsolved in 11711 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 225/225 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 15/15 constraints]
After SMT, in 14769ms problems are : Problem set: 0 solved, 54 unsolved
Parikh walk visited 0 properties in 5968 ms.
Support contains 54 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 619/619 transitions.
Graph (complete) has 989 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) 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 0 with 4 rules applied. Total rules applied 5 place count 223 transition count 615
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 221 transition count 615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 221 transition count 614
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 220 transition count 614
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 25 place count 204 transition count 598
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 204 transition count 598
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 197 transition count 591
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 197 transition count 591
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 196 transition count 589
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 196 transition count 589
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 83 place count 183 transition count 576
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 177 transition count 560
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 177 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 177 transition count 559
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 175 transition count 553
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 175 transition count 553
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 106 place count 175 transition count 547
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 114 place count 171 transition count 551
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 171 transition count 549
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 171 transition count 546
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 122 place count 168 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 168 transition count 545
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 126 place count 168 transition count 545
Applied a total of 126 rules in 85 ms. Remains 168 /225 variables (removed 57) and now considering 545/619 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 168/225 places, 545/619 transitions.
RANDOM walk for 4000000 steps (155288 resets) in 30770 ms. (129 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400004 steps (4083 resets) in 854 ms. (467 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4103 resets) in 1095 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (4044 resets) in 907 ms. (440 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4078 resets) in 953 ms. (419 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4078 resets) in 838 ms. (476 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400001 steps (4035 resets) in 871 ms. (458 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (4081 resets) in 868 ms. (460 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (4093 resets) in 809 ms. (493 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4067 resets) in 1287 ms. (310 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (4090 resets) in 940 ms. (425 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400001 steps (4070 resets) in 941 ms. (424 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4036 resets) in 923 ms. (432 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400003 steps (4056 resets) in 1035 ms. (386 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4039 resets) in 814 ms. (490 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4074 resets) in 966 ms. (413 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4069 resets) in 893 ms. (447 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4096 resets) in 894 ms. (446 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4073 resets) in 862 ms. (463 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4076 resets) in 1214 ms. (329 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4045 resets) in 898 ms. (444 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4029 resets) in 876 ms. (456 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4080 resets) in 1290 ms. (309 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4040 resets) in 835 ms. (478 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4021 resets) in 1009 ms. (396 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4079 resets) in 832 ms. (480 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4048 resets) in 1038 ms. (384 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4072 resets) in 839 ms. (476 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4050 resets) in 829 ms. (481 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4028 resets) in 839 ms. (476 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4072 resets) in 1337 ms. (298 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4040 resets) in 829 ms. (481 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4045 resets) in 969 ms. (412 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4042 resets) in 945 ms. (422 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4079 resets) in 790 ms. (505 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (3999 resets) in 686 ms. (582 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4055 resets) in 679 ms. (588 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4035 resets) in 673 ms. (593 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4090 resets) in 676 ms. (590 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4087 resets) in 671 ms. (595 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4055 resets) in 682 ms. (585 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4099 resets) in 666 ms. (599 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4044 resets) in 662 ms. (603 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4014 resets) in 662 ms. (603 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4065 resets) in 654 ms. (610 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4032 resets) in 660 ms. (605 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4012 resets) in 670 ms. (596 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4081 resets) in 661 ms. (604 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4043 resets) in 666 ms. (599 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4056 resets) in 660 ms. (605 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4079 resets) in 657 ms. (607 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4077 resets) in 669 ms. (597 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400004 steps (4050 resets) in 659 ms. (606 steps per ms) remains 51/51 properties
Finished probabilistic random walk after 5041954 steps, run visited all 51 properties in 31529 ms. (steps per millisecond=159 )
Probabilistic random walk after 5041954 steps, saw 1350972 distinct states, run finished after 31535 ms. (steps per millisecond=159 ) properties seen :51
Able to resolve query StableMarking after proving 373 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 190224 ms.
ITS solved all properties within timeout

BK_STOP 1717352681565

--------------------
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 StableMarking -timeout 180 -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="FireWire-PT-18"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 FireWire-PT-18, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905900193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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