fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r579-smll-171734921300143
Last Updated
July 7, 2024

About the Execution of LTSMin+red for MedleyA-PT-18

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
655.355 364183.00 540182.00 1157.70 TFT?FT?FTF?F?TF? 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.r579-smll-171734921300143.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 MedleyA-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717361477360

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:51:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:51:20] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2024-06-02 20:51:20] [INFO ] Transformed 252 places.
[2024-06-02 20:51:20] [INFO ] Transformed 543 transitions.
[2024-06-02 20:51:20] [INFO ] Found NUPN structural information;
[2024-06-02 20:51:20] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 607 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
RANDOM walk for 40000 steps (1528 resets) in 3557 ms. (11 steps per ms) remains 15/16 properties
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4002 steps (34 resets) in 114 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 105 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 73 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 73 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 531 ms. (7 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 124 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 141 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 418 ms. (9 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 157 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 229 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 87 ms. (45 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (35 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (36 resets) in 115 ms. (34 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 357888 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :4 out of 15
Probabilistic random walk after 357888 steps, saw 69070 distinct states, run finished after 3012 ms. (steps per millisecond=118 ) properties seen :4
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 541 rows 252 cols
[2024-06-02 20:51:25] [INFO ] Computed 7 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-18-ReachabilityFireability-2024-04 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 107/252 variables, 7/152 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 107/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 541/793 variables, 252/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 511 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2365 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 127/252 variables, 7/132 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 127/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 20:51:29] [INFO ] Deduced a trap composed of 16 places in 545 ms of which 102 ms to minimize.
[2024-06-02 20:51:30] [INFO ] Deduced a trap composed of 17 places in 528 ms of which 2 ms to minimize.
[2024-06-02 20:51:30] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 3 ms to minimize.
[2024-06-02 20:51:30] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 4 ms to minimize.
[2024-06-02 20:51:31] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 4 ms to minimize.
[2024-06-02 20:51:31] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 4 ms to minimize.
[2024-06-02 20:51:31] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 4 ms to minimize.
Problem MedleyA-PT-18-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 6 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 58 places in 280 ms of which 4 ms to minimize.
[2024-06-02 20:51:33] [INFO ] Deduced a trap composed of 44 places in 317 ms of which 4 ms to minimize.
[2024-06-02 20:51:33] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 13 ms to minimize.
[2024-06-02 20:51:33] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 3 ms to minimize.
SMT process timed out in 8191ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 98 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 76 edges and 252 vertex of which 4 / 252 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 249 transition count 516
Reduce places removed 21 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 30 rules applied. Total rules applied 52 place count 228 transition count 507
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 63 place count 219 transition count 505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 218 transition count 505
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 64 place count 218 transition count 498
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 78 place count 211 transition count 498
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 97 place count 192 transition count 466
Iterating global reduction 4 with 19 rules applied. Total rules applied 116 place count 192 transition count 466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 116 place count 192 transition count 465
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 191 transition count 465
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 132 place count 184 transition count 458
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 181 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 151 place count 181 transition count 449
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 155 place count 177 transition count 445
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 177 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 175 transition count 443
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 173 transition count 456
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 172 place count 173 transition count 451
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 177 place count 168 transition count 451
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 168 transition count 451
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 168 transition count 451
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 167 transition count 450
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 167 transition count 450
Applied a total of 181 rules in 403 ms. Remains 167 /252 variables (removed 85) and now considering 450/541 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 167/252 places, 450/541 transitions.
RANDOM walk for 40000 steps (2100 resets) in 770 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (581 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (547 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (548 resets) in 283 ms. (140 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (504 resets) in 268 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (546 resets) in 502 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (561 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (549 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (548 resets) in 119 ms. (333 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (558 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
// Phase 1: matrix 450 rows 167 cols
[2024-06-02 20:51:35] [INFO ] Computed 7 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 69/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 450/617 variables, 167/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/617 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 174 constraints, problems are : Problem set: 0 solved, 8 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 69/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 3 ms to minimize.
[2024-06-02 20:51:37] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-02 20:51:37] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2024-06-02 20:51:37] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:51:37] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:51:37] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 4 ms to minimize.
[2024-06-02 20:51:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:51:38] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:51:38] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:51:38] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 2 ms to minimize.
[2024-06-02 20:51:38] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:51:38] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:51:38] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyA-PT-18-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 450/617 variables, 167/190 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 7/197 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 20:51:49] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:51:50] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/617 variables, 2/199 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 20:51:57] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:51:57] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 2/201 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/617 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/617 variables, and 201 constraints, problems are : Problem set: 1 solved, 7 unsolved in 30598 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 20/20 constraints]
After SMT, in 31632ms problems are : Problem set: 1 solved, 7 unsolved
Parikh walk visited 0 properties in 40842 ms.
Support contains 97 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 450/450 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 449
Applied a total of 2 rules in 44 ms. Remains 166 /167 variables (removed 1) and now considering 449/450 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 166/167 places, 449/450 transitions.
RANDOM walk for 40000 steps (2094 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (551 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (551 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (506 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (550 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (548 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (551 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (542 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 498181 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :2 out of 7
Probabilistic random walk after 498181 steps, saw 85259 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :2
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 449 rows 166 cols
[2024-06-02 20:52:51] [INFO ] Computed 7 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 77/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 449/615 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/615 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 615/615 variables, and 173 constraints, problems are : Problem set: 0 solved, 5 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 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/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 77/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 5 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 3 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-06-02 20:52:53] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 3 ms to minimize.
[2024-06-02 20:52:53] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2024-06-02 20:52:53] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-06-02 20:52:53] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 449/615 variables, 166/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:52:58] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:52:58] [INFO ] Deduced a trap composed of 97 places in 206 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:53:00] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/615 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 615/615 variables, and 194 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9902 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 16/16 constraints]
After SMT, in 10401ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 24802 ms.
Support contains 89 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 449/449 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 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 165 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 165 transition count 447
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 164 transition count 447
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 161 transition count 441
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 161 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 160 transition count 443
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 160 transition count 439
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 156 transition count 439
Applied a total of 20 rules in 59 ms. Remains 156 /166 variables (removed 10) and now considering 439/449 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 156/166 places, 439/449 transitions.
RANDOM walk for 40000 steps (2095 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (547 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (512 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (549 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (554 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (543 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 559400 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 5
Probabilistic random walk after 559400 steps, saw 96426 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
// Phase 1: matrix 439 rows 156 cols
[2024-06-02 20:53:29] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:53:29] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 439/595 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 165 constraints, problems are : Problem set: 0 solved, 5 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 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/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:53:30] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 2 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 2 ms to minimize.
[2024-06-02 20:53:32] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:53:32] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:53:32] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 439/595 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:53:35] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/595 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 180 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5991 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 6647ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 15113 ms.
Support contains 89 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 439/439 transitions.
Applied a total of 0 rules in 15 ms. Remains 156 /156 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 156/156 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-06-02 20:53:51] [INFO ] Invariant cache hit.
[2024-06-02 20:53:51] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 20:53:51] [INFO ] Invariant cache hit.
[2024-06-02 20:53:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:53:52] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-02 20:53:52] [INFO ] Redundant transitions in 28 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 20:53:52] [INFO ] Invariant cache hit.
[2024-06-02 20:53:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 20:53:57] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 3 ms to minimize.
[2024-06-02 20:53:57] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 2 ms to minimize.
[2024-06-02 20:53:57] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 2 ms to minimize.
[2024-06-02 20:53:57] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 2 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 4 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 2 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 3 ms to minimize.
[2024-06-02 20:53:59] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:53:59] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 3 ms to minimize.
[2024-06-02 20:53:59] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:53:59] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:53:59] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 2 ms to minimize.
[2024-06-02 20:54:00] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 2 ms to minimize.
[2024-06-02 20:54:00] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 2 ms to minimize.
[2024-06-02 20:54:00] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 2 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 2 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 16 ms to minimize.
[2024-06-02 20:54:03] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2024-06-02 20:54:03] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 3 ms to minimize.
[2024-06-02 20:54:03] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 1 ms to minimize.
[2024-06-02 20:54:03] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-02 20:54:03] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 95 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 89 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 3 ms to minimize.
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 2 ms to minimize.
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:54:06] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 3 ms to minimize.
[2024-06-02 20:54:06] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:54:06] [INFO ] Deduced a trap composed of 89 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 20:54:09] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 2 ms to minimize.
[2024-06-02 20:54:09] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 3 ms to minimize.
[2024-06-02 20:54:09] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:54:10] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 3 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-06-02 20:54:12] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:54:12] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 3 ms to minimize.
[2024-06-02 20:54:12] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 3 ms to minimize.
[2024-06-02 20:54:13] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:54:14] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:54:14] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:54:14] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-06-02 20:54:15] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:54:15] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 3 ms to minimize.
[2024-06-02 20:54:16] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 3 ms to minimize.
[2024-06-02 20:54:16] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:54:16] [INFO ] Deduced a trap composed of 98 places in 243 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 2 ms to minimize.
[2024-06-02 20:54:18] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:54:18] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 2 ms to minimize.
[2024-06-02 20:54:18] [INFO ] Deduced a trap composed of 91 places in 255 ms of which 3 ms to minimize.
[2024-06-02 20:54:21] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 20:54:22] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 3 ms to minimize.
[2024-06-02 20:54:22] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/595 variables, and 74 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/156 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
At refinement iteration 4 (OVERLAPS) 439/595 variables, 156/230 constraints. Problems are: Problem set: 50 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 2/232 constraints. Problems are: Problem set: 50 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 388/620 constraints. Problems are: Problem set: 50 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 620 constraints, problems are : Problem set: 50 solved, 388 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 388/438 constraints, Known Traps: 67/67 constraints]
After SMT, in 60621ms problems are : Problem set: 50 solved, 388 unsolved
Search for dead transitions found 50 dead transitions in 60630ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/156 places, 389/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2024-06-02 20:54:52] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60985 ms. Remains : 156/156 places, 389/439 transitions.
RANDOM walk for 40000 steps (2097 resets) in 750 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (541 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (509 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (554 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (551 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (547 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 555140 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 5
Probabilistic random walk after 555140 steps, saw 95700 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
// Phase 1: matrix 389 rows 156 cols
[2024-06-02 20:54:56] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:54:56] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 389/545 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 165 constraints, problems are : Problem set: 0 solved, 5 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 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/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:54:56] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:54:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 3 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-06-02 20:54:59] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:54:59] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:54:59] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:54:59] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 389/545 variables, 156/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:55:24] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/545 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/545 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 187 constraints, problems are : Problem set: 0 solved, 5 unsolved in 28722 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 17/17 constraints]
After SMT, in 29180ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 20834 ms.
Support contains 89 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 389/389 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 156/156 places, 389/389 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 389/389 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2024-06-02 20:55:46] [INFO ] Invariant cache hit.
[2024-06-02 20:55:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:55:46] [INFO ] Invariant cache hit.
[2024-06-02 20:55:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:55:46] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 20:55:46] [INFO ] Redundant transitions in 19 ms returned []
Running 388 sub problems to find dead transitions.
[2024-06-02 20:55:46] [INFO ] Invariant cache hit.
[2024-06-02 20:55:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:55:50] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:55:50] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:55:50] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:55:50] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:55:50] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:55:50] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:55:52] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2024-06-02 20:55:52] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:55:52] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:55:52] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:55:52] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:55:54] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:55:54] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:55:54] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:55:54] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:55:54] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:55:55] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:55:55] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:55:55] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:55:55] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:55:55] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2024-06-02 20:55:55] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:55:55] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:55:56] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:55:56] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:55:58] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-06-02 20:55:58] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:55:58] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:55:58] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:55:58] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 1 ms to minimize.
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:56:00] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:56:00] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:56:00] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:56:00] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:56:01] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:56:01] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:56:01] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:56:02] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:02] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:56:02] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:56:03] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:56:03] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:56:04] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:56:04] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-06-02 20:56:04] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:05] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:56:10] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 9 (OVERLAPS) 389/545 variables, 156/235 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 237 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:19] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:56:19] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:56:19] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:56:20] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:56:21] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:23] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:26] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:56:27] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:56:27] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:56:28] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:56:28] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:56:29] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:56:29] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:32] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:56:32] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:56:33] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 20:56:37] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:56:37] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 9 (OVERLAPS) 389/545 variables, 156/253 constraints. Problems are: Problem set: 0 solved, 388 unsolved
SMT process timed out in 60259ms, After SMT, problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60600 ms. Remains : 156/156 places, 389/389 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-06-02 20:56:46] [INFO ] Invariant cache hit.
[2024-06-02 20:56:47] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 20:56:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 20:56:54] [INFO ] After 6881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 20:56:54] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:56:54] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:56:54] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:56:54] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:56:54] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:56:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 528 ms
[2024-06-02 20:56:55] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-06-02 20:56:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2024-06-02 20:56:55] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:56:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-02 20:56:55] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:56:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:56:56] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:56:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
TRAPS : Iteration 1
[2024-06-02 20:56:56] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:56:56] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:56:56] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:56:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 358 ms
[2024-06-02 20:57:00] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:57:00] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-02 20:57:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2024-06-02 20:57:02] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 4 ms to minimize.
[2024-06-02 20:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
TRAPS : Iteration 2
[2024-06-02 20:57:02] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2024-06-02 20:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-06-02 20:57:02] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:57:02] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:57:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2299 ms
[2024-06-02 20:57:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 3
[2024-06-02 20:57:05] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-06-02 20:57:07] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:57:07] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 7 ms to minimize.
[2024-06-02 20:57:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
TRAPS : Iteration 4
[2024-06-02 20:57:12] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:57:12] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:57:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1551 ms
TRAPS : Iteration 5
[2024-06-02 20:57:17] [INFO ] After 30859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 20:57:20] [INFO ] After 33743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 33881 ms.
[2024-06-02 20:57:20] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-02 20:57:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 156 places, 389 transitions and 1776 arcs took 17 ms.
[2024-06-02 20:57:21] [INFO ] Flatten gal took : 101 ms
Total runtime 361205 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-18-ReachabilityFireability-2024-03
Could not compute solution for formula : MedleyA-PT-18-ReachabilityFireability-2024-06
Could not compute solution for formula : MedleyA-PT-18-ReachabilityFireability-2024-10
Could not compute solution for formula : MedleyA-PT-18-ReachabilityFireability-2024-12
Could not compute solution for formula : MedleyA-PT-18-ReachabilityFireability-2024-15

BK_STOP 1717361841543

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name MedleyA-PT-18-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/1372/inv_0_
rfs formula name MedleyA-PT-18-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/1372/inv_1_
rfs formula name MedleyA-PT-18-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/1372/inv_2_
rfs formula name MedleyA-PT-18-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1372/inv_3_
rfs formula name MedleyA-PT-18-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/1372/inv_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="MedleyA-PT-18"
export BK_EXAMINATION="ReachabilityFireability"
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 MedleyA-PT-18, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921300143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;