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

About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S24C05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10955.104 3600000.00 7132290.00 9364.10 ?TFTT?TTTT?FTTFF 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.r245-tall-171654349100087.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S24C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349100087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 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 12M 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-S24C05-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2023-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716592245145

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 23:10:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 23:10:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 23:10:47] [INFO ] Load time of PNML (sax parser for PT used): 628 ms
[2024-05-24 23:10:47] [INFO ] Transformed 11106 places.
[2024-05-24 23:10:47] [INFO ] Transformed 16561 transitions.
[2024-05-24 23:10:47] [INFO ] Parsed PT model containing 11106 places and 16561 transitions and 65150 arcs in 819 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (774 resets) in 3781 ms. (10 steps per ms) remains 14/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (144 resets) in 472 ms. (84 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (144 resets) in 723 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (144 resets) in 785 ms. (50 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 773 ms. (51 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 341 ms. (116 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 227 ms. (175 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (144 resets) in 242 ms. (164 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 248 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 299 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (144 resets) in 212 ms. (187 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (144 resets) in 261 ms. (152 steps per ms) remains 14/14 properties
[2024-05-24 23:10:50] [INFO ] Flow matrix only has 15961 transitions (discarded 600 similar events)
// Phase 1: matrix 15961 rows 11106 cols
[2024-05-24 23:10:51] [INFO ] Computed 975 invariants in 1329 ms
[2024-05-24 23:10:51] [INFO ] State equation strengthened by 5002 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 2306/2611 variables, 32/57 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2611 variables, 5/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2611 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 10/2621 variables, 10/72 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2621 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 5613/8234 variables, 386/458 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8234 variables, 0/458 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2849/11083 variables, 494/952 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/11083 variables, 0/952 constraints. Problems are: Problem set: 8 solved, 6 unsolved
SMT process timed out in 6933ms, After SMT, problems are : Problem set: 8 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 11106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Graph (complete) has 37715 edges and 11106 vertex of which 11068 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.37 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2948 transitions
Trivial Post-agglo rules discarded 2948 transitions
Performed 2948 trivial Post agglomeration. Transition count delta: 2948
Iterating post reduction 0 with 2948 rules applied. Total rules applied 2949 place count 11068 transition count 13613
Reduce places removed 2948 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 2996 rules applied. Total rules applied 5945 place count 8120 transition count 13565
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 5993 place count 8072 transition count 13565
Performed 246 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 246 Pre rules applied. Total rules applied 5993 place count 8072 transition count 13319
Deduced a syphon composed of 246 places in 13 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 3 with 492 rules applied. Total rules applied 6485 place count 7826 transition count 13319
Discarding 2742 places :
Symmetric choice reduction at 3 with 2742 rule applications. Total rules 9227 place count 5084 transition count 10577
Iterating global reduction 3 with 2742 rules applied. Total rules applied 11969 place count 5084 transition count 10577
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 11969 place count 5084 transition count 10572
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 11979 place count 5079 transition count 10572
Discarding 537 places :
Symmetric choice reduction at 3 with 537 rule applications. Total rules 12516 place count 4542 transition count 7887
Iterating global reduction 3 with 537 rules applied. Total rules applied 13053 place count 4542 transition count 7887
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 7 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 13099 place count 4519 transition count 7864
Free-agglomeration rule (complex) applied 329 times.
Iterating global reduction 3 with 329 rules applied. Total rules applied 13428 place count 4519 transition count 9639
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 3 with 329 rules applied. Total rules applied 13757 place count 4190 transition count 9639
Partial Free-agglomeration rule applied 121 times.
Drop transitions (Partial Free agglomeration) removed 121 transitions
Iterating global reduction 4 with 121 rules applied. Total rules applied 13878 place count 4190 transition count 9639
Applied a total of 13878 rules in 5476 ms. Remains 4190 /11106 variables (removed 6916) and now considering 9639/16561 (removed 6922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5496 ms. Remains : 4190/11106 places, 9639/16561 transitions.
RANDOM walk for 40000 steps (1268 resets) in 1690 ms. (23 steps per ms) remains 5/6 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (154 resets) in 291 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (153 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (154 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (156 resets) in 293 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (152 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
[2024-05-24 23:11:03] [INFO ] Flow matrix only has 8767 transitions (discarded 872 similar events)
// Phase 1: matrix 8767 rows 4190 cols
[2024-05-24 23:11:03] [INFO ] Computed 937 invariants in 228 ms
[2024-05-24 23:11:03] [INFO ] State equation strengthened by 4958 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2927/2975 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2975 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/2980 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2980 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1021/4001 variables, 723/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4001 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 24/4025 variables, 24/772 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4025 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 165/4190 variables, 165/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4190 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 8767/12957 variables, 4190/5127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (INCLUDED_ONLY) 0/12957 variables, 4958/10085 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12957 variables, 0/10085 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/12957 variables, 0/10085 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12957/12957 variables, and 10085 constraints, problems are : Problem set: 2 solved, 3 unsolved in 12703 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 888/888 constraints, State Equation: 4190/4190 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2927/2972 variables, 17/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 23:11:19] [INFO ] Deduced a trap composed of 241 places in 2435 ms of which 138 ms to minimize.
[2024-05-24 23:11:21] [INFO ] Deduced a trap composed of 514 places in 2265 ms of which 19 ms to minimize.
[2024-05-24 23:11:24] [INFO ] Deduced a trap composed of 538 places in 2375 ms of which 18 ms to minimize.
[2024-05-24 23:11:26] [INFO ] Deduced a trap composed of 534 places in 1724 ms of which 13 ms to minimize.
[2024-05-24 23:11:27] [INFO ] Deduced a trap composed of 931 places in 1726 ms of which 13 ms to minimize.
[2024-05-24 23:11:29] [INFO ] Deduced a trap composed of 525 places in 1729 ms of which 13 ms to minimize.
[2024-05-24 23:11:31] [INFO ] Deduced a trap composed of 946 places in 2246 ms of which 17 ms to minimize.
[2024-05-24 23:11:33] [INFO ] Deduced a trap composed of 476 places in 1734 ms of which 13 ms to minimize.
[2024-05-24 23:11:35] [INFO ] Deduced a trap composed of 494 places in 1671 ms of which 14 ms to minimize.
[2024-05-24 23:11:37] [INFO ] Deduced a trap composed of 534 places in 1680 ms of which 13 ms to minimize.
[2024-05-24 23:11:38] [INFO ] Deduced a trap composed of 493 places in 1642 ms of which 14 ms to minimize.
[2024-05-24 23:11:40] [INFO ] Deduced a trap composed of 498 places in 1675 ms of which 13 ms to minimize.
[2024-05-24 23:11:42] [INFO ] Deduced a trap composed of 478 places in 1703 ms of which 13 ms to minimize.
[2024-05-24 23:11:44] [INFO ] Deduced a trap composed of 500 places in 1692 ms of which 13 ms to minimize.
[2024-05-24 23:11:45] [INFO ] Deduced a trap composed of 982 places in 1321 ms of which 12 ms to minimize.
[2024-05-24 23:11:47] [INFO ] Deduced a trap composed of 480 places in 2197 ms of which 15 ms to minimize.
[2024-05-24 23:11:50] [INFO ] Deduced a trap composed of 478 places in 2295 ms of which 17 ms to minimize.
[2024-05-24 23:11:52] [INFO ] Deduced a trap composed of 895 places in 2286 ms of which 17 ms to minimize.
[2024-05-24 23:11:54] [INFO ] Deduced a trap composed of 448 places in 2156 ms of which 17 ms to minimize.
[2024-05-24 23:11:56] [INFO ] Deduced a trap composed of 484 places in 2135 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2972 variables, 20/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 23:11:59] [INFO ] Deduced a trap composed of 914 places in 2279 ms of which 17 ms to minimize.
[2024-05-24 23:12:01] [INFO ] Deduced a trap composed of 454 places in 2172 ms of which 20 ms to minimize.
[2024-05-24 23:12:03] [INFO ] Deduced a trap composed of 534 places in 1659 ms of which 13 ms to minimize.
SMT process timed out in 59555ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 4190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4190/4190 places, 9639/9639 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 4190 transition count 9638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4189 transition count 9638
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4189 transition count 9638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 4188 transition count 9637
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 4188 transition count 9637
Applied a total of 5 rules in 1462 ms. Remains 4188 /4190 variables (removed 2) and now considering 9637/9639 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1463 ms. Remains : 4188/4190 places, 9637/9639 transitions.
RANDOM walk for 40000 steps (1268 resets) in 1597 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (153 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (153 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (156 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 19522 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :0 out of 3
Probabilistic random walk after 19522 steps, saw 8962 distinct states, run finished after 3006 ms. (steps per millisecond=6 ) properties seen :0
[2024-05-24 23:12:08] [INFO ] Flow matrix only has 8765 transitions (discarded 872 similar events)
// Phase 1: matrix 8765 rows 4188 cols
[2024-05-24 23:12:08] [INFO ] Computed 937 invariants in 227 ms
[2024-05-24 23:12:08] [INFO ] State equation strengthened by 4958 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2903/2948 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2948 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/2953 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2953 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1023/3976 variables, 702/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3976 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/4002 variables, 26/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4002 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 186/4188 variables, 186/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4188 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8765/12953 variables, 4188/5125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12953 variables, 4958/10083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12953 variables, 0/10083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/12953 variables, 0/10083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12953/12953 variables, and 10083 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11149 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 888/888 constraints, State Equation: 4188/4188 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2903/2948 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 23:12:22] [INFO ] Deduced a trap composed of 241 places in 2109 ms of which 16 ms to minimize.
[2024-05-24 23:12:24] [INFO ] Deduced a trap composed of 424 places in 2193 ms of which 17 ms to minimize.
[2024-05-24 23:12:26] [INFO ] Deduced a trap composed of 919 places in 2114 ms of which 17 ms to minimize.
[2024-05-24 23:12:28] [INFO ] Deduced a trap composed of 508 places in 1675 ms of which 14 ms to minimize.
[2024-05-24 23:12:30] [INFO ] Deduced a trap composed of 903 places in 1745 ms of which 13 ms to minimize.
[2024-05-24 23:12:31] [INFO ] Deduced a trap composed of 955 places in 1694 ms of which 14 ms to minimize.
[2024-05-24 23:12:34] [INFO ] Deduced a trap composed of 918 places in 2106 ms of which 16 ms to minimize.
[2024-05-24 23:12:36] [INFO ] Deduced a trap composed of 497 places in 2130 ms of which 16 ms to minimize.
[2024-05-24 23:12:38] [INFO ] Deduced a trap composed of 918 places in 2023 ms of which 17 ms to minimize.
[2024-05-24 23:12:40] [INFO ] Deduced a trap composed of 455 places in 2049 ms of which 16 ms to minimize.
[2024-05-24 23:12:42] [INFO ] Deduced a trap composed of 463 places in 2085 ms of which 17 ms to minimize.
[2024-05-24 23:12:44] [INFO ] Deduced a trap composed of 479 places in 2033 ms of which 17 ms to minimize.
[2024-05-24 23:12:46] [INFO ] Deduced a trap composed of 451 places in 2006 ms of which 17 ms to minimize.
[2024-05-24 23:12:49] [INFO ] Deduced a trap composed of 434 places in 2083 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2948 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 23:12:51] [INFO ] Deduced a trap composed of 486 places in 2062 ms of which 17 ms to minimize.
[2024-05-24 23:12:53] [INFO ] Deduced a trap composed of 483 places in 2107 ms of which 16 ms to minimize.
[2024-05-24 23:12:55] [INFO ] Deduced a trap composed of 517 places in 2115 ms of which 17 ms to minimize.
[2024-05-24 23:12:57] [INFO ] Deduced a trap composed of 533 places in 1532 ms of which 13 ms to minimize.
[2024-05-24 23:12:59] [INFO ] Deduced a trap composed of 545 places in 2083 ms of which 16 ms to minimize.
[2024-05-24 23:13:01] [INFO ] Deduced a trap composed of 535 places in 2115 ms of which 15 ms to minimize.
[2024-05-24 23:13:03] [INFO ] Deduced a trap composed of 563 places in 1590 ms of which 13 ms to minimize.
[2024-05-24 23:13:05] [INFO ] Deduced a trap composed of 596 places in 2079 ms of which 17 ms to minimize.
[2024-05-24 23:13:06] [INFO ] Deduced a trap composed of 604 places in 1591 ms of which 13 ms to minimize.
[2024-05-24 23:13:08] [INFO ] Deduced a trap composed of 625 places in 1521 ms of which 13 ms to minimize.
[2024-05-24 23:13:09] [INFO ] Deduced a trap composed of 521 places in 1537 ms of which 13 ms to minimize.
[2024-05-24 23:13:11] [INFO ] Deduced a trap composed of 539 places in 1579 ms of which 12 ms to minimize.
[2024-05-24 23:13:13] [INFO ] Deduced a trap composed of 633 places in 1598 ms of which 12 ms to minimize.
[2024-05-24 23:13:14] [INFO ] Deduced a trap composed of 558 places in 1511 ms of which 12 ms to minimize.
[2024-05-24 23:13:16] [INFO ] Deduced a trap composed of 588 places in 1515 ms of which 12 ms to minimize.
[2024-05-24 23:13:18] [INFO ] Deduced a trap composed of 500 places in 1947 ms of which 16 ms to minimize.
[2024-05-24 23:13:20] [INFO ] Deduced a trap composed of 498 places in 2136 ms of which 16 ms to minimize.
[2024-05-24 23:13:22] [INFO ] Deduced a trap composed of 506 places in 2029 ms of which 17 ms to minimize.
[2024-05-24 23:13:24] [INFO ] Deduced a trap composed of 506 places in 1613 ms of which 13 ms to minimize.
[2024-05-24 23:13:26] [INFO ] Deduced a trap composed of 555 places in 2002 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2948 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 23:13:28] [INFO ] Deduced a trap composed of 564 places in 1979 ms of which 16 ms to minimize.
[2024-05-24 23:13:30] [INFO ] Deduced a trap composed of 506 places in 2132 ms of which 17 ms to minimize.
[2024-05-24 23:13:33] [INFO ] Deduced a trap composed of 616 places in 2156 ms of which 17 ms to minimize.
[2024-05-24 23:13:34] [INFO ] Deduced a trap composed of 565 places in 1632 ms of which 12 ms to minimize.
SMT process timed out in 86645ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 4188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4188/4188 places, 9637/9637 transitions.
Applied a total of 0 rules in 574 ms. Remains 4188 /4188 variables (removed 0) and now considering 9637/9637 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 574 ms. Remains : 4188/4188 places, 9637/9637 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4188/4188 places, 9637/9637 transitions.
Applied a total of 0 rules in 567 ms. Remains 4188 /4188 variables (removed 0) and now considering 9637/9637 (removed 0) transitions.
[2024-05-24 23:13:35] [INFO ] Flow matrix only has 8765 transitions (discarded 872 similar events)
[2024-05-24 23:13:35] [INFO ] Invariant cache hit.
[2024-05-24 23:13:47] [INFO ] Implicit Places using invariants in 11897 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 215, 233, 249, 263, 275, 285, 293, 300, 304, 306, 319, 325, 327, 328, 329, 331, 332, 334, 340, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 491, 509, 525, 539, 551, 561, 569, 575, 582, 584, 586, 599, 605, 607, 608, 609, 610, 611, 612, 614, 616, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 763, 777, 789, 799, 807, 813, 817, 820, 822, 824, 837, 843, 845, 846, 847, 848, 849, 850, 852, 854, 857, 861, 867, 875, 885, 897, 911, 927, 944, 960, 961, 962, 963, 964, 965, 979, 991, 1001, 1009, 1016, 1020, 1022, 1024, 1026, 1028, 1041, 1048, 1050, 1051, 1052, 1053, 1054, 1055, 1057, 1059, 1061, 1063, 1067, 1073, 1081, 1091, 1103, 1117, 1132, 1146, 1147, 1148, 1149, 1150, 1151, 1163, 1173, 1181, 1187, 1192, 1194, 1196, 1198, 1200, 1202, 1215, 1221, 1223, 1224, 1225, 1226, 1227, 1228, 1230, 1232, 1234, 1236, 1238, 1242, 1248, 1256, 1266, 1278, 1291, 1303, 1304, 1305, 1306, 1307, 1308, 1318, 1326, 1332, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1361, 1367, 1369, 1370, 1371, 1372, 1373, 1374, 1376, 1378, 1380, 1382, 1384, 1386, 1390, 1396, 1404, 1414, 1425, 1435, 1436, 1437, 1438, 1439, 1440, 1448, 1454, 1458, 1460, 1462, 1464, 1466, 1468, 1470, 1472, 1485, 1491, 1493, 1494, 1495, 1496, 1497, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1516, 1522, 1530, 1539, 1548, 1550, 1551, 1552, 1553, 1559, 1563, 1565, 1569, 1571, 1573, 1575, 1577, 1579, 1581, 1594, 1600, 1602, 1603, 1604, 1605, 1606, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1627, 1633, 1640, 1646, 1647, 1648, 1649, 1650, 1651, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1686, 1692, 1694, 1695, 1696, 1697, 1698, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1721, 1726, 1730, 1731, 1732, 1733, 1734, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1768, 1774, 1776, 1777, 1778, 1779, 1780, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1799, 1801, 1804, 1807, 1808, 1809, 1810, 1811, 1812, 1814, 1816, 1818, 1820, 1822, 1824, 1826, 1828, 1830, 1832, 1845, 1851, 1853, 1854, 1855, 1856, 1857, 1858, 1860, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1884, 1885, 1886, 1887, 1888, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1921, 1923, 1926, 1928, 1929, 1930, 1931, 1932, 1933, 1935, 1937, 1939, 1941, 1943, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1964, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1995, 2001, 2003, 2004, 2005, 2006, 2007, 2008, 2010, 2012, 2014, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2033, 2034, 2035, 2036, 2037, 2039, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2070, 2076, 2078, 2079, 2080, 2081, 2082, 2083, 2085, 2087, 2089, 2091, 2093, 2095, 2098, 2100, 2102, 2104, 2106, 2109, 2110, 2111, 2112, 2113, 2114, 2116, 2118, 2120, 2122, 2124, 2126, 2128, 2130, 2132, 2134, 2147, 2153, 2155, 2156, 2157, 2158, 2159, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2178, 2180, 2184, 2189, 2190, 2192, 2193, 2194, 2198, 2200, 2202, 2204, 2206, 2209, 2211, 2213, 2215, 2217, 2231, 2237, 2239, 2240, 2241, 2242, 2243, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2260, 2262, 2266, 2272, 2279, 2280, 2281, 2282, 2283, 2284, 2290, 2294, 2296, 2298, 2300, 2302, 2304, 2306, 2308, 2310, 2323, 2329, 2331, 2332, 2333, 2334, 2335, 2336, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2356, 2362, 2370, 2379, 2380, 2381, 2382, 2383, 2384, 2392, 2398, 2402, 2404, 2406, 2408, 2410, 2412, 2414, 2416, 2429, 2435, 2437, 2438, 2440, 2441, 2442, 2444, 2447, 2449, 2451, 2453, 2455, 2457, 2461, 2467, 2475, 2485, 2496, 2497, 2498, 2499, 2500, 2501, 2511, 2519, 2525, 2529, 2531, 2533, 2535, 2537, 2539, 2541, 2555, 2561, 2563, 2564, 2565, 2566, 2567, 2568, 2570, 2572, 2574, 2576, 2578, 2580, 2584, 2590, 2598, 2608, 2620, 2633, 2634, 2635, 2636, 2638, 2650, 2660, 2668, 2674, 2678, 2680, 2682, 2684, 2686, 2689, 2703, 2709, 2711, 2712, 2713, 2714, 2715, 2716, 2718, 2720, 2722, 2724, 2726, 2730, 2736, 2744, 2754, 2766, 2780, 2795, 2796, 2797, 2798, 2799, 2800, 2814, 2826, 2836, 2844, 2850, 2854, 2856, 2858, 2860, 2862, 2875, 2882, 2884, 2885, 2886, 2887, 2888, 2889, 2891, 2893, 2895, 2898, 2902, 2908, 2916, 2926, 2938, 2952, 2968, 2985, 2986, 2987, 2988, 2989, 2990, 3006, 3020, 3032, 3042, 3050, 3056, 3060, 3062, 3064, 3066, 3079, 3085, 3087, 3088, 3089, 3090, 3091, 3092, 3094, 3096, 3098, 3103, 3109, 3117, 3127, 3139, 3153, 3169, 3187, 3206, 3207, 3208, 3209, 3210, 3211, 3229, 3245, 3259, 3271, 3281, 3289, 3295, 3299, 3302, 3304, 3317, 3323, 3325, 3326, 3327, 3328, 3329, 3330, 3332, 3334, 3338, 3345, 3353, 3363, 3375, 3389, 3405, 3423, 3443, 3464, 3465, 3466, 3467, 3468, 3469, 3489, 3507, 3523, 3537, 3549, 3559, 3567, 3573, 3578, 3580, 3593, 3595, 3598, 3600, 3601, 3603, 3604, 3605, 3607, 3612, 3618, 3627, 3637, 3649, 3663, 3679, 3697, 3717, 3739, 3762, 3763, 3764, 3765, 3766, 3767, 3789, 3809, 3827, 3843, 3857, 3869, 3879, 3887, 3894, 3898, 3912]
[2024-05-24 23:13:47] [INFO ] Actually due to overlaps returned [319, 599, 1041, 1215, 1361, 1485, 1686, 1768, 1845, 1921, 1995, 837, 1594, 2147, 2231, 2323, 2429, 2703, 2875, 3079, 3317, 3593, 3912, 2070, 2555, 4, 9, 10, 11, 12, 13, 190, 191, 192, 193, 194, 327, 328, 329, 331, 486, 487, 488, 489, 607, 608, 609, 610, 611, 742, 743, 744, 745, 746, 845, 846, 847, 848, 849, 960, 961, 962, 963, 964, 1050, 1051, 1052, 1053, 1054, 1146, 1147, 1148, 1149, 1150, 1223, 1224, 1225, 1226, 1227, 1303, 1304, 1305, 1306, 1307, 1369, 1370, 1371, 1372, 1373, 1435, 1436, 1437, 1438, 1439, 1493, 1494, 1495, 1496, 1497, 1548, 1550, 1551, 1552, 1602, 1603, 1604, 1605, 1606, 1646, 1647, 1648, 1649, 1650, 1694, 1695, 1696, 1697, 1698, 1730, 1731, 1732, 1733, 1734, 1776, 1777, 1778, 1779, 1780, 1807, 1808, 1809, 1810, 1811, 1853, 1854, 1855, 1856, 1857, 1883, 1884, 1885, 1886, 1887, 1923, 1928, 1929, 1930, 1931, 1932, 1957, 1958, 1959, 1960, 1961, 2003, 2004, 2005, 2006, 2007, 2032, 2033, 2034, 2035, 2036, 2078, 2079, 2080, 2081, 2082, 2109, 2110, 2111, 2112, 2113, 2155, 2156, 2157, 2158, 2159, 2189, 2190, 2192, 2193, 2239, 2240, 2241, 2242, 2243, 2279, 2280, 2281, 2282, 2283, 2331, 2332, 2333, 2334, 2335, 2379, 2380, 2381, 2382, 2383, 2437, 2438, 2440, 2441, 2496, 2497, 2498, 2499, 2500, 2563, 2564, 2565, 2566, 2567, 2633, 2634, 2635, 2636, 2711, 2712, 2713, 2714, 2715, 2795, 2796, 2797, 2798, 2799, 2884, 2885, 2886, 2887, 2888, 2985, 2986, 2987, 2988, 2989, 3087, 3088, 3089, 3090, 3091, 3206, 3207, 3208, 3209, 3210, 3325, 3326, 3327, 3328, 3329, 3464, 3465, 3466, 3467, 3468, 3595, 3600, 3601, 3603, 3604, 3762, 3763, 3764, 3765, 3766]
Discarding 271 places :
Implicit Place search using SMT only with invariants took 11927 ms to find 271 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3917/4188 places, 9637/9637 transitions.
Discarding 233 places :
Symmetric choice reduction at 0 with 233 rule applications. Total rules 233 place count 3684 transition count 9404
Iterating global reduction 0 with 233 rules applied. Total rules applied 466 place count 3684 transition count 9404
Discarding 232 places :
Symmetric choice reduction at 0 with 232 rule applications. Total rules 698 place count 3452 transition count 9172
Iterating global reduction 0 with 232 rules applied. Total rules applied 930 place count 3452 transition count 9172
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 933 place count 3452 transition count 9169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 936 place count 3449 transition count 9169
Applied a total of 936 rules in 1583 ms. Remains 3449 /3917 variables (removed 468) and now considering 9169/9637 (removed 468) transitions.
[2024-05-24 23:13:49] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
// Phase 1: matrix 8297 rows 3449 cols
[2024-05-24 23:13:49] [INFO ] Computed 666 invariants in 166 ms
[2024-05-24 23:13:57] [INFO ] Implicit Places using invariants in 7913 ms returned [6, 8, 12, 18, 27, 37, 49, 63, 79, 97, 117, 139, 162, 184, 204, 222, 238, 252, 264, 274, 282, 289, 293, 295, 312, 315, 317, 323, 330, 338, 348, 360, 374, 390, 408, 428, 449, 470, 488, 504, 518, 530, 540, 548, 554, 561, 563, 565, 575, 577, 579, 581, 586, 592, 600, 610, 622, 636, 652, 670, 689, 707, 723, 737, 749, 759, 767, 773, 777, 780, 782, 784, 792, 794, 796, 798, 801, 805, 811, 819, 829, 841, 855, 871, 888, 904, 918, 930, 940, 948, 955, 959, 961, 963, 965, 967, 976, 978, 980, 982, 984, 986, 990, 996, 1004, 1014, 1026, 1040, 1055, 1069, 1081, 1091, 1099, 1105, 1110, 1112, 1114, 1116, 1118, 1120, 1128, 1130, 1132, 1134, 1136, 1138, 1140, 1144, 1150, 1158, 1168, 1180, 1193, 1205, 1215, 1223, 1229, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1253, 1255, 1257, 1259, 1261, 1263, 1265, 1267, 1271, 1277, 1285, 1295, 1306, 1316, 1324, 1330, 1334, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1357, 1359, 1361, 1363, 1365, 1367, 1369, 1371, 1373, 1377, 1383, 1391, 1400, 1410, 1416, 1420, 1422, 1426, 1428, 1430, 1432, 1434, 1436, 1438, 1447, 1449, 1451, 1453, 1455, 1457, 1459, 1461, 1463, 1465, 1469, 1475, 1482, 1488, 1492, 1494, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1518, 1520, 1522, 1524, 1526, 1528, 1530, 1532, 1534, 1536, 1538, 1542, 1547, 1551, 1553, 1555, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1579, 1581, 1583, 1585, 1587, 1589, 1591, 1593, 1595, 1597, 1599, 1601, 1604, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1627, 1635, 1637, 1639, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1706, 1708, 1710, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1763, 1765, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1812, 1814, 1816, 1818, 1820, 1823, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1851, 1853, 1855, 1857, 1859, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1877, 1883, 1887, 1889, 1891, 1893, 1895, 1898, 1900, 1902, 1904, 1906, 1916, 1918, 1920, 1922, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1940, 1946, 1953, 1959, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1987, 1989, 1991, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2009, 2015, 2023, 2032, 2040, 2046, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2072, 2075, 2077, 2080, 2082, 2084, 2086, 2088, 2090, 2094, 2100, 2108, 2118, 2129, 2139, 2147, 2153, 2157, 2159, 2161, 2163, 2165, 2167, 2169, 2179, 2181, 2183, 2185, 2187, 2189, 2191, 2193, 2197, 2203, 2211, 2221, 2233, 2247, 2259, 2269, 2277, 2283, 2287, 2289, 2291, 2293, 2295, 2298, 2308, 2310, 2312, 2314, 2316, 2318, 2320, 2324, 2330, 2338, 2348, 2360, 2374, 2389, 2403, 2415, 2425, 2433, 2439, 2443, 2445, 2447, 2449, 2451, 2460, 2462, 2464, 2466, 2468, 2471, 2475, 2481, 2489, 2499, 2511, 2525, 2541, 2558, 2574, 2588, 2600, 2610, 2618, 2624, 2628, 2630, 2632, 2634, 2642, 2644, 2646, 2648, 2650, 2655, 2661, 2669, 2679, 2691, 2705, 2721, 2739, 2758, 2776, 2792, 2806, 2818, 2828, 2836, 2842, 2846, 2849, 2851, 2859, 2861, 2863, 2865, 2869, 2876, 2884, 2894, 2906, 2920, 2936, 2954, 2974, 2995, 3015, 3033, 3049, 3063, 3075, 3085, 3093, 3099, 3104, 3106, 3112, 3115, 3117, 3122, 3128, 3137, 3147, 3159, 3173, 3189, 3207, 3227, 3249, 3272, 3294, 3314, 3332, 3348, 3362, 3374, 3384, 3392, 3399, 3403]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 7949 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2849/4188 places, 9169/9637 transitions.
Applied a total of 0 rules in 497 ms. Remains 2849 /2849 variables (removed 0) and now considering 9169/9169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 22525 ms. Remains : 2849/4188 places, 9169/9637 transitions.
RANDOM walk for 40000 steps (1354 resets) in 1344 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (90 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (104 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (124 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 24848 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 3
Probabilistic random walk after 24848 steps, saw 10560 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 23:14:01] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
// Phase 1: matrix 8297 rows 2849 cols
[2024-05-24 23:14:01] [INFO ] Computed 66 invariants in 143 ms
[2024-05-24 23:14:01] [INFO ] State equation strengthened by 4958 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2731/2776 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2776 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/2781 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2781 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 38/2819 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2819 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/2845 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2845 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/2849 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2849 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8297/11146 variables, 2849/2915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11146 variables, 4958/7873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11146 variables, 0/7873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/11146 variables, 0/7873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11146/11146 variables, and 7873 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11382 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 2849/2849 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2731/2776 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 23:14:15] [INFO ] Deduced a trap composed of 241 places in 2160 ms of which 18 ms to minimize.
[2024-05-24 23:14:17] [INFO ] Deduced a trap composed of 137 places in 2018 ms of which 18 ms to minimize.
[2024-05-24 23:14:19] [INFO ] Deduced a trap composed of 122 places in 2096 ms of which 19 ms to minimize.
[2024-05-24 23:14:22] [INFO ] Deduced a trap composed of 111 places in 2032 ms of which 18 ms to minimize.
[2024-05-24 23:14:24] [INFO ] Deduced a trap composed of 399 places in 2120 ms of which 18 ms to minimize.
[2024-05-24 23:14:26] [INFO ] Deduced a trap composed of 104 places in 2106 ms of which 18 ms to minimize.
[2024-05-24 23:14:28] [INFO ] Deduced a trap composed of 133 places in 2115 ms of which 19 ms to minimize.
[2024-05-24 23:14:30] [INFO ] Deduced a trap composed of 123 places in 1965 ms of which 18 ms to minimize.
[2024-05-24 23:14:32] [INFO ] Deduced a trap composed of 132 places in 2102 ms of which 18 ms to minimize.
[2024-05-24 23:14:34] [INFO ] Deduced a trap composed of 122 places in 2114 ms of which 18 ms to minimize.
[2024-05-24 23:14:36] [INFO ] Deduced a trap composed of 1010 places in 1999 ms of which 18 ms to minimize.
[2024-05-24 23:14:39] [INFO ] Deduced a trap composed of 125 places in 2151 ms of which 19 ms to minimize.
[2024-05-24 23:14:41] [INFO ] Deduced a trap composed of 126 places in 2060 ms of which 18 ms to minimize.
[2024-05-24 23:14:43] [INFO ] Deduced a trap composed of 110 places in 2033 ms of which 17 ms to minimize.
[2024-05-24 23:14:45] [INFO ] Deduced a trap composed of 138 places in 2056 ms of which 18 ms to minimize.
[2024-05-24 23:14:47] [INFO ] Deduced a trap composed of 140 places in 2082 ms of which 19 ms to minimize.
[2024-05-24 23:14:49] [INFO ] Deduced a trap composed of 152 places in 2069 ms of which 19 ms to minimize.
[2024-05-24 23:14:51] [INFO ] Deduced a trap composed of 156 places in 2119 ms of which 18 ms to minimize.
[2024-05-24 23:14:53] [INFO ] Deduced a trap composed of 133 places in 2141 ms of which 19 ms to minimize.
[2024-05-24 23:14:55] [INFO ] Deduced a trap composed of 173 places in 2103 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2776 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 23:14:58] [INFO ] Deduced a trap composed of 146 places in 2152 ms of which 19 ms to minimize.
[2024-05-24 23:15:00] [INFO ] Deduced a trap composed of 127 places in 2150 ms of which 19 ms to minimize.
[2024-05-24 23:15:02] [INFO ] Deduced a trap composed of 130 places in 2164 ms of which 20 ms to minimize.
[2024-05-24 23:15:04] [INFO ] Deduced a trap composed of 140 places in 2094 ms of which 19 ms to minimize.
[2024-05-24 23:15:06] [INFO ] Deduced a trap composed of 127 places in 2146 ms of which 19 ms to minimize.
[2024-05-24 23:15:09] [INFO ] Deduced a trap composed of 123 places in 2161 ms of which 19 ms to minimize.
[2024-05-24 23:15:11] [INFO ] Deduced a trap composed of 131 places in 2132 ms of which 18 ms to minimize.
[2024-05-24 23:15:13] [INFO ] Deduced a trap composed of 168 places in 2076 ms of which 18 ms to minimize.
[2024-05-24 23:15:15] [INFO ] Deduced a trap composed of 132 places in 2105 ms of which 17 ms to minimize.
[2024-05-24 23:15:17] [INFO ] Deduced a trap composed of 141 places in 2004 ms of which 18 ms to minimize.
[2024-05-24 23:15:19] [INFO ] Deduced a trap composed of 115 places in 2046 ms of which 19 ms to minimize.
[2024-05-24 23:15:21] [INFO ] Deduced a trap composed of 143 places in 1957 ms of which 19 ms to minimize.
[2024-05-24 23:15:23] [INFO ] Deduced a trap composed of 203 places in 2039 ms of which 18 ms to minimize.
[2024-05-24 23:15:25] [INFO ] Deduced a trap composed of 1057 places in 1902 ms of which 19 ms to minimize.
[2024-05-24 23:15:27] [INFO ] Deduced a trap composed of 140 places in 2063 ms of which 18 ms to minimize.
[2024-05-24 23:15:30] [INFO ] Deduced a trap composed of 147 places in 2010 ms of which 18 ms to minimize.
[2024-05-24 23:15:32] [INFO ] Deduced a trap composed of 151 places in 2033 ms of which 18 ms to minimize.
[2024-05-24 23:15:34] [INFO ] Deduced a trap composed of 150 places in 2032 ms of which 19 ms to minimize.
[2024-05-24 23:15:36] [INFO ] Deduced a trap composed of 1016 places in 1877 ms of which 18 ms to minimize.
[2024-05-24 23:15:38] [INFO ] Deduced a trap composed of 130 places in 2063 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2776 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 23:15:40] [INFO ] Deduced a trap composed of 162 places in 2082 ms of which 19 ms to minimize.
[2024-05-24 23:15:42] [INFO ] Deduced a trap composed of 198 places in 2055 ms of which 19 ms to minimize.
[2024-05-24 23:15:44] [INFO ] Deduced a trap composed of 147 places in 2134 ms of which 19 ms to minimize.
SMT process timed out in 103232ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 2849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 9169/9169 transitions.
Applied a total of 0 rules in 467 ms. Remains 2849 /2849 variables (removed 0) and now considering 9169/9169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 2849/2849 places, 9169/9169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 9169/9169 transitions.
Applied a total of 0 rules in 471 ms. Remains 2849 /2849 variables (removed 0) and now considering 9169/9169 (removed 0) transitions.
[2024-05-24 23:15:45] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
[2024-05-24 23:15:45] [INFO ] Invariant cache hit.
[2024-05-24 23:15:50] [INFO ] Implicit Places using invariants in 4434 ms returned []
[2024-05-24 23:15:50] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
[2024-05-24 23:15:50] [INFO ] Invariant cache hit.
[2024-05-24 23:15:52] [INFO ] State equation strengthened by 4958 read => feed constraints.
[2024-05-24 23:16:23] [INFO ] Performed 336/2849 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:16:53] [INFO ] Performed 880/2849 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:17:23] [INFO ] Performed 1241/2849 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:17:53] [INFO ] Performed 1381/2849 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-24 23:17:53] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-24 23:17:53] [INFO ] Implicit Places using invariants and state equation in 123434 ms returned []
Implicit Place search using SMT with State Equation took 127875 ms to find 0 implicit places.
[2024-05-24 23:17:54] [INFO ] Redundant transitions in 1181 ms returned []
Running 9075 sub problems to find dead transitions.
[2024-05-24 23:17:54] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
[2024-05-24 23:17:54] [INFO ] Invariant cache hit.
[2024-05-24 23:17:55] [INFO ] State equation strengthened by 4958 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2847 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9075 unsolved
SMT process timed out in 84168ms, After SMT, problems are : Problem set: 0 solved, 9075 unsolved
Search for dead transitions found 0 dead transitions in 84298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213885 ms. Remains : 2849/2849 places, 9169/9169 transitions.
[2024-05-24 23:19:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-24 23:19:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2849 places, 9169 transitions and 44788 arcs took 43 ms.
[2024-05-24 23:19:19] [INFO ] Flatten gal took : 515 ms
Total runtime 513649 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S24C05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2849
TRANSITIONS: 9169
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.209s, Sys 0.031s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.026s, Sys 0.007s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 918
MODEL NAME: /home/mcc/execution/413/model
2849 places, 9169 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-S24C05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C05, 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 r245-tall-171654349100087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C05.tgz
mv MultiCrashLeafsetExtension-PT-S24C05 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 ;