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.r267-smll-171654406000231.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 Peterson-COL-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Apr 12 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 45K 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 Peterson-COL-5-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-COL-5-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716738516360

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 15:48:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 15:48:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 15:48:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 15:48:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 15:48:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1346 ms
[2024-05-26 15:48:40] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-5-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 15:48:40] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-26 15:48:40] [INFO ] Skeletonized 14 HLPN properties in 0 ms.
All 14 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 15:48:40] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 135 ms.
[2024-05-26 15:48:40] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Deduced a syphon composed of 30 places in 28 ms
Reduce places removed 30 places and 60 transitions.
RANDOM walk for 40000 steps (8 resets) in 2757 ms. (14 steps per ms) remains 6/14 properties
FORMULA Peterson-COL-5-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4009 ms. (9 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2981 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1828 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1307 ms. (30 steps per ms) remains 6/6 properties
[2024-05-26 15:48:45] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:48:45] [INFO ] Computed 23 invariants in 45 ms
[2024-05-26 15:48:45] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/834 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/834 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1122/1956 variables, 834/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1956 variables, 205/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1062 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4387 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/834 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 15:48:55] [INFO ] Deduced a trap composed of 174 places in 991 ms of which 121 ms to minimize.
[2024-05-26 15:48:56] [INFO ] Deduced a trap composed of 131 places in 979 ms of which 14 ms to minimize.
[2024-05-26 15:48:56] [INFO ] Deduced a trap composed of 45 places in 679 ms of which 11 ms to minimize.
[2024-05-26 15:48:57] [INFO ] Deduced a trap composed of 62 places in 787 ms of which 12 ms to minimize.
[2024-05-26 15:48:58] [INFO ] Deduced a trap composed of 18 places in 860 ms of which 10 ms to minimize.
SMT process timed out in 13591ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 70 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 834/834 places, 1242/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 1331 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4530 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1314 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1715 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1029 ms. (38 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 273770 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :2 out of 6
Probabilistic random walk after 273770 steps, saw 136706 distinct states, run finished after 6009 ms. (steps per millisecond=45 ) properties seen :2
FORMULA Peterson-COL-5-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-26 15:49:07] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:49:07] [INFO ] Invariant cache hit.
[2024-05-26 15:49:07] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/654 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/654 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 180/834 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/834 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1956 variables, 834/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1956 variables, 205/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1062 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4278 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/654 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/654 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 180/834 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/834 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:49:16] [INFO ] Deduced a trap composed of 89 places in 713 ms of which 10 ms to minimize.
[2024-05-26 15:49:17] [INFO ] Deduced a trap composed of 11 places in 702 ms of which 7 ms to minimize.
[2024-05-26 15:49:18] [INFO ] Deduced a trap composed of 63 places in 598 ms of which 12 ms to minimize.
[2024-05-26 15:49:19] [INFO ] Deduced a trap composed of 95 places in 749 ms of which 10 ms to minimize.
[2024-05-26 15:49:19] [INFO ] Deduced a trap composed of 52 places in 577 ms of which 9 ms to minimize.
[2024-05-26 15:49:20] [INFO ] Deduced a trap composed of 67 places in 764 ms of which 10 ms to minimize.
[2024-05-26 15:49:21] [INFO ] Deduced a trap composed of 101 places in 795 ms of which 10 ms to minimize.
[2024-05-26 15:49:22] [INFO ] Deduced a trap composed of 77 places in 756 ms of which 11 ms to minimize.
[2024-05-26 15:49:23] [INFO ] Deduced a trap composed of 53 places in 776 ms of which 11 ms to minimize.
[2024-05-26 15:49:23] [INFO ] Deduced a trap composed of 51 places in 786 ms of which 11 ms to minimize.
[2024-05-26 15:49:24] [INFO ] Deduced a trap composed of 72 places in 726 ms of which 10 ms to minimize.
[2024-05-26 15:49:25] [INFO ] Deduced a trap composed of 49 places in 725 ms of which 10 ms to minimize.
[2024-05-26 15:49:26] [INFO ] Deduced a trap composed of 171 places in 545 ms of which 8 ms to minimize.
[2024-05-26 15:49:26] [INFO ] Deduced a trap composed of 180 places in 621 ms of which 9 ms to minimize.
[2024-05-26 15:49:27] [INFO ] Deduced a trap composed of 145 places in 721 ms of which 11 ms to minimize.
[2024-05-26 15:49:28] [INFO ] Deduced a trap composed of 37 places in 735 ms of which 10 ms to minimize.
[2024-05-26 15:49:29] [INFO ] Deduced a trap composed of 123 places in 684 ms of which 10 ms to minimize.
[2024-05-26 15:49:30] [INFO ] Deduced a trap composed of 63 places in 786 ms of which 12 ms to minimize.
[2024-05-26 15:49:31] [INFO ] Deduced a trap composed of 85 places in 1110 ms of which 9 ms to minimize.
[2024-05-26 15:49:32] [INFO ] Deduced a trap composed of 43 places in 829 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:49:33] [INFO ] Deduced a trap composed of 52 places in 879 ms of which 11 ms to minimize.
[2024-05-26 15:49:34] [INFO ] Deduced a trap composed of 141 places in 784 ms of which 10 ms to minimize.
[2024-05-26 15:49:34] [INFO ] Deduced a trap composed of 24 places in 779 ms of which 12 ms to minimize.
[2024-05-26 15:49:35] [INFO ] Deduced a trap composed of 39 places in 809 ms of which 15 ms to minimize.
[2024-05-26 15:49:36] [INFO ] Deduced a trap composed of 22 places in 785 ms of which 8 ms to minimize.
[2024-05-26 15:49:37] [INFO ] Deduced a trap composed of 89 places in 724 ms of which 10 ms to minimize.
[2024-05-26 15:49:38] [INFO ] Deduced a trap composed of 58 places in 763 ms of which 10 ms to minimize.
[2024-05-26 15:49:39] [INFO ] Deduced a trap composed of 155 places in 814 ms of which 10 ms to minimize.
[2024-05-26 15:49:40] [INFO ] Deduced a trap composed of 73 places in 778 ms of which 12 ms to minimize.
[2024-05-26 15:49:40] [INFO ] Deduced a trap composed of 171 places in 834 ms of which 11 ms to minimize.
[2024-05-26 15:49:41] [INFO ] Deduced a trap composed of 30 places in 819 ms of which 11 ms to minimize.
[2024-05-26 15:49:42] [INFO ] Deduced a trap composed of 58 places in 703 ms of which 6 ms to minimize.
[2024-05-26 15:49:43] [INFO ] Deduced a trap composed of 55 places in 637 ms of which 11 ms to minimize.
[2024-05-26 15:49:44] [INFO ] Deduced a trap composed of 11 places in 814 ms of which 10 ms to minimize.
[2024-05-26 15:49:44] [INFO ] Deduced a trap composed of 22 places in 638 ms of which 10 ms to minimize.
[2024-05-26 15:49:45] [INFO ] Deduced a trap composed of 26 places in 825 ms of which 11 ms to minimize.
[2024-05-26 15:49:46] [INFO ] Deduced a trap composed of 95 places in 709 ms of which 10 ms to minimize.
[2024-05-26 15:49:47] [INFO ] Deduced a trap composed of 168 places in 818 ms of which 10 ms to minimize.
[2024-05-26 15:49:48] [INFO ] Deduced a trap composed of 11 places in 780 ms of which 10 ms to minimize.
[2024-05-26 15:49:49] [INFO ] Deduced a trap composed of 87 places in 823 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:49:50] [INFO ] Deduced a trap composed of 46 places in 910 ms of which 10 ms to minimize.
[2024-05-26 15:49:51] [INFO ] Deduced a trap composed of 109 places in 825 ms of which 10 ms to minimize.
[2024-05-26 15:49:52] [INFO ] Deduced a trap composed of 41 places in 858 ms of which 11 ms to minimize.
[2024-05-26 15:49:53] [INFO ] Deduced a trap composed of 45 places in 847 ms of which 10 ms to minimize.
[2024-05-26 15:49:53] [INFO ] Deduced a trap composed of 32 places in 795 ms of which 11 ms to minimize.
[2024-05-26 15:49:54] [INFO ] Deduced a trap composed of 78 places in 679 ms of which 10 ms to minimize.
[2024-05-26 15:49:55] [INFO ] Deduced a trap composed of 146 places in 700 ms of which 12 ms to minimize.
[2024-05-26 15:49:56] [INFO ] Deduced a trap composed of 129 places in 697 ms of which 9 ms to minimize.
[2024-05-26 15:49:56] [INFO ] Deduced a trap composed of 162 places in 713 ms of which 10 ms to minimize.
[2024-05-26 15:49:57] [INFO ] Deduced a trap composed of 144 places in 601 ms of which 9 ms to minimize.
[2024-05-26 15:49:58] [INFO ] Deduced a trap composed of 127 places in 642 ms of which 8 ms to minimize.
[2024-05-26 15:49:59] [INFO ] Deduced a trap composed of 141 places in 622 ms of which 9 ms to minimize.
[2024-05-26 15:49:59] [INFO ] Deduced a trap composed of 63 places in 504 ms of which 8 ms to minimize.
SMT process timed out in 51993ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 654 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 101 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 834/834 places, 1242/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 930 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4184 ms. (9 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 834 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1926 ms. (20 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 240037 steps, run timeout after 6001 ms. (steps per millisecond=39 ) properties seen :0 out of 4
Probabilistic random walk after 240037 steps, saw 122770 distinct states, run finished after 6001 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-26 15:50:08] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:50:08] [INFO ] Invariant cache hit.
[2024-05-26 15:50:08] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/654 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/654 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 180/834 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/834 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1956 variables, 834/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1956 variables, 205/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1062 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4065 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/654 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/654 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 180/834 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/834 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:50:16] [INFO ] Deduced a trap composed of 89 places in 920 ms of which 11 ms to minimize.
[2024-05-26 15:50:17] [INFO ] Deduced a trap composed of 11 places in 910 ms of which 11 ms to minimize.
[2024-05-26 15:50:18] [INFO ] Deduced a trap composed of 63 places in 953 ms of which 10 ms to minimize.
[2024-05-26 15:50:19] [INFO ] Deduced a trap composed of 95 places in 802 ms of which 10 ms to minimize.
[2024-05-26 15:50:20] [INFO ] Deduced a trap composed of 52 places in 769 ms of which 10 ms to minimize.
[2024-05-26 15:50:20] [INFO ] Deduced a trap composed of 67 places in 651 ms of which 10 ms to minimize.
[2024-05-26 15:50:21] [INFO ] Deduced a trap composed of 101 places in 843 ms of which 11 ms to minimize.
[2024-05-26 15:50:22] [INFO ] Deduced a trap composed of 77 places in 776 ms of which 11 ms to minimize.
[2024-05-26 15:50:23] [INFO ] Deduced a trap composed of 53 places in 856 ms of which 11 ms to minimize.
[2024-05-26 15:50:24] [INFO ] Deduced a trap composed of 51 places in 790 ms of which 9 ms to minimize.
[2024-05-26 15:50:25] [INFO ] Deduced a trap composed of 72 places in 756 ms of which 10 ms to minimize.
[2024-05-26 15:50:25] [INFO ] Deduced a trap composed of 49 places in 652 ms of which 10 ms to minimize.
[2024-05-26 15:50:26] [INFO ] Deduced a trap composed of 171 places in 707 ms of which 10 ms to minimize.
[2024-05-26 15:50:27] [INFO ] Deduced a trap composed of 180 places in 689 ms of which 9 ms to minimize.
[2024-05-26 15:50:28] [INFO ] Deduced a trap composed of 145 places in 798 ms of which 11 ms to minimize.
[2024-05-26 15:50:28] [INFO ] Deduced a trap composed of 37 places in 763 ms of which 11 ms to minimize.
[2024-05-26 15:50:29] [INFO ] Deduced a trap composed of 123 places in 702 ms of which 10 ms to minimize.
[2024-05-26 15:50:30] [INFO ] Deduced a trap composed of 63 places in 714 ms of which 10 ms to minimize.
[2024-05-26 15:50:31] [INFO ] Deduced a trap composed of 85 places in 735 ms of which 10 ms to minimize.
[2024-05-26 15:50:32] [INFO ] Deduced a trap composed of 43 places in 738 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:50:33] [INFO ] Deduced a trap composed of 52 places in 580 ms of which 7 ms to minimize.
[2024-05-26 15:50:33] [INFO ] Deduced a trap composed of 141 places in 620 ms of which 10 ms to minimize.
[2024-05-26 15:50:34] [INFO ] Deduced a trap composed of 24 places in 699 ms of which 7 ms to minimize.
[2024-05-26 15:50:35] [INFO ] Deduced a trap composed of 39 places in 762 ms of which 10 ms to minimize.
[2024-05-26 15:50:36] [INFO ] Deduced a trap composed of 22 places in 756 ms of which 11 ms to minimize.
[2024-05-26 15:50:36] [INFO ] Deduced a trap composed of 89 places in 547 ms of which 9 ms to minimize.
[2024-05-26 15:50:37] [INFO ] Deduced a trap composed of 58 places in 808 ms of which 11 ms to minimize.
[2024-05-26 15:50:38] [INFO ] Deduced a trap composed of 155 places in 829 ms of which 11 ms to minimize.
[2024-05-26 15:50:39] [INFO ] Deduced a trap composed of 73 places in 873 ms of which 11 ms to minimize.
[2024-05-26 15:50:40] [INFO ] Deduced a trap composed of 171 places in 867 ms of which 11 ms to minimize.
[2024-05-26 15:50:41] [INFO ] Deduced a trap composed of 30 places in 797 ms of which 11 ms to minimize.
[2024-05-26 15:50:42] [INFO ] Deduced a trap composed of 58 places in 829 ms of which 11 ms to minimize.
[2024-05-26 15:50:42] [INFO ] Deduced a trap composed of 55 places in 835 ms of which 11 ms to minimize.
[2024-05-26 15:50:43] [INFO ] Deduced a trap composed of 11 places in 773 ms of which 11 ms to minimize.
[2024-05-26 15:50:44] [INFO ] Deduced a trap composed of 22 places in 799 ms of which 11 ms to minimize.
[2024-05-26 15:50:45] [INFO ] Deduced a trap composed of 26 places in 788 ms of which 11 ms to minimize.
[2024-05-26 15:50:46] [INFO ] Deduced a trap composed of 95 places in 725 ms of which 11 ms to minimize.
[2024-05-26 15:50:47] [INFO ] Deduced a trap composed of 168 places in 779 ms of which 10 ms to minimize.
[2024-05-26 15:50:47] [INFO ] Deduced a trap composed of 11 places in 633 ms of which 10 ms to minimize.
[2024-05-26 15:50:48] [INFO ] Deduced a trap composed of 87 places in 806 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:50:49] [INFO ] Deduced a trap composed of 46 places in 748 ms of which 11 ms to minimize.
[2024-05-26 15:50:50] [INFO ] Deduced a trap composed of 109 places in 709 ms of which 10 ms to minimize.
[2024-05-26 15:50:51] [INFO ] Deduced a trap composed of 41 places in 725 ms of which 14 ms to minimize.
[2024-05-26 15:50:52] [INFO ] Deduced a trap composed of 45 places in 793 ms of which 10 ms to minimize.
[2024-05-26 15:50:53] [INFO ] Deduced a trap composed of 32 places in 870 ms of which 10 ms to minimize.
[2024-05-26 15:50:53] [INFO ] Deduced a trap composed of 78 places in 725 ms of which 9 ms to minimize.
[2024-05-26 15:50:54] [INFO ] Deduced a trap composed of 146 places in 711 ms of which 11 ms to minimize.
[2024-05-26 15:50:55] [INFO ] Deduced a trap composed of 129 places in 685 ms of which 9 ms to minimize.
[2024-05-26 15:50:56] [INFO ] Deduced a trap composed of 162 places in 616 ms of which 9 ms to minimize.
[2024-05-26 15:50:56] [INFO ] Deduced a trap composed of 144 places in 499 ms of which 9 ms to minimize.
[2024-05-26 15:50:57] [INFO ] Deduced a trap composed of 127 places in 770 ms of which 10 ms to minimize.
[2024-05-26 15:50:58] [INFO ] Deduced a trap composed of 141 places in 673 ms of which 9 ms to minimize.
[2024-05-26 15:50:58] [INFO ] Deduced a trap composed of 63 places in 560 ms of which 9 ms to minimize.
[2024-05-26 15:50:59] [INFO ] Deduced a trap composed of 28 places in 719 ms of which 11 ms to minimize.
[2024-05-26 15:51:00] [INFO ] Deduced a trap composed of 37 places in 716 ms of which 11 ms to minimize.
[2024-05-26 15:51:01] [INFO ] Deduced a trap composed of 89 places in 662 ms of which 9 ms to minimize.
[2024-05-26 15:51:02] [INFO ] Deduced a trap composed of 115 places in 795 ms of which 10 ms to minimize.
[2024-05-26 15:51:03] [INFO ] Deduced a trap composed of 19 places in 684 ms of which 10 ms to minimize.
[2024-05-26 15:51:04] [INFO ] Deduced a trap composed of 48 places in 654 ms of which 9 ms to minimize.
[2024-05-26 15:51:05] [INFO ] Deduced a trap composed of 37 places in 619 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:51:06] [INFO ] Deduced a trap composed of 78 places in 761 ms of which 10 ms to minimize.
[2024-05-26 15:51:07] [INFO ] Deduced a trap composed of 70 places in 718 ms of which 10 ms to minimize.
[2024-05-26 15:51:08] [INFO ] Deduced a trap composed of 58 places in 671 ms of which 7 ms to minimize.
[2024-05-26 15:51:09] [INFO ] Deduced a trap composed of 128 places in 638 ms of which 10 ms to minimize.
[2024-05-26 15:51:09] [INFO ] Deduced a trap composed of 28 places in 627 ms of which 10 ms to minimize.
[2024-05-26 15:51:10] [INFO ] Deduced a trap composed of 34 places in 669 ms of which 9 ms to minimize.
[2024-05-26 15:51:11] [INFO ] Deduced a trap composed of 11 places in 654 ms of which 9 ms to minimize.
[2024-05-26 15:51:12] [INFO ] Deduced a trap composed of 11 places in 670 ms of which 10 ms to minimize.
[2024-05-26 15:51:13] [INFO ] Deduced a trap composed of 90 places in 851 ms of which 11 ms to minimize.
[2024-05-26 15:51:14] [INFO ] Deduced a trap composed of 73 places in 795 ms of which 11 ms to minimize.
[2024-05-26 15:51:15] [INFO ] Deduced a trap composed of 123 places in 566 ms of which 7 ms to minimize.
[2024-05-26 15:51:16] [INFO ] Deduced a trap composed of 51 places in 821 ms of which 11 ms to minimize.
[2024-05-26 15:51:16] [INFO ] Deduced a trap composed of 43 places in 830 ms of which 11 ms to minimize.
[2024-05-26 15:51:17] [INFO ] Deduced a trap composed of 123 places in 489 ms of which 9 ms to minimize.
[2024-05-26 15:51:18] [INFO ] Deduced a trap composed of 122 places in 574 ms of which 8 ms to minimize.
[2024-05-26 15:51:18] [INFO ] Deduced a trap composed of 110 places in 597 ms of which 9 ms to minimize.
[2024-05-26 15:51:19] [INFO ] Deduced a trap composed of 149 places in 557 ms of which 7 ms to minimize.
[2024-05-26 15:51:20] [INFO ] Deduced a trap composed of 99 places in 523 ms of which 8 ms to minimize.
[2024-05-26 15:51:20] [INFO ] Deduced a trap composed of 126 places in 529 ms of which 8 ms to minimize.
[2024-05-26 15:51:21] [INFO ] Deduced a trap composed of 99 places in 541 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 15:51:22] [INFO ] Deduced a trap composed of 45 places in 676 ms of which 9 ms to minimize.
[2024-05-26 15:51:23] [INFO ] Deduced a trap composed of 44 places in 593 ms of which 10 ms to minimize.
[2024-05-26 15:51:23] [INFO ] Deduced a trap composed of 98 places in 583 ms of which 8 ms to minimize.
[2024-05-26 15:51:24] [INFO ] Deduced a trap composed of 187 places in 571 ms of which 9 ms to minimize.
[2024-05-26 15:51:25] [INFO ] Deduced a trap composed of 29 places in 817 ms of which 11 ms to minimize.
[2024-05-26 15:51:26] [INFO ] Deduced a trap composed of 24 places in 760 ms of which 11 ms to minimize.
[2024-05-26 15:51:27] [INFO ] Deduced a trap composed of 84 places in 683 ms of which 10 ms to minimize.
[2024-05-26 15:51:27] [INFO ] Deduced a trap composed of 110 places in 666 ms of which 9 ms to minimize.
[2024-05-26 15:51:28] [INFO ] Deduced a trap composed of 143 places in 691 ms of which 9 ms to minimize.
[2024-05-26 15:51:29] [INFO ] Deduced a trap composed of 49 places in 740 ms of which 10 ms to minimize.
[2024-05-26 15:51:30] [INFO ] Deduced a trap composed of 56 places in 667 ms of which 9 ms to minimize.
SMT process timed out in 82172ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 654 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 76 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 51 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:51:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:51:30] [INFO ] Invariant cache hit.
[2024-05-26 15:51:30] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-26 15:51:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:51:30] [INFO ] Invariant cache hit.
[2024-05-26 15:51:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:51:31] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2024-05-26 15:51:31] [INFO ] Redundant transitions in 120 ms returned []
Running 1236 sub problems to find dead transitions.
[2024-05-26 15:51:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:51:31] [INFO ] Invariant cache hit.
[2024-05-26 15:51:31] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 15:52:02] [INFO ] Deduced a trap composed of 30 places in 670 ms of which 8 ms to minimize.
SMT process timed out in 30698ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32234 ms. Remains : 834/834 places, 1242/1242 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 834 transition count 1122
Applied a total of 120 rules in 40 ms. Remains 834 /834 variables (removed 0) and now considering 1122/1242 (removed 120) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:52:04] [INFO ] Computed 23 invariants in 17 ms
[2024-05-26 15:52:04] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2024-05-26 15:52:04] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 17 ms returned sat
[2024-05-26 15:52:05] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 15:52:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2024-05-26 15:52:05] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 17 ms returned sat
[2024-05-26 15:52:18] [INFO ] After 13236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-26 15:52:30] [INFO ] After 25093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-26 15:52:41] [INFO ] After 36570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 39087 ms.
[2024-05-26 15:52:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 64 ms.
[2024-05-26 15:52:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 32 ms.
[2024-05-26 15:52:42] [INFO ] Flatten gal took : 372 ms
Total runtime 243542 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-COL-5

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 834
TRANSITIONS: 1242
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.027s, Sys 0.004s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.003s]


----------------------------------------------------------------------
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: 1050
MODEL NAME: /home/mcc/execution/414/model
834 places, 1242 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.
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

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="Peterson-COL-5"
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 Peterson-COL-5, 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 r267-smll-171654406000231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 ;