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-171620398200433.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-q8m128, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398200433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K 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 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 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-q8m128-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716300702268

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-q8m128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:11:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:11:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:11:45] [INFO ] Load time of PNML (sax parser for PT used): 1218 ms
[2024-05-21 14:11:45] [INFO ] Transformed 754 places.
[2024-05-21 14:11:45] [INFO ] Transformed 27370 transitions.
[2024-05-21 14:11:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1518 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 474 places in 117 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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
Applied a total of 2 rules in 79 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 14:11:46] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-05-21 14:11:46] [INFO ] Computed 8 invariants in 87 ms
[2024-05-21 14:11:47] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-05-21 14:11:47] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 14:11:47] [INFO ] Invariant cache hit.
[2024-05-21 14:11:47] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 14:11:50] [INFO ] Implicit Places using invariants and state equation in 2947 ms returned []
Implicit Place search using SMT with State Equation took 3935 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 14:11:50] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 14:11:50] [INFO ] Invariant cache hit.
[2024-05-21 14:11:50] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
[2024-05-21 14:12:52] [INFO ] Deduced a trap composed of 10 places in 452 ms of which 16 ms to minimize.
[2024-05-21 14:12:53] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 2 ms to minimize.
[2024-05-21 14:12:53] [INFO ] Deduced a trap composed of 14 places in 297 ms of which 1 ms to minimize.
[2024-05-21 14:12:54] [INFO ] Deduced a trap composed of 7 places in 1143 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/4007 variables, and 12 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 3902/2705 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
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 TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 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 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
Problem TDEAD3740 is UNSAT
Problem TDEAD3741 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3743 is UNSAT
Problem TDEAD3749 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3751 is UNSAT
Problem TDEAD3752 is UNSAT
Problem TDEAD3753 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3755 is UNSAT
Problem TDEAD3756 is UNSAT
Problem TDEAD3757 is UNSAT
Problem TDEAD3758 is UNSAT
Problem TDEAD3759 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3769 is UNSAT
Problem TDEAD3770 is UNSAT
Problem TDEAD3771 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3807 is UNSAT
Problem TDEAD3808 is UNSAT
Problem TDEAD3809 is UNSAT
Problem TDEAD3815 is UNSAT
Problem TDEAD3816 is UNSAT
Problem TDEAD3817 is UNSAT
Problem TDEAD3818 is UNSAT
Problem TDEAD3819 is UNSAT
Problem TDEAD3820 is UNSAT
Problem TDEAD3821 is UNSAT
Problem TDEAD3822 is UNSAT
Problem TDEAD3823 is UNSAT
Problem TDEAD3824 is UNSAT
Problem TDEAD3825 is UNSAT
Problem TDEAD3830 is UNSAT
Problem TDEAD3835 is UNSAT
Problem TDEAD3836 is UNSAT
Problem TDEAD3837 is UNSAT
Problem TDEAD3839 is UNSAT
Problem TDEAD3840 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3844 is UNSAT
Problem TDEAD3848 is UNSAT
Problem TDEAD3849 is UNSAT
Problem TDEAD3850 is UNSAT
Problem TDEAD3851 is UNSAT
Problem TDEAD3852 is UNSAT
Problem TDEAD3853 is UNSAT
Problem TDEAD3854 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3857 is UNSAT
Problem TDEAD3858 is UNSAT
Problem TDEAD3859 is UNSAT
Problem TDEAD3860 is UNSAT
Problem TDEAD3861 is UNSAT
Problem TDEAD3862 is UNSAT
Problem TDEAD3863 is UNSAT
Problem TDEAD3864 is UNSAT
Problem TDEAD3865 is UNSAT
Problem TDEAD3866 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3872 is UNSAT
Problem TDEAD3873 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3875 is UNSAT
Problem TDEAD3877 is UNSAT
Problem TDEAD3881 is UNSAT
Problem TDEAD3882 is UNSAT
Problem TDEAD3883 is UNSAT
Problem TDEAD3884 is UNSAT
Problem TDEAD3885 is UNSAT
Problem TDEAD3886 is UNSAT
Problem TDEAD3887 is UNSAT
Problem TDEAD3888 is UNSAT
Problem TDEAD3889 is UNSAT
Problem TDEAD3890 is UNSAT
Problem TDEAD3891 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3893 is UNSAT
Problem TDEAD3894 is UNSAT
Problem TDEAD3895 is UNSAT
Problem TDEAD3896 is UNSAT
Problem TDEAD3897 is UNSAT
Problem TDEAD3898 is UNSAT
Problem TDEAD3899 is UNSAT
Problem TDEAD3900 is UNSAT
Problem TDEAD3901 is UNSAT
Problem TDEAD3902 is UNSAT
Problem TDEAD3903 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 4/12 constraints. Problems are: Problem set: 120 solved, 3782 unsolved
[2024-05-21 14:13:14] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD814 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/4007 variables, and 13 constraints, problems are : Problem set: 125 solved, 3777 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1197/2705 constraints, Known Traps: 5/5 constraints]
After SMT, in 102378ms problems are : Problem set: 125 solved, 3777 unsolved
Search for dead transitions found 125 dead transitions in 102521ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3779/3904 transitions.
Reduce places removed 20 places and 600 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 258 transition count 3179
Reduce places removed 15 places and 328 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 35 place count 243 transition count 2851
Reduce places removed 5 places and 133 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 40 place count 238 transition count 2718
Reduce places removed 5 places and 113 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 45 place count 233 transition count 2605
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 47 place count 231 transition count 2553
Reduce places removed 1 places and 30 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48 place count 230 transition count 2523
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 50 place count 228 transition count 2497
Deduced a syphon composed of 5 places in 12 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 52 place count 228 transition count 2497
Deduced a syphon composed of 5 places in 11 ms
Applied a total of 52 rules in 125 ms. Remains 228 /278 variables (removed 50) and now considering 2497/3779 (removed 1282) transitions.
[2024-05-21 14:13:33] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
// Phase 1: matrix 2386 rows 228 cols
[2024-05-21 14:13:33] [INFO ] Computed 13 invariants in 10 ms
[2024-05-21 14:13:35] [INFO ] Implicit Places using invariants in 2145 ms returned []
[2024-05-21 14:13:35] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
[2024-05-21 14:13:35] [INFO ] Invariant cache hit.
[2024-05-21 14:13:35] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-05-21 14:13:37] [INFO ] Implicit Places using invariants and state equation in 2023 ms returned []
Implicit Place search using SMT with State Equation took 4184 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/280 places, 2497/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110935 ms. Remains : 228/280 places, 2497/3904 transitions.
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Support contains 14 out of 223 places after structural reductions.
[2024-05-21 14:13:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 14:13:37] [INFO ] Flatten gal took : 372 ms
[2024-05-21 14:13:37] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m128-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:13:38] [INFO ] Flatten gal took : 247 ms
[2024-05-21 14:13:38] [INFO ] Input system was already deterministic with 2497 transitions.
Support contains 11 out of 223 places (down from 14) after GAL structural reductions.
RANDOM walk for 40000 steps (26 resets) in 1585 ms. (25 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
[2024-05-21 14:13:40] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
// Phase 1: matrix 2386 rows 223 cols
[2024-05-21 14:13:40] [INFO ] Computed 8 invariants in 13 ms
[2024-05-21 14:13:40] [INFO ] State equation strengthened by 209 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/63 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1770/1833 variables, 63/67 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 60/127 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1833 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 685/2518 variables, 110/237 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2518 variables, 1/238 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2518 variables, 125/363 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2518 variables, 0/363 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/2523 variables, 2/365 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2523 variables, 1/366 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2523 variables, 0/366 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 86/2609 variables, 49/415 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2609 variables, 1/416 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2609 variables, 24/440 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2609 variables, 0/440 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2609 variables, 0/440 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2609/2609 variables, and 440 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1694 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 223/223 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/34 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 835/869 variables, 34/35 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 3/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1340/2209 variables, 64/102 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2209 variables, 1/103 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2209 variables, 145/248 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2209 variables, 2/250 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 14:13:43] [INFO ] Deduced a trap composed of 28 places in 386 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2209 variables, 1/251 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2209 variables, 0/251 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/2218 variables, 2/253 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2218 variables, 0/253 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 298/2516 variables, 87/340 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2516 variables, 1/341 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2516 variables, 43/384 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2516 variables, 2/386 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 14:13:44] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 1 ms to minimize.
[2024-05-21 14:13:44] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 2 ms to minimize.
[2024-05-21 14:13:44] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-05-21 14:13:45] [INFO ] Deduced a trap composed of 28 places in 771 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2516 variables, 4/390 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2516 variables, 0/390 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 3/2519 variables, 1/391 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2519 variables, 0/391 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 85/2604 variables, 35/426 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2604 variables, 2/428 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2604 variables, 18/446 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-21 14:13:46] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2604 variables, 1/447 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2604/2609 variables, and 447 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/223 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 6767ms problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 2497/2497 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 221 transition count 2502
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 221 transition count 2496
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 215 transition count 2496
Applied a total of 16 rules in 382 ms. Remains 215 /223 variables (removed 8) and now considering 2496/2497 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 215/223 places, 2496/2497 transitions.
RANDOM walk for 40318 steps (8 resets) in 183 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 126618 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 3
Probabilistic random walk after 126618 steps, saw 51989 distinct states, run finished after 3006 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-21 14:13:50] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
// Phase 1: matrix 2378 rows 215 cols
[2024-05-21 14:13:50] [INFO ] Computed 8 invariants in 10 ms
[2024-05-21 14:13:50] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 804/837 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/837 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1371/2208 variables, 64/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2208 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2208 variables, 147/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2208 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/2214 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2214 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2214 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 299/2513 variables, 82/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2513 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2513 variables, 50/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2513 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/2514 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2514 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2514 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 78/2592 variables, 32/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2592 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2592 variables, 11/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2592 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 1/2593 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2593 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/2593 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2593/2593 variables, and 433 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 210/210 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 804/837 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/837 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1371/2208 variables, 64/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2208 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2208 variables, 147/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2208 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 14:13:53] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2208 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/2214 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2214 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2214 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 299/2513 variables, 82/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2513 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2513 variables, 50/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2513 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 14:13:54] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 2 ms to minimize.
[2024-05-21 14:13:55] [INFO ] Deduced a trap composed of 28 places in 468 ms of which 14 ms to minimize.
[2024-05-21 14:13:55] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2513 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2513 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/2514 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2514 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2514 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 78/2592 variables, 32/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2592 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2592 variables, 11/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 14:13:56] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2592 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2592 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1/2593 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2593 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2593 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2593/2593 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 7106ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2650 ms.
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 2496/2496 transitions.
Applied a total of 0 rules in 183 ms. Remains 215 /215 variables (removed 0) and now considering 2496/2496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 215/215 places, 2496/2496 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 2496/2496 transitions.
Applied a total of 0 rules in 100 ms. Remains 215 /215 variables (removed 0) and now considering 2496/2496 (removed 0) transitions.
[2024-05-21 14:14:00] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
[2024-05-21 14:14:00] [INFO ] Invariant cache hit.
[2024-05-21 14:14:01] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-21 14:14:01] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
[2024-05-21 14:14:01] [INFO ] Invariant cache hit.
[2024-05-21 14:14:02] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 14:14:03] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2461 ms to find 0 implicit places.
[2024-05-21 14:14:03] [INFO ] Redundant transitions in 149 ms returned []
Running 2495 sub problems to find dead transitions.
[2024-05-21 14:14:03] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
[2024-05-21 14:14:03] [INFO ] Invariant cache hit.
[2024-05-21 14:14:03] [INFO ] State equation strengthened by 210 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m128

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.713s, Sys 0.060s]


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


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

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

Process ID: 661
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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716302298796

--------------------
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

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 349067608 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m128"
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-q8m128, 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-171620398200433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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