About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2198.279 | 275341.00 | 328653.00 | 769.30 | FTTFTTTFFTFFTTFT | 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.r508-tall-171654350800070.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 MultiCrashLeafsetExtension-PT-S24C03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.2M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 06:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 06:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 8.8M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717200906277
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:15:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:15:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:15:07] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2024-06-01 00:15:07] [INFO ] Transformed 8390 places.
[2024-06-01 00:15:08] [INFO ] Transformed 12757 transitions.
[2024-06-01 00:15:08] [INFO ] Parsed PT model containing 8390 places and 12757 transitions and 52526 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1275 resets) in 2757 ms. (14 steps per ms) remains 12/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (231 resets) in 474 ms. (84 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (230 resets) in 315 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (230 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (232 resets) in 330 ms. (120 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (230 resets) in 342 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (231 resets) in 563 ms. (70 steps per ms) remains 11/12 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (231 resets) in 786 ms. (50 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (231 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (231 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (229 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (231 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
[2024-06-01 00:15:10] [INFO ] Flow matrix only has 12157 transitions (discarded 600 similar events)
// Phase 1: matrix 12157 rows 8390 cols
[2024-06-01 00:15:11] [INFO ] Computed 867 invariants in 902 ms
[2024-06-01 00:15:11] [INFO ] State equation strengthened by 3802 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2334/2435 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2435 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2435 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 44/2479 variables, 44/53 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2479 variables, 0/53 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 4032/6511 variables, 366/419 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6511 variables, 0/419 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/6519 variables, 8/427 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6519 variables, 0/427 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1848/8367 variables, 417/844 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8367 variables, 0/844 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/8390 variables, 23/867 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8390 variables, 0/867 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20547/20547 variables, and 9257 constraints, problems are : Problem set: 9 solved, 2 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 807/807 constraints, State Equation: 8390/8390 constraints, ReadFeed: 0/3802 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2331/2369 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-01 00:15:17] [INFO ] Deduced a trap composed of 1553 places in 1191 ms of which 126 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2369 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2369 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 26/2395 variables, 3/7 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-01 00:15:18] [INFO ] Deduced a trap composed of 85 places in 457 ms of which 7 ms to minimize.
[2024-06-01 00:15:19] [INFO ] Deduced a trap composed of 150 places in 454 ms of which 7 ms to minimize.
[2024-06-01 00:15:19] [INFO ] Deduced a trap composed of 219 places in 448 ms of which 7 ms to minimize.
[2024-06-01 00:15:20] [INFO ] Deduced a trap composed of 219 places in 467 ms of which 7 ms to minimize.
[2024-06-01 00:15:20] [INFO ] Deduced a trap composed of 160 places in 425 ms of which 6 ms to minimize.
[2024-06-01 00:15:21] [INFO ] Deduced a trap composed of 230 places in 391 ms of which 6 ms to minimize.
[2024-06-01 00:15:21] [INFO ] Deduced a trap composed of 219 places in 396 ms of which 7 ms to minimize.
SMT process timed out in 11461ms, After SMT, problems are : Problem set: 9 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 8390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8390/8390 places, 12757/12757 transitions.
Graph (complete) has 30079 edges and 8390 vertex of which 8356 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.32 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1771 transitions
Trivial Post-agglo rules discarded 1771 transitions
Performed 1771 trivial Post agglomeration. Transition count delta: 1771
Iterating post reduction 0 with 1771 rules applied. Total rules applied 1772 place count 8356 transition count 10986
Reduce places removed 1771 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 1792 rules applied. Total rules applied 3564 place count 6585 transition count 10965
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 3585 place count 6564 transition count 10965
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 3585 place count 6564 transition count 10816
Deduced a syphon composed of 149 places in 9 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 3883 place count 6415 transition count 10816
Discarding 1633 places :
Symmetric choice reduction at 3 with 1633 rule applications. Total rules 5516 place count 4782 transition count 9183
Iterating global reduction 3 with 1633 rules applied. Total rules applied 7149 place count 4782 transition count 9183
Discarding 530 places :
Symmetric choice reduction at 3 with 530 rule applications. Total rules 7679 place count 4252 transition count 7593
Iterating global reduction 3 with 530 rules applied. Total rules applied 8209 place count 4252 transition count 7593
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 8257 place count 4228 transition count 7569
Free-agglomeration rule (complex) applied 348 times.
Iterating global reduction 3 with 348 rules applied. Total rules applied 8605 place count 4228 transition count 8215
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 3 with 348 rules applied. Total rules applied 8953 place count 3880 transition count 8215
Partial Free-agglomeration rule applied 149 times.
Drop transitions (Partial Free agglomeration) removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 9102 place count 3880 transition count 8215
Applied a total of 9102 rules in 4341 ms. Remains 3880 /8390 variables (removed 4510) and now considering 8215/12757 (removed 4542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4361 ms. Remains : 3880/8390 places, 8215/12757 transitions.
RANDOM walk for 40000 steps (2062 resets) in 1085 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (248 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (248 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 26385 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 26385 steps, saw 11947 distinct states, run finished after 3006 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 00:15:29] [INFO ] Flow matrix only has 7331 transitions (discarded 884 similar events)
// Phase 1: matrix 7331 rows 3880 cols
[2024-06-01 00:15:29] [INFO ] Computed 833 invariants in 202 ms
[2024-06-01 00:15:29] [INFO ] State equation strengthened by 3736 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2705/2743 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2743 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2743 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/2744 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2744 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 914/3658 variables, 603/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3658 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/3700 variables, 42/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3700 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 180/3880 variables, 180/833 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3880 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7331/11211 variables, 3880/4713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11211 variables, 3736/8449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11211 variables, 0/8449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/11211 variables, 0/8449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11211/11211 variables, and 8449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4327 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 784/784 constraints, State Equation: 3880/3880 constraints, ReadFeed: 3736/3736 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2705/2743 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/2743 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 00:15:36] [INFO ] Deduced a trap composed of 1245 places in 1938 ms of which 17 ms to minimize.
[2024-06-01 00:15:37] [INFO ] Deduced a trap composed of 394 places in 1259 ms of which 14 ms to minimize.
[2024-06-01 00:15:39] [INFO ] Deduced a trap composed of 560 places in 1255 ms of which 13 ms to minimize.
[2024-06-01 00:15:40] [INFO ] Deduced a trap composed of 384 places in 1290 ms of which 12 ms to minimize.
[2024-06-01 00:15:41] [INFO ] Deduced a trap composed of 508 places in 1257 ms of which 13 ms to minimize.
[2024-06-01 00:15:43] [INFO ] Deduced a trap composed of 566 places in 1237 ms of which 13 ms to minimize.
[2024-06-01 00:15:44] [INFO ] Deduced a trap composed of 408 places in 1228 ms of which 13 ms to minimize.
[2024-06-01 00:15:45] [INFO ] Deduced a trap composed of 416 places in 1218 ms of which 13 ms to minimize.
[2024-06-01 00:15:46] [INFO ] Deduced a trap composed of 574 places in 1277 ms of which 12 ms to minimize.
[2024-06-01 00:15:48] [INFO ] Deduced a trap composed of 592 places in 1281 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2743 variables, 10/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2743 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/2744 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2744 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 914/3658 variables, 603/621 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 00:15:52] [INFO ] Deduced a trap composed of 5 places in 3669 ms of which 23 ms to minimize.
[2024-06-01 00:15:56] [INFO ] Deduced a trap composed of 68 places in 3799 ms of which 25 ms to minimize.
[2024-06-01 00:16:00] [INFO ] Deduced a trap composed of 241 places in 3728 ms of which 25 ms to minimize.
[2024-06-01 00:16:03] [INFO ] Deduced a trap composed of 180 places in 3717 ms of which 27 ms to minimize.
[2024-06-01 00:16:07] [INFO ] Deduced a trap composed of 193 places in 3515 ms of which 22 ms to minimize.
[2024-06-01 00:16:11] [INFO ] Deduced a trap composed of 126 places in 3675 ms of which 25 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 137 places in 3907 ms of which 26 ms to minimize.
[2024-06-01 00:16:18] [INFO ] Deduced a trap composed of 234 places in 3703 ms of which 25 ms to minimize.
[2024-06-01 00:16:22] [INFO ] Deduced a trap composed of 174 places in 3509 ms of which 24 ms to minimize.
SMT process timed out in 52774ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3880/3880 places, 8215/8215 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 3880 transition count 8207
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 3872 transition count 8207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 3872 transition count 8206
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 3871 transition count 8206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 3870 transition count 8205
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 3870 transition count 8205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 3869 transition count 8204
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 35 place count 3869 transition count 8235
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 48 place count 3856 transition count 8235
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 64 place count 3840 transition count 8219
Iterating global reduction 3 with 16 rules applied. Total rules applied 80 place count 3840 transition count 8219
Applied a total of 80 rules in 1590 ms. Remains 3840 /3880 variables (removed 40) and now considering 8219/8215 (removed -4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1590 ms. Remains : 3840/3880 places, 8219/8215 transitions.
RANDOM walk for 40000 steps (2084 resets) in 951 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (248 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 27997 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 1
Probabilistic random walk after 27997 steps, saw 12638 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 00:16:27] [INFO ] Flow matrix only has 7333 transitions (discarded 886 similar events)
// Phase 1: matrix 7333 rows 3840 cols
[2024-06-01 00:16:27] [INFO ] Computed 833 invariants in 207 ms
[2024-06-01 00:16:27] [INFO ] State equation strengthened by 3780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2667/2669 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2669 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/2707 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2707 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 905/3612 variables, 600/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3612 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/3656 variables, 44/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3656 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 184/3840 variables, 184/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3840 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7333/11173 variables, 3840/4673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11173 variables, 3780/8453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11173 variables, 0/8453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/11173 variables, 0/8453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11173/11173 variables, and 8453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4110 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 784/784 constraints, State Equation: 3840/3840 constraints, ReadFeed: 3780/3780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2667/2669 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2669 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/2707 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:16:33] [INFO ] Deduced a trap composed of 511 places in 1301 ms of which 13 ms to minimize.
[2024-06-01 00:16:34] [INFO ] Deduced a trap composed of 413 places in 1205 ms of which 12 ms to minimize.
[2024-06-01 00:16:36] [INFO ] Deduced a trap composed of 557 places in 1254 ms of which 12 ms to minimize.
[2024-06-01 00:16:37] [INFO ] Deduced a trap composed of 625 places in 1226 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2707 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2707 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 905/3612 variables, 600/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 5 places in 3666 ms of which 26 ms to minimize.
[2024-06-01 00:16:44] [INFO ] Deduced a trap composed of 170 places in 3578 ms of which 24 ms to minimize.
[2024-06-01 00:16:48] [INFO ] Deduced a trap composed of 226 places in 3463 ms of which 26 ms to minimize.
[2024-06-01 00:16:51] [INFO ] Deduced a trap composed of 277 places in 3417 ms of which 22 ms to minimize.
[2024-06-01 00:16:55] [INFO ] Deduced a trap composed of 39 places in 3575 ms of which 25 ms to minimize.
[2024-06-01 00:16:59] [INFO ] Deduced a trap composed of 70 places in 3458 ms of which 24 ms to minimize.
[2024-06-01 00:17:02] [INFO ] Deduced a trap composed of 98 places in 3423 ms of which 23 ms to minimize.
[2024-06-01 00:17:05] [INFO ] Deduced a trap composed of 123 places in 3371 ms of which 24 ms to minimize.
[2024-06-01 00:17:09] [INFO ] Deduced a trap composed of 145 places in 3299 ms of which 24 ms to minimize.
[2024-06-01 00:17:12] [INFO ] Deduced a trap composed of 164 places in 3340 ms of which 23 ms to minimize.
[2024-06-01 00:17:16] [INFO ] Deduced a trap composed of 123 places in 3332 ms of which 23 ms to minimize.
[2024-06-01 00:17:19] [INFO ] Deduced a trap composed of 232 places in 3504 ms of which 24 ms to minimize.
[2024-06-01 00:17:23] [INFO ] Deduced a trap composed of 187 places in 3623 ms of which 24 ms to minimize.
[2024-06-01 00:17:26] [INFO ] Deduced a trap composed of 274 places in 3494 ms of which 26 ms to minimize.
[2024-06-01 00:17:30] [INFO ] Deduced a trap composed of 145 places in 3336 ms of which 24 ms to minimize.
[2024-06-01 00:17:33] [INFO ] Deduced a trap composed of 254 places in 3417 ms of which 23 ms to minimize.
[2024-06-01 00:17:37] [INFO ] Deduced a trap composed of 98 places in 3479 ms of which 24 ms to minimize.
[2024-06-01 00:17:40] [INFO ] Deduced a trap composed of 70 places in 3395 ms of which 23 ms to minimize.
[2024-06-01 00:17:44] [INFO ] Deduced a trap composed of 208 places in 3478 ms of which 23 ms to minimize.
[2024-06-01 00:17:47] [INFO ] Deduced a trap composed of 217 places in 3538 ms of which 25 ms to minimize.
SMT process timed out in 80657ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3840 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3840/3840 places, 8219/8219 transitions.
Applied a total of 0 rules in 399 ms. Remains 3840 /3840 variables (removed 0) and now considering 8219/8219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 3840/3840 places, 8219/8219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3840/3840 places, 8219/8219 transitions.
Applied a total of 0 rules in 392 ms. Remains 3840 /3840 variables (removed 0) and now considering 8219/8219 (removed 0) transitions.
[2024-06-01 00:17:48] [INFO ] Flow matrix only has 7333 transitions (discarded 886 similar events)
[2024-06-01 00:17:48] [INFO ] Invariant cache hit.
[2024-06-01 00:17:57] [INFO ] Implicit Places using invariants in 9171 ms returned [4, 7, 9, 10, 11, 12, 16, 22, 30, 40, 52, 66, 82, 100, 120, 142, 165, 187, 188, 189, 190, 210, 228, 244, 258, 270, 280, 288, 294, 298, 300, 309, 315, 317, 318, 319, 320, 322, 326, 332, 340, 350, 362, 376, 392, 410, 430, 451, 471, 472, 473, 474, 492, 508, 522, 534, 544, 552, 558, 562, 564, 566, 575, 581, 583, 584, 585, 586, 588, 590, 594, 600, 608, 618, 630, 644, 660, 678, 697, 715, 716, 717, 718, 734, 748, 760, 770, 778, 784, 788, 790, 792, 794, 803, 809, 811, 812, 813, 814, 816, 818, 820, 824, 830, 838, 848, 860, 874, 890, 907, 923, 924, 925, 926, 940, 952, 962, 970, 976, 980, 982, 984, 986, 988, 997, 1003, 1005, 1006, 1007, 1008, 1010, 1012, 1014, 1016, 1020, 1026, 1034, 1044, 1056, 1070, 1085, 1099, 1100, 1101, 1102, 1114, 1124, 1132, 1138, 1142, 1144, 1146, 1148, 1150, 1152, 1161, 1167, 1169, 1170, 1171, 1172, 1174, 1176, 1178, 1180, 1182, 1186, 1192, 1200, 1210, 1222, 1235, 1247, 1248, 1249, 1250, 1260, 1268, 1274, 1278, 1280, 1282, 1284, 1286, 1288, 1290, 1299, 1305, 1307, 1308, 1309, 1310, 1312, 1314, 1316, 1318, 1320, 1322, 1326, 1332, 1340, 1350, 1361, 1371, 1372, 1373, 1374, 1382, 1388, 1392, 1394, 1396, 1398, 1400, 1402, 1404, 1406, 1415, 1421, 1423, 1424, 1425, 1426, 1428, 1430, 1432, 1434, 1436, 1438, 1440, 1444, 1450, 1458, 1467, 1475, 1476, 1477, 1478, 1484, 1488, 1490, 1492, 1494, 1496, 1498, 1500, 1502, 1504, 1513, 1519, 1521, 1522, 1523, 1524, 1526, 1528, 1530, 1532, 1534, 1536, 1538, 1540, 1544, 1550, 1557, 1563, 1564, 1565, 1566, 1570, 1572, 1574, 1576, 1578, 1580, 1582, 1584, 1586, 1588, 1597, 1603, 1605, 1606, 1607, 1608, 1610, 1612, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1630, 1635, 1639, 1640, 1641, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1671, 1677, 1679, 1680, 1681, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1705, 1707, 1708, 1709, 1710, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1739, 1745, 1747, 1748, 1749, 1750, 1752, 1754, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1775, 1776, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1806, 1808, 1811, 1813, 1814, 1815, 1816, 1818, 1820, 1822, 1824, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1841, 1842, 1843, 1845, 1847, 1849, 1851, 1853, 1855, 1857, 1859, 1861, 1863, 1872, 1878, 1880, 1881, 1882, 1883, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1908, 1909, 1910, 1912, 1914, 1916, 1918, 1920, 1922, 1924, 1926, 1928, 1930, 1939, 1945, 1947, 1948, 1949, 1950, 1952, 1954, 1956, 1958, 1960, 1962, 1964, 1966, 1968, 1970, 1972, 1975, 1976, 1977, 1978, 1980, 1982, 1984, 1986, 1988, 1990, 1992, 1994, 1996, 1998, 2007, 2013, 2015, 2016, 2017, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2034, 2036, 2038, 2042, 2048, 2049, 2050, 2051, 2055, 2057, 2059, 2061, 2063, 2065, 2067, 2069, 2073, 2082, 2088, 2090, 2091, 2092, 2093, 2095, 2097, 2099, 2101, 2103, 2105, 2107, 2109, 2111, 2115, 2121, 2128, 2129, 2130, 2131, 2137, 2141, 2143, 2145, 2147, 2149, 2151, 2153, 2155, 2157, 2166, 2172, 2174, 2175, 2176, 2177, 2179, 2181, 2183, 2185, 2187, 2189, 2191, 2193, 2197, 2203, 2211, 2220, 2221, 2222, 2223, 2231, 2237, 2241, 2243, 2245, 2247, 2249, 2251, 2253, 2255, 2264, 2270, 2272, 2273, 2274, 2275, 2277, 2279, 2281, 2283, 2285, 2287, 2289, 2293, 2299, 2307, 2317, 2328, 2329, 2330, 2331, 2341, 2349, 2355, 2359, 2361, 2363, 2365, 2367, 2369, 2371, 2380, 2386, 2388, 2389, 2390, 2391, 2393, 2395, 2397, 2399, 2401, 2403, 2407, 2413, 2421, 2431, 2443, 2456, 2457, 2458, 2459, 2471, 2481, 2489, 2495, 2499, 2501, 2503, 2505, 2507, 2509, 2518, 2524, 2526, 2527, 2528, 2529, 2531, 2533, 2535, 2537, 2539, 2543, 2549, 2557, 2567, 2579, 2593, 2608, 2609, 2610, 2611, 2625, 2637, 2647, 2655, 2661, 2665, 2667, 2669, 2671, 2673, 2682, 2688, 2690, 2691, 2692, 2693, 2695, 2697, 2699, 2701, 2705, 2711, 2719, 2729, 2741, 2755, 2771, 2788, 2789, 2790, 2791, 2807, 2821, 2833, 2843, 2851, 2857, 2861, 2863, 2865, 2867, 2876, 2882, 2884, 2885, 2886, 2887, 2889, 2891, 2893, 2897, 2903, 2911, 2921, 2933, 2947, 2963, 2981, 3000, 3001, 3002, 3003, 3021, 3037, 3051, 3063, 3073, 3081, 3087, 3091, 3093, 3095, 3104, 3110, 3112, 3113, 3114, 3115, 3117, 3119, 3123, 3129, 3137, 3147, 3159, 3173, 3189, 3207, 3227, 3248, 3249, 3250, 3251, 3271, 3289, 3305, 3319, 3331, 3341, 3349, 3355, 3359, 3361, 3370, 3372, 3375, 3377, 3378, 3379, 3380, 3382, 3386, 3392, 3400, 3410, 3422, 3436, 3452, 3470, 3490, 3512, 3535, 3536, 3537, 3538, 3560, 3580, 3598, 3614, 3628, 3640, 3650, 3658, 3664, 3668, 3677]
[2024-06-01 00:17:57] [INFO ] Actually due to overlaps returned [309, 575, 803, 997, 1161, 1299, 1415, 1513, 1597, 1671, 1739, 1806, 2082, 1872, 1939, 2007, 2166, 2264, 2380, 2518, 2682, 2876, 3104, 3370, 3677, 4, 9, 10, 11, 187, 188, 189, 317, 318, 319, 471, 472, 473, 583, 584, 585, 715, 716, 717, 811, 812, 813, 923, 924, 925, 1005, 1006, 1007, 1099, 1100, 1101, 1169, 1170, 1171, 1247, 1248, 1249, 1307, 1308, 1309, 1371, 1372, 1373, 1423, 1424, 1425, 1475, 1476, 1477, 1521, 1522, 1523, 1563, 1564, 1565, 1605, 1606, 1607, 1639, 1640, 1641, 1679, 1680, 1681, 1707, 1708, 1709, 1747, 1748, 1749, 1774, 1775, 1776, 1808, 1813, 1814, 1815, 1840, 1841, 1842, 1880, 1881, 1882, 1907, 1908, 1909, 1947, 1948, 1949, 1975, 1976, 1977, 2015, 2016, 2017, 2048, 2049, 2050, 2090, 2091, 2092, 2128, 2129, 2130, 2174, 2175, 2176, 2220, 2221, 2222, 2272, 2273, 2274, 2328, 2329, 2330, 2388, 2389, 2390, 2456, 2457, 2458, 2526, 2527, 2528, 2608, 2609, 2610, 2690, 2691, 2692, 2788, 2789, 2790, 2884, 2885, 2886, 3000, 3001, 3002, 3112, 3113, 3114, 3248, 3249, 3250, 3372, 3377, 3378, 3379, 3535, 3536, 3537]
Discarding 178 places :
Implicit Place search using SMT only with invariants took 9198 ms to find 178 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3662/3840 places, 8219/8219 transitions.
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 144 place count 3518 transition count 8075
Iterating global reduction 0 with 144 rules applied. Total rules applied 288 place count 3518 transition count 8075
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 432 place count 3374 transition count 7931
Iterating global reduction 0 with 144 rules applied. Total rules applied 576 place count 3374 transition count 7931
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 579 place count 3374 transition count 7928
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 582 place count 3371 transition count 7928
Applied a total of 582 rules in 1290 ms. Remains 3371 /3662 variables (removed 291) and now considering 7928/8219 (removed 291) transitions.
[2024-06-01 00:17:59] [INFO ] Flow matrix only has 7042 transitions (discarded 886 similar events)
// Phase 1: matrix 7042 rows 3371 cols
[2024-06-01 00:17:59] [INFO ] Computed 655 invariants in 133 ms
[2024-06-01 00:18:06] [INFO ] Implicit Places using invariants in 7690 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 203, 221, 237, 251, 263, 273, 281, 287, 291, 293, 306, 308, 310, 314, 320, 328, 338, 350, 364, 380, 398, 418, 439, 459, 477, 493, 507, 519, 529, 537, 543, 547, 549, 551, 559, 561, 563, 565, 569, 575, 583, 593, 605, 619, 635, 653, 672, 690, 706, 720, 732, 742, 750, 756, 760, 762, 764, 766, 774, 776, 778, 780, 782, 786, 792, 800, 810, 822, 836, 852, 869, 885, 899, 911, 921, 929, 935, 939, 941, 943, 945, 947, 955, 957, 959, 961, 963, 965, 969, 975, 983, 993, 1005, 1019, 1034, 1048, 1060, 1070, 1078, 1084, 1088, 1090, 1092, 1094, 1096, 1098, 1106, 1108, 1110, 1112, 1114, 1116, 1118, 1122, 1128, 1136, 1146, 1158, 1171, 1183, 1193, 1201, 1207, 1211, 1213, 1215, 1217, 1219, 1221, 1223, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1284, 1294, 1302, 1308, 1312, 1314, 1316, 1318, 1320, 1322, 1324, 1326, 1334, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1350, 1354, 1360, 1368, 1377, 1385, 1391, 1395, 1397, 1399, 1401, 1403, 1405, 1407, 1409, 1411, 1419, 1421, 1423, 1425, 1427, 1429, 1431, 1433, 1435, 1437, 1441, 1447, 1454, 1460, 1464, 1466, 1468, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1490, 1492, 1494, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1514, 1519, 1523, 1525, 1527, 1529, 1531, 1533, 1535, 1537, 1539, 1541, 1543, 1551, 1553, 1555, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1573, 1576, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1598, 1606, 1608, 1610, 1612, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1628, 1630, 1632, 1634, 1636, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1658, 1660, 1662, 1664, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1711, 1713, 1715, 1717, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1765, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1792, 1794, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1820, 1822, 1824, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1842, 1846, 1852, 1856, 1858, 1860, 1862, 1864, 1866, 1868, 1870, 1874, 1882, 1884, 1886, 1888, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1906, 1912, 1919, 1925, 1929, 1931, 1933, 1935, 1937, 1939, 1941, 1943, 1945, 1953, 1955, 1957, 1959, 1961, 1963, 1965, 1967, 1969, 1971, 1975, 1981, 1989, 1998, 2006, 2012, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2038, 2040, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2058, 2064, 2072, 2082, 2093, 2103, 2111, 2117, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2141, 2143, 2145, 2147, 2149, 2151, 2153, 2155, 2159, 2165, 2173, 2183, 2195, 2208, 2220, 2230, 2238, 2244, 2248, 2250, 2252, 2254, 2256, 2258, 2266, 2268, 2270, 2272, 2274, 2276, 2278, 2282, 2288, 2296, 2306, 2318, 2332, 2347, 2361, 2373, 2383, 2391, 2397, 2401, 2403, 2405, 2407, 2409, 2417, 2419, 2421, 2423, 2425, 2427, 2431, 2437, 2445, 2455, 2467, 2481, 2497, 2514, 2530, 2544, 2556, 2566, 2574, 2580, 2584, 2586, 2588, 2590, 2598, 2600, 2602, 2604, 2606, 2610, 2616, 2624, 2634, 2646, 2660, 2676, 2694, 2713, 2731, 2747, 2761, 2773, 2783, 2791, 2797, 2801, 2803, 2805, 2813, 2815, 2817, 2819, 2823, 2829, 2837, 2847, 2859, 2873, 2889, 2907, 2927, 2948, 2968, 2986, 3002, 3016, 3028, 3038, 3046, 3052, 3056, 3058, 3064, 3066, 3068, 3072, 3078, 3086, 3096, 3108, 3122, 3138, 3156, 3176, 3198, 3221, 3243, 3263, 3281, 3297, 3311, 3323, 3333, 3341, 3347, 3351]
Discarding 599 places :
Implicit Place search using SMT only with invariants took 7713 ms to find 599 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2772/3840 places, 7928/8219 transitions.
Applied a total of 0 rules in 398 ms. Remains 2772 /2772 variables (removed 0) and now considering 7928/7928 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 18994 ms. Remains : 2772/3840 places, 7928/8219 transitions.
RANDOM walk for 40000 steps (2253 resets) in 876 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (152 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 31465 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 1
Probabilistic random walk after 31465 steps, saw 13114 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-06-01 00:18:10] [INFO ] Flow matrix only has 7042 transitions (discarded 886 similar events)
// Phase 1: matrix 7042 rows 2772 cols
[2024-06-01 00:18:10] [INFO ] Computed 56 invariants in 134 ms
[2024-06-01 00:18:10] [INFO ] State equation strengthened by 3780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2662/2664 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2664 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2664 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 26/2690 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2690 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/2722 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2722 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/2766 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2766 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/2772 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2772 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7042/9814 variables, 2772/2828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/9814 variables, 3780/6608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/9814 variables, 0/6608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/9814 variables, 0/6608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9814/9814 variables, and 6608 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3390 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 2772/2772 constraints, ReadFeed: 3780/3780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2662/2664 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2664 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2664 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 26/2690 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:18:16] [INFO ] Deduced a trap composed of 369 places in 1900 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2690 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2690 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/2722 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:18:18] [INFO ] Deduced a trap composed of 5 places in 1893 ms of which 18 ms to minimize.
[2024-06-01 00:18:20] [INFO ] Deduced a trap composed of 140 places in 1761 ms of which 15 ms to minimize.
[2024-06-01 00:18:22] [INFO ] Deduced a trap composed of 39 places in 1914 ms of which 17 ms to minimize.
[2024-06-01 00:18:24] [INFO ] Deduced a trap composed of 70 places in 1926 ms of which 18 ms to minimize.
[2024-06-01 00:18:26] [INFO ] Deduced a trap composed of 98 places in 1958 ms of which 18 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 123 places in 1932 ms of which 17 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 226 places in 1978 ms of which 18 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 267 places in 2047 ms of which 18 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 145 places in 1865 ms of which 18 ms to minimize.
[2024-06-01 00:18:36] [INFO ] Deduced a trap composed of 276 places in 1905 ms of which 18 ms to minimize.
[2024-06-01 00:18:38] [INFO ] Deduced a trap composed of 180 places in 1924 ms of which 18 ms to minimize.
[2024-06-01 00:18:40] [INFO ] Deduced a trap composed of 277 places in 1767 ms of which 18 ms to minimize.
[2024-06-01 00:18:41] [INFO ] Deduced a trap composed of 292 places in 1849 ms of which 18 ms to minimize.
[2024-06-01 00:18:43] [INFO ] Deduced a trap composed of 292 places in 1862 ms of which 17 ms to minimize.
[2024-06-01 00:18:45] [INFO ] Deduced a trap composed of 278 places in 1846 ms of which 17 ms to minimize.
[2024-06-01 00:18:47] [INFO ] Deduced a trap composed of 287 places in 1857 ms of which 16 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 284 places in 1876 ms of which 18 ms to minimize.
[2024-06-01 00:18:51] [INFO ] Deduced a trap composed of 298 places in 1876 ms of which 17 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 293 places in 1818 ms of which 18 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 299 places in 1892 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2722 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:18:57] [INFO ] Deduced a trap composed of 299 places in 2012 ms of which 18 ms to minimize.
[2024-06-01 00:18:59] [INFO ] Deduced a trap composed of 315 places in 1931 ms of which 18 ms to minimize.
[2024-06-01 00:19:01] [INFO ] Deduced a trap composed of 301 places in 1753 ms of which 18 ms to minimize.
[2024-06-01 00:19:02] [INFO ] Deduced a trap composed of 301 places in 1836 ms of which 18 ms to minimize.
[2024-06-01 00:19:04] [INFO ] Deduced a trap composed of 333 places in 1884 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2722 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2722 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/2766 variables, 44/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:19:07] [INFO ] Deduced a trap composed of 315 places in 2061 ms of which 19 ms to minimize.
[2024-06-01 00:19:09] [INFO ] Deduced a trap composed of 117 places in 1936 ms of which 18 ms to minimize.
[2024-06-01 00:19:11] [INFO ] Deduced a trap composed of 130 places in 2058 ms of which 17 ms to minimize.
[2024-06-01 00:19:13] [INFO ] Deduced a trap composed of 84 places in 2098 ms of which 18 ms to minimize.
[2024-06-01 00:19:15] [INFO ] Deduced a trap composed of 106 places in 1993 ms of which 18 ms to minimize.
[2024-06-01 00:19:17] [INFO ] Deduced a trap composed of 127 places in 1946 ms of which 18 ms to minimize.
[2024-06-01 00:19:19] [INFO ] Deduced a trap composed of 108 places in 1922 ms of which 18 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 97 places in 1946 ms of which 18 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 330 places in 1930 ms of which 18 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 130 places in 1917 ms of which 17 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 114 places in 1920 ms of which 18 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 83 places in 1892 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2766 variables, 12/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2766 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/2772 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2772 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7042/9814 variables, 2772/2866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C03-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 9814/9814 variables, and 6646 constraints, problems are : Problem set: 1 solved, 0 unsolved in 87318 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 2772/2772 constraints, ReadFeed: 3780/3780 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 38/38 constraints]
After SMT, in 90912ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 274147 ms.
ITS solved all properties within timeout
BK_STOP 1717201181618
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350800070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C03.tgz
mv MultiCrashLeafsetExtension-PT-S24C03 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;