About the Execution of LTSMin+red for PaceMaker-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 533.428 | 166349.00 | 276970.00 | 398.70 | FFF??TFT?F?FTFTF | 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.r512-smll-171654406700006.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PaceMaker-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406700006
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 158K 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 PaceMaker-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717242319104
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PaceMaker-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:45:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:45:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:45:21] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-06-01 11:45:21] [INFO ] Transformed 70 places.
[2024-06-01 11:45:21] [INFO ] Transformed 164 transitions.
[2024-06-01 11:45:21] [INFO ] Parsed PT model containing 70 places and 164 transitions and 954 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2592 ms. (15 steps per ms) remains 15/16 properties
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 90047 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 15
Probabilistic random walk after 90047 steps, saw 70565 distinct states, run finished after 3014 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 11:45:25] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2024-06-01 11:45:25] [INFO ] Computed 35 invariants in 8 ms
[2024-06-01 11:45:25] [INFO ] State equation strengthened by 131 read => feed constraints.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 35/35 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/35 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 158/228 variables, 70/105 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 131/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/228 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 236 constraints, problems are : Problem set: 4 solved, 11 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 70/70 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 32/32 constraints. Problems are: Problem set: 4 solved, 11 unsolved
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 52 ms of which 12 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 2 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 3 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 61 ms of which 2 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 14/46 constraints. Problems are: Problem set: 7 solved, 8 unsolved
[2024-06-01 11:45:27] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/47 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/70 variables, 3/50 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 7 unsolved
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 158/228 variables, 70/120 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 131/251 constraints. Problems are: Problem set: 9 solved, 6 unsolved
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 6/257 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/257 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/257 constraints. Problems are: Problem set: 10 solved, 5 unsolved
No progress, stopping.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 228/228 variables, and 257 constraints, problems are : Problem set: 10 solved, 5 unsolved in 3722 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 70/70 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 6/15 constraints, Known Traps: 15/15 constraints]
After SMT, in 5030ms problems are : Problem set: 10 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 51425 ms.
Support contains 43 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 68 transition count 163
Applied a total of 3 rules in 38 ms. Remains 68 /70 variables (removed 2) and now considering 163/164 (removed 1) transitions.
Running 152 sub problems to find dead transitions.
[2024-06-01 11:46:22] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
Normalized transition count is 92 out of 157 initially.
// Phase 1: matrix 92 rows 68 cols
[2024-06-01 11:46:22] [INFO ] Computed 34 invariants in 8 ms
[2024-06-01 11:46:22] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 233 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4839 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 385 constraints, problems are : Problem set: 0 solved, 152 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 25037ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 25043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25106 ms. Remains : 68/70 places, 163/164 transitions.
RANDOM walk for 40000 steps (8 resets) in 564 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 171944 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 171944 steps, saw 131453 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 11:46:50] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-06-01 11:46:50] [INFO ] Invariant cache hit.
[2024-06-01 11:46:50] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 13/56 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 133/189 variables, 56/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 89/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/213 variables, 8/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 34/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/216 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/225 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 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/43 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 13/56 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 133/189 variables, 56/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 89/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 24/213 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 34/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 11:46:52] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:46:52] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/216 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 9/225 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/225 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/225 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 11:46:52] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/225 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/225 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/225 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 250 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 2502ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 43 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 163/163 transitions.
Applied a total of 0 rules in 26 ms. Remains 68 /68 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 68/68 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 163/163 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-01 11:47:23] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-06-01 11:47:23] [INFO ] Invariant cache hit.
[2024-06-01 11:47:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 11:47:23] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-06-01 11:47:23] [INFO ] Invariant cache hit.
[2024-06-01 11:47:23] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 11:47:23] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-01 11:47:23] [INFO ] Redundant transitions in 10 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 11:47:23] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-06-01 11:47:23] [INFO ] Invariant cache hit.
[2024-06-01 11:47:23] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 233 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4493 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 385 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 34631ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 34635ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35003 ms. Remains : 68/68 places, 163/163 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 242 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 64 transition count 150
Applied a total of 5 rules in 28 ms. Remains 64 /68 variables (removed 4) and now considering 150/163 (removed 13) transitions.
Running SMT prover for 4 properties.
[2024-06-01 11:47:58] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
Normalized transition count is 88 out of 149 initially.
// Phase 1: matrix 88 rows 64 cols
[2024-06-01 11:47:58] [INFO ] Computed 32 invariants in 2 ms
[2024-06-01 11:47:58] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 11:47:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 18 ms returned sat
[2024-06-01 11:47:59] [INFO ] After 863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 11:47:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 11:48:00] [INFO ] After 960ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 11:48:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 11:48:00] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:48:00] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:48:00] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:48:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 120 ms
[2024-06-01 11:48:00] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:48:01] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:48:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-06-01 11:48:01] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 5 ms to minimize.
[2024-06-01 11:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-01 11:48:01] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
[2024-06-01 11:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 2
[2024-06-01 11:48:02] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 3
[2024-06-01 11:48:02] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 4
[2024-06-01 11:48:03] [INFO ] After 4051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 11:48:04] [INFO ] After 6442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 6554 ms.
[2024-06-01 11:48:04] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 11:48:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 163 transitions and 946 arcs took 7 ms.
[2024-06-01 11:48:05] [INFO ] Flatten gal took : 98 ms
Total runtime 164110 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PaceMaker-PT-none-ReachabilityCardinality-2024-03
Could not compute solution for formula : PaceMaker-PT-none-ReachabilityCardinality-2024-04
Could not compute solution for formula : PaceMaker-PT-none-ReachabilityCardinality-2024-08
Could not compute solution for formula : PaceMaker-PT-none-ReachabilityCardinality-2024-10
BK_STOP 1717242485453
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name PaceMaker-PT-none-ReachabilityCardinality-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/671/inv_0_
rfs formula name PaceMaker-PT-none-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/671/inv_1_
rfs formula name PaceMaker-PT-none-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/671/inv_2_
rfs formula name PaceMaker-PT-none-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/671/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PaceMaker-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PaceMaker-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654406700006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PaceMaker-PT-none.tgz
mv PaceMaker-PT-none execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;