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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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:23 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-q3m064-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717223525711

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:32:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:32:09] [INFO ] Load time of PNML (sax parser for PT used): 1316 ms
[2024-06-01 06:32:09] [INFO ] Transformed 754 places.
[2024-06-01 06:32:09] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:32:09] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1735 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
Deduced a syphon composed of 514 places in 162 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q3m064-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 119 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-06-01 06:32:10] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-06-01 06:32:10] [INFO ] Computed 8 invariants in 87 ms
[2024-06-01 06:32:11] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2024-06-01 06:32:11] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:32:11] [INFO ] Invariant cache hit.
[2024-06-01 06:32:12] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-06-01 06:32:14] [INFO ] Implicit Places using invariants and state equation in 2482 ms returned []
Implicit Place search using SMT with State Equation took 4036 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-06-01 06:32:14] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:32:14] [INFO ] Invariant cache hit.
[2024-06-01 06:32:14] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
[2024-06-01 06:32:58] [INFO ] Deduced a trap composed of 10 places in 2070 ms of which 51 ms to minimize.
[2024-06-01 06:32:59] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 2 ms to minimize.
[2024-06-01 06:32:59] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 1 ms to minimize.
[2024-06-01 06:33:09] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 12 constraints, problems are : Problem set: 14 solved, 2734 unsolved in 30150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/2748 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2734 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 4/12 constraints. Problems are: Problem set: 43 solved, 2705 unsolved
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2330 is UNSAT
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 2 ms to minimize.
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2376 is UNSAT
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
Problem TDEAD2677 is UNSAT
[2024-06-01 06:33:45] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
Problem TDEAD2678 is UNSAT
[2024-06-01 06:33:45] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
[2024-06-01 06:33:45] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
[2024-06-01 06:33:45] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
Problem TDEAD2705 is UNSAT
[2024-06-01 06:33:45] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
SMT process timed out in 91197ms, After SMT, problems are : Problem set: 43 solved, 2705 unsolved
Search for dead transitions found 94 dead transitions in 91284ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2656/2769 transitions.
Reduce places removed 22 places and 597 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 215 transition count 2059
Reduce places removed 16 places and 182 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 38 place count 199 transition count 1877
Reduce places removed 16 places and 331 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 54 place count 183 transition count 1546
Reduce places removed 10 places and 230 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 64 place count 173 transition count 1316
Reduce places removed 3 places and 53 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 170 transition count 1263
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 167 transition count 1219
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 9 places and 162 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 82 place count 158 transition count 1057
Deduced a syphon composed of 9 places in 1 ms
Applied a total of 82 rules in 58 ms. Remains 158 /237 variables (removed 79) and now considering 1057/2656 (removed 1599) transitions.
[2024-06-01 06:33:45] [INFO ] Flow matrix only has 1013 transitions (discarded 44 similar events)
// Phase 1: matrix 1013 rows 158 cols
[2024-06-01 06:33:45] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 06:33:47] [INFO ] Implicit Places using invariants in 1945 ms returned []
[2024-06-01 06:33:47] [INFO ] Flow matrix only has 1013 transitions (discarded 44 similar events)
[2024-06-01 06:33:47] [INFO ] Invariant cache hit.
[2024-06-01 06:33:47] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-06-01 06:33:48] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/240 places, 1057/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98143 ms. Remains : 158/240 places, 1057/2769 transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Support contains 12 out of 149 places after structural reductions.
[2024-06-01 06:33:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 06:33:48] [INFO ] Flatten gal took : 171 ms
[2024-06-01 06:33:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q3m064-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:33:48] [INFO ] Flatten gal took : 97 ms
[2024-06-01 06:33:49] [INFO ] Input system was already deterministic with 1057 transitions.
Support contains 4 out of 149 places (down from 12) after GAL structural reductions.
RANDOM walk for 40000 steps (32 resets) in 1257 ms. (31 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (9 resets) in 357 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
[2024-06-01 06:33:50] [INFO ] Flow matrix only has 1013 transitions (discarded 44 similar events)
// Phase 1: matrix 1013 rows 149 cols
[2024-06-01 06:33:50] [INFO ] Computed 8 invariants in 10 ms
[2024-06-01 06:33:50] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/30 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/441 variables, 30/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 304/745 variables, 35/68 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 77/145 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/145 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/746 variables, 1/146 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/746 variables, 1/147 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/746 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 346/1092 variables, 47/194 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1092 variables, 1/195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1092 variables, 40/235 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1092 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1094 variables, 1/236 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1094 variables, 0/236 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 64/1158 variables, 33/269 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 2/271 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1158 variables, 9/280 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1158 variables, 0/280 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/1161 variables, 1/281 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1161 variables, 1/282 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1161 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/1162 variables, 2/284 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1162 variables, 1/285 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1162 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1162 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1162/1162 variables, and 285 constraints, problems are : Problem set: 2 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/21 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 556/577 variables, 23/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 48/74 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 375/952 variables, 63/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/952 variables, 1/138 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 41/179 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/180 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 183/1135 variables, 38/218 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1135 variables, 1/219 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1135 variables, 36/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 06:33:52] [INFO ] Deduced a trap composed of 16 places in 918 ms of which 4 ms to minimize.
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 1135/1162 variables, and 256 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1576 ms.
Refiners :[Positive P Invariants (semi-flows): 3/8 constraints, State Equation: 125/149 constraints, ReadFeed: 126/128 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2355ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q3m064-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:33:52] [INFO ] Flatten gal took : 102 ms
[2024-06-01 06:33:52] [INFO ] Flatten gal took : 131 ms
[2024-06-01 06:33:52] [INFO ] Input system was already deterministic with 1057 transitions.
Computed a total of 4 stabilizing places and 38 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 1057/1057 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 149/149 places, 1057/1057 transitions.
[2024-06-01 06:33:53] [INFO ] Flatten gal took : 82 ms
[2024-06-01 06:33:53] [INFO ] Flatten gal took : 101 ms
[2024-06-01 06:33:53] [INFO ] Input system was already deterministic with 1057 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 1057/1057 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 149/149 places, 1057/1057 transitions.
[2024-06-01 06:33:53] [INFO ] Flatten gal took : 80 ms
[2024-06-01 06:33:53] [INFO ] Flatten gal took : 83 ms
[2024-06-01 06:33:53] [INFO ] Input system was already deterministic with 1057 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 1057/1057 transitions.
Applied a total of 0 rules in 13 ms. Remains 149 /149 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 149/149 places, 1057/1057 transitions.
[2024-06-01 06:33:53] [INFO ] Flatten gal took : 64 ms
[2024-06-01 06:33:53] [INFO ] Flatten gal took : 93 ms
[2024-06-01 06:33:54] [INFO ] Input system was already deterministic with 1057 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 1057/1057 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 149/149 places, 1057/1057 transitions.
[2024-06-01 06:33:54] [INFO ] Flatten gal took : 80 ms
[2024-06-01 06:33:54] [INFO ] Flatten gal took : 85 ms
[2024-06-01 06:33:54] [INFO ] Input system was already deterministic with 1057 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 1057/1057 transitions.
Applied a total of 0 rules in 18 ms. Remains 149 /149 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 149/149 places, 1057/1057 transitions.
[2024-06-01 06:33:54] [INFO ] Flatten gal took : 78 ms
[2024-06-01 06:33:54] [INFO ] Flatten gal took : 80 ms
[2024-06-01 06:33:54] [INFO ] Input system was already deterministic with 1057 transitions.
[2024-06-01 06:33:54] [INFO ] Flatten gal took : 36 ms
[2024-06-01 06:33:54] [INFO ] Flatten gal took : 54 ms
[2024-06-01 06:33:54] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 06:33:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 149 places, 1057 transitions and 5127 arcs took 34 ms.
Total runtime 107152 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BugTracking-PT-q3m064-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q3m064-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q3m064-CTLCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q3m064-CTLCardinality-2024-06
Could not compute solution for formula : BugTracking-PT-q3m064-CTLCardinality-2024-09

BK_STOP 1717223635405

--------------------
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
mcc2024
ctl formula name BugTracking-PT-q3m064-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/620/ctl_0_
ctl formula name BugTracking-PT-q3m064-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/620/ctl_1_
ctl formula name BugTracking-PT-q3m064-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/620/ctl_2_
ctl formula name BugTracking-PT-q3m064-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/620/ctl_3_
ctl formula name BugTracking-PT-q3m064-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/620/ctl_4_
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-q3m064"
export BK_EXAMINATION="CTLCardinality"
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-q3m064, 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 r472-tajo-171620399300361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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