About the Execution of LTSMin+red for BugTracking-PT-q8m004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16154.632 | 150136.00 | 222207.00 | 194.40 | FTT?TFTTFFFF?FTF | normal |
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.r472-tajo-171620399400394.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 ltsminxred
Input is BugTracking-PT-q8m004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399400394
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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-q8m004-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717223948630
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:39:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:39:11] [INFO ] Load time of PNML (sax parser for PT used): 989 ms
[2024-06-01 06:39:11] [INFO ] Transformed 754 places.
[2024-06-01 06:39:11] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:39:11] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1230 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Deduced a syphon composed of 474 places in 120 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 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 92 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:39:11] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:39:11] [INFO ] Computed 8 invariants in 77 ms
[2024-06-01 06:39:12] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-06-01 06:39:12] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:39:12] [INFO ] Invariant cache hit.
[2024-06-01 06:39:13] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:39:14] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:39:14] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:39:14] [INFO ] Invariant cache hit.
[2024-06-01 06:39:14] [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-06-01 06:40:14] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 23 ms to minimize.
[2024-06-01 06:40:14] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 1 ms to minimize.
[2024-06-01 06:40:14] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
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
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30081 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: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
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
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
Problem TDEAD2741 is UNSAT
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2778 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 16 constraints, problems are : Problem set: 68 solved, 3801 unsolved in 30057 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: 8/8 constraints]
After SMT, in 102631ms problems are : Problem set: 68 solved, 3801 unsolved
Search for dead transitions found 68 dead transitions in 102689ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3803/3904 transitions.
Reduce places removed 18 places and 565 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 259 transition count 3238
Reduce places removed 10 places and 278 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 28 place count 249 transition count 2960
Reduce places removed 12 places and 336 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 40 place count 237 transition count 2624
Reduce places removed 8 places and 184 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 48 place count 229 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 228 transition count 2420
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 228 transition count 2420
Applied a total of 50 rules in 43 ms. Remains 228 /277 variables (removed 49) and now considering 2420/3803 (removed 1383) transitions.
[2024-06-01 06:40:57] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 228 cols
[2024-06-01 06:40:57] [INFO ] Computed 8 invariants in 9 ms
[2024-06-01 06:40:57] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-06-01 06:40:57] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-06-01 06:40:57] [INFO ] Invariant cache hit.
[2024-06-01 06:40:58] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 06:40:58] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/280 places, 2420/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107324 ms. Remains : 228/280 places, 2420/3904 transitions.
Support contains 6 out of 228 places after structural reductions.
[2024-06-01 06:40:59] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2024-06-01 06:40:59] [INFO ] Flatten gal took : 278 ms
FORMULA BugTracking-PT-q8m004-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:40:59] [INFO ] Flatten gal took : 223 ms
[2024-06-01 06:41:00] [INFO ] Input system was already deterministic with 2420 transitions.
RANDOM walk for 40001 steps (412 resets) in 1963 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (101 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 147233 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 147233 steps, saw 84887 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 06:41:03] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-06-01 06:41:03] [INFO ] Invariant cache hit.
[2024-06-01 06:41:03] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1147/1208 variables, 61/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1208 variables, 82/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1208 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 695/1903 variables, 65/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1903 variables, 65/277 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1903 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/1908 variables, 1/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1908 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 527/2435 variables, 52/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2435 variables, 1/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2435 variables, 42/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2435 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/2438 variables, 1/374 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2438 variables, 0/374 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 103/2541 variables, 47/421 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2541 variables, 2/423 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2541 variables, 21/444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2541 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/2546 variables, 3/447 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2546 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2546 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2546/2546 variables, and 447 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 665/696 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 56/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1135/1831 variables, 64/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1831 variables, 82/234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1831 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1836 variables, 1/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1836 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 597/2433 variables, 81/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2433 variables, 2/318 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2433 variables, 51/369 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2433 variables, 1/370 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2433 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/2438 variables, 2/372 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2438 variables, 2/374 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2438 variables, 1/375 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 10 places in 453 ms of which 1 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2438 variables, 4/379 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2438 variables, 0/379 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 103/2541 variables, 47/426 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2541 variables, 2/428 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2541 variables, 21/449 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2541 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/2546 variables, 3/452 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2546 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2546 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2546/2546 variables, and 452 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3004 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 4257ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 566 ms.
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 226 transition count 2423
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 226 transition count 2417
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 220 transition count 2417
Applied a total of 16 rules in 206 ms. Remains 220 /228 variables (removed 8) and now considering 2417/2420 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 220/228 places, 2417/2420 transitions.
RANDOM walk for 40010 steps (8 resets) in 616 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 187514 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 187514 steps, saw 88166 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 06:41:12] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
// Phase 1: matrix 2310 rows 220 cols
[2024-06-01 06:41:12] [INFO ] Computed 8 invariants in 14 ms
[2024-06-01 06:41:12] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 665/696 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 56/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1134/1830 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1830 variables, 82/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1830 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1834 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1834 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 601/2435 variables, 79/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2435 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2435 variables, 59/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2435 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2436 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2436 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2436 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 93/2529 variables, 44/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2529 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2529 variables, 14/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2529 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/2530 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2530/2530 variables, and 439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 665/696 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 56/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1134/1830 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1830 variables, 82/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1830 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1834 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1834 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 601/2435 variables, 79/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2435 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2435 variables, 59/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2435 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:14] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2435 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2435 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/2436 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2436 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2436 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 93/2529 variables, 44/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2529 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2529 variables, 14/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2529 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/2530 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2530 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2530 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2530/2530 variables, and 441 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1812 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2584ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 219 ms.
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2417/2417 transitions.
Applied a total of 0 rules in 46 ms. Remains 220 /220 variables (removed 0) and now considering 2417/2417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 220/220 places, 2417/2417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2417/2417 transitions.
Applied a total of 0 rules in 41 ms. Remains 220 /220 variables (removed 0) and now considering 2417/2417 (removed 0) transitions.
[2024-06-01 06:41:15] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-06-01 06:41:15] [INFO ] Invariant cache hit.
[2024-06-01 06:41:15] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-06-01 06:41:15] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-06-01 06:41:15] [INFO ] Invariant cache hit.
[2024-06-01 06:41:16] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-06-01 06:41:17] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2435 ms to find 0 implicit places.
[2024-06-01 06:41:17] [INFO ] Redundant transitions in 189 ms returned []
Running 2416 sub problems to find dead transitions.
[2024-06-01 06:41:17] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-06-01 06:41:17] [INFO ] Invariant cache hit.
[2024-06-01 06:41:17] [INFO ] State equation strengthened by 211 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-00
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-01
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-02
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-03
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-04
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-05
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-06
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-07
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-08
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-09
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-10
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2024-11
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2023-12
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2023-13
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2023-14
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-2023-15
BK_STOP 1717224098766
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/619/ctl_0_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/619/ctl_1_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/619/ctl_2_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/619/ctl_3_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/619/ctl_4_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/619/ctl_5_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/619/ctl_6_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/619/ctl_7_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/619/ctl_8_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/619/ctl_9_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/619/ctl_10_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/619/ctl_11_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/619/ctl_12_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/619/ctl_13_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/619/ctl_14_
ctl formula name BugTracking-PT-q8m004-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/619/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m004"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q8m004, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399400394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;