Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398200409.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BugTracking-PT-q8m016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398200409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q8m016-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716298166041

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:29:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:29:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:29:29] [INFO ] Load time of PNML (sax parser for PT used): 1101 ms
[2024-05-21 13:29:29] [INFO ] Transformed 754 places.
[2024-05-21 13:29:29] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:29:29] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1352 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Deduced a syphon composed of 474 places in 136 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 95 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 13:29:29] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 13:29:29] [INFO ] Computed 8 invariants in 88 ms
[2024-05-21 13:29:30] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-21 13:29:30] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:29:30] [INFO ] Invariant cache hit.
[2024-05-21 13:29:31] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 13:29:34] [INFO ] Implicit Places using invariants and state equation in 3700 ms returned []
Implicit Place search using SMT with State Equation took 4839 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 13:29:34] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:29:34] [INFO ] Invariant cache hit.
[2024-05-21 13:29:34] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 13:30:44] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 22 ms to minimize.
[2024-05-21 13:30:44] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2024-05-21 13:30:44] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2024-05-21 13:30:53] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
Problem TDEAD784 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 1 solved, 3868 unsolved in 30138 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3868 unsolved
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 109003ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 109112ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3826/3904 transitions.
Reduce places removed 11 places and 334 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 266 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 261 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 259 transition count 3284
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 258 transition count 3252
Applied a total of 19 rules in 78 ms. Remains 258 /277 variables (removed 19) and now considering 3252/3826 (removed 574) transitions.
[2024-05-21 13:31:23] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
// Phase 1: matrix 3123 rows 258 cols
[2024-05-21 13:31:23] [INFO ] Computed 8 invariants in 20 ms
[2024-05-21 13:31:24] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-21 13:31:24] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
[2024-05-21 13:31:24] [INFO ] Invariant cache hit.
[2024-05-21 13:31:24] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 13:31:26] [INFO ] Implicit Places using invariants and state equation in 2059 ms returned []
Implicit Place search using SMT with State Equation took 2434 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 258/280 places, 3252/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116637 ms. Remains : 258/280 places, 3252/3904 transitions.
Support contains 26 out of 258 places after structural reductions.
[2024-05-21 13:31:26] [INFO ] Flatten gal took : 335 ms
[2024-05-21 13:31:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:31:27] [INFO ] Flatten gal took : 223 ms
[2024-05-21 13:31:27] [INFO ] Input system was already deterministic with 3252 transitions.
Support contains 17 out of 258 places (down from 26) after GAL structural reductions.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40013 steps (134 resets) in 1777 ms. (22 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (22 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (24 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (23 resets) in 266 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (28 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 230 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (24 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (28 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (22 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (22 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (26 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
[2024-05-21 13:31:28] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
[2024-05-21 13:31:28] [INFO ] Invariant cache hit.
[2024-05-21 13:31:28] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/135 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2939/3074 variables, 135/141 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3074 variables, 81/222 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3074 variables, 0/222 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 304/3378 variables, 120/342 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3378 variables, 1/343 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3378 variables, 170/513 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3378 variables, 0/513 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3379 variables, 1/514 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3379 variables, 1/515 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 0/515 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/3381 variables, 2/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3381 variables, 0/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/3381 variables, 0/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3381/3381 variables, and 517 constraints, problems are : Problem set: 6 solved, 6 unsolved in 2489 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 72/80 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1861/1941 variables, 80/83 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1941 variables, 7/90 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/90 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1326/3267 variables, 105/195 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3267 variables, 1/196 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3267 variables, 219/415 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3267 variables, 4/419 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3267 variables, 0/419 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 6/3273 variables, 3/422 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3273 variables, 2/424 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-05-21 13:31:33] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 2 ms to minimize.
[2024-05-21 13:31:33] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 2 ms to minimize.
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/3273 variables, 2/426 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3273 variables, 0/426 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 108/3381 variables, 71/497 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3381 variables, 1/498 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3381 variables, 25/523 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3381 variables, 2/525 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-21 13:31:34] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 3 ms to minimize.
[2024-05-21 13:31:35] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 2 ms to minimize.
[2024-05-21 13:31:35] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 2 ms to minimize.
Problem AtomicPropp14 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/3381 variables, 3/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3381 variables, 0/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/3381 variables, 0/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3381/3381 variables, and 528 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 5/5 constraints]
After SMT, in 7566ms problems are : Problem set: 8 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3390 ms.
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 3252/3252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 257 transition count 3227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 257 transition count 3227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 255 transition count 3232
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 3226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 249 transition count 3226
Applied a total of 18 rules in 270 ms. Remains 249 /258 variables (removed 9) and now considering 3226/3252 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 249/258 places, 3226/3252 transitions.
RANDOM walk for 40007 steps (8 resets) in 652 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 133315 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 4
Probabilistic random walk after 133315 steps, saw 50338 distinct states, run finished after 3005 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-21 13:31:43] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-05-21 13:31:43] [INFO ] Computed 8 invariants in 14 ms
[2024-05-21 13:31:43] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1833/1911 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1911 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1297/3208 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3208 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3208 variables, 222/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3208 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3210 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3210 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 131/3341 variables, 93/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3341 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3341 variables, 26/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1833/1911 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1911 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1297/3208 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3208 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3208 variables, 222/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3208 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 13:31:46] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 2 ms to minimize.
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/3208 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3208 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3210 variables, 1/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3210 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 131/3341 variables, 93/483 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 2/485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3341 variables, 26/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 3/514 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 13:31:47] [INFO ] Deduced a trap composed of 37 places in 470 ms of which 3 ms to minimize.
[2024-05-21 13:31:47] [INFO ] Deduced a trap composed of 36 places in 387 ms of which 2 ms to minimize.
[2024-05-21 13:31:48] [INFO ] Deduced a trap composed of 39 places in 505 ms of which 2 ms to minimize.
[2024-05-21 13:31:48] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 2 ms to minimize.
[2024-05-21 13:31:49] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2024-05-21 13:31:49] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3341 variables, 6/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3341 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 520 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 7169ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 4058 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 60 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 249/249 places, 3226/3226 transitions.
RANDOM walk for 40031 steps (8 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 133306 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 3
Probabilistic random walk after 133306 steps, saw 50331 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-21 13:31:58] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 13:31:58] [INFO ] Invariant cache hit.
[2024-05-21 13:31:58] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1006/1052 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2065/3117 variables, 49/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3117 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3117 variables, 212/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3117 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3119 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3119 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 220/3339 variables, 152/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 37/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3339 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3341 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1006/1052 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2065/3117 variables, 49/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3117 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3117 variables, 212/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3117 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3119 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3119 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 220/3339 variables, 152/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 37/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3339 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:32:01] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 2 ms to minimize.
[2024-05-21 13:32:01] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3339 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3339 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3341 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:32:02] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3341 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/3341 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 515 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 5093ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2881 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 49 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 249/249 places, 3226/3226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 93 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-05-21 13:32:06] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 13:32:06] [INFO ] Invariant cache hit.
[2024-05-21 13:32:06] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-21 13:32:06] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 13:32:06] [INFO ] Invariant cache hit.
[2024-05-21 13:32:07] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-05-21 13:32:08] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2024-05-21 13:32:08] [INFO ] Redundant transitions in 230 ms returned []
Running 3225 sub problems to find dead transitions.
[2024-05-21 13:32:08] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 13:32:08] [INFO ] Invariant cache hit.
[2024-05-21 13:32:08] [INFO ] State equation strengthened by 252 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m016

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 754
TRANSITIONS: 27370
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.856s, Sys 0.073s]


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


----------------------------------------------------------------------
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: 678
MODEL NAME: /home/mcc/execution/model
754 places, 27370 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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m016"
export BK_EXAMINATION="CTLCardinality"
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 BugTracking-PT-q8m016, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398200409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m016.tgz
mv BugTracking-PT-q8m016 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;