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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717224212814

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-q8m016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:43:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:43:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:43:35] [INFO ] Load time of PNML (sax parser for PT used): 805 ms
[2024-06-01 06:43:35] [INFO ] Transformed 754 places.
[2024-06-01 06:43:35] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:43:35] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1021 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 474 places in 130 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 93 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:43:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:43:35] [INFO ] Computed 8 invariants in 51 ms
[2024-06-01 06:43:36] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-06-01 06:43:36] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:43:36] [INFO ] Invariant cache hit.
[2024-06-01 06:43:36] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:43:38] [INFO ] Implicit Places using invariants and state equation in 2330 ms returned []
Implicit Place search using SMT with State Equation took 2993 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:43:38] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:43:38] [INFO ] Invariant cache hit.
[2024-06-01 06:43:38] [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:44:45] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 13 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 3 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2024-06-01 06:44:56] [INFO ] Deduced a trap composed of 11 places in 51 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: (timeout
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 30086 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 108553ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 108657ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3826/3904 transitions.
Reduce places removed 11 places and 334 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 266 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 261 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 259 transition count 3284
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 258 transition count 3252
Applied a total of 19 rules in 24 ms. Remains 258 /277 variables (removed 19) and now considering 3252/3826 (removed 574) transitions.
[2024-06-01 06:45:27] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
// Phase 1: matrix 3123 rows 258 cols
[2024-06-01 06:45:27] [INFO ] Computed 8 invariants in 13 ms
[2024-06-01 06:45:27] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-06-01 06:45:27] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
[2024-06-01 06:45:27] [INFO ] Invariant cache hit.
[2024-06-01 06:45:28] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-06-01 06:45:29] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 258/280 places, 3252/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113931 ms. Remains : 258/280 places, 3252/3904 transitions.
Support contains 26 out of 258 places after structural reductions.
[2024-06-01 06:45:29] [INFO ] Flatten gal took : 288 ms
[2024-06-01 06:45:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:45:30] [INFO ] Flatten gal took : 211 ms
[2024-06-01 06:45:30] [INFO ] Input system was already deterministic with 3252 transitions.
Support contains 17 out of 258 places (down from 26) after GAL structural reductions.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40025 steps (137 resets) in 2997 ms. (13 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40003 steps (29 resets) in 227 ms. (175 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (22 resets) in 369 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (24 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 257 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (27 resets) in 207 ms. (192 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (28 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (26 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (26 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (21 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (28 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (23 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (20 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
[2024-06-01 06:45:32] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
[2024-06-01 06:45:32] [INFO ] Invariant cache hit.
[2024-06-01 06:45:32] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/135 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2939/3074 variables, 135/141 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3074 variables, 81/222 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3074 variables, 0/222 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 304/3378 variables, 120/342 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3378 variables, 1/343 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3378 variables, 170/513 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3378 variables, 0/513 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3379 variables, 1/514 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3379 variables, 1/515 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 0/515 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/3381 variables, 2/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3381 variables, 0/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/3381 variables, 0/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3381/3381 variables, and 517 constraints, problems are : Problem set: 6 solved, 6 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 72/80 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1861/1941 variables, 80/83 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1941 variables, 7/90 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/90 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1326/3267 variables, 105/195 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3267 variables, 1/196 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3267 variables, 219/415 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3267 variables, 4/419 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3267 variables, 0/419 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 6/3273 variables, 3/422 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3273 variables, 2/424 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-06-01 06:45:35] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 3 ms to minimize.
[2024-06-01 06:45:36] [INFO ] Deduced a trap composed of 63 places in 273 ms of which 3 ms to minimize.
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/3273 variables, 2/426 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3273 variables, 0/426 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 108/3381 variables, 71/497 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3381 variables, 1/498 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3381 variables, 25/523 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3381 variables, 2/525 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-06-01 06:45:37] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 2 ms to minimize.
[2024-06-01 06:45:37] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 2 ms to minimize.
[2024-06-01 06:45:38] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 2 ms to minimize.
Problem AtomicPropp14 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/3381 variables, 3/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3381 variables, 0/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/3381 variables, 0/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3381/3381 variables, and 528 constraints, problems are : Problem set: 8 solved, 4 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 5/5 constraints]
After SMT, in 6805ms problems are : Problem set: 8 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3731 ms.
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 3252/3252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 257 transition count 3227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 257 transition count 3227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 255 transition count 3232
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 3226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 249 transition count 3226
Applied a total of 18 rules in 231 ms. Remains 249 /258 variables (removed 9) and now considering 3226/3252 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 249/258 places, 3226/3252 transitions.
RANDOM walk for 40027 steps (8 resets) in 310 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 125359 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 125359 steps, saw 45166 distinct states, run finished after 3005 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 06:45:46] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-06-01 06:45:46] [INFO ] Computed 8 invariants in 15 ms
[2024-06-01 06:45:46] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1833/1911 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1911 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1297/3208 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3208 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3208 variables, 222/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3208 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3210 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3210 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 131/3341 variables, 93/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3341 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3341 variables, 26/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1833/1911 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1911 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1297/3208 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3208 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3208 variables, 222/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3208 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:45:49] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/3208 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3208 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3210 variables, 1/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3210 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 131/3341 variables, 93/483 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 2/485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3341 variables, 26/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 3/514 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 06:45:50] [INFO ] Deduced a trap composed of 37 places in 507 ms of which 3 ms to minimize.
[2024-06-01 06:45:50] [INFO ] Deduced a trap composed of 36 places in 506 ms of which 2 ms to minimize.
[2024-06-01 06:45:51] [INFO ] Deduced a trap composed of 39 places in 502 ms of which 3 ms to minimize.
[2024-06-01 06:45:51] [INFO ] Deduced a trap composed of 20 places in 456 ms of which 2 ms to minimize.
[2024-06-01 06:45:52] [INFO ] Deduced a trap composed of 13 places in 391 ms of which 1 ms to minimize.
[2024-06-01 06:45:52] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3341 variables, 6/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3341 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 520 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5587 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 7158ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 3942 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 70 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 249/249 places, 3226/3226 transitions.
RANDOM walk for 40012 steps (8 resets) in 317 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 115538 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 3
Probabilistic random walk after 115538 steps, saw 38770 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 06:46:00] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:46:00] [INFO ] Invariant cache hit.
[2024-06-01 06:46:01] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1006/1052 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2065/3117 variables, 49/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3117 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3117 variables, 212/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3117 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3119 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3119 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 220/3339 variables, 152/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 37/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3339 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3341 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1006/1052 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2065/3117 variables, 49/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3117 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3117 variables, 212/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3117 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3119 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3119 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 220/3339 variables, 152/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 37/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3339 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 1 ms to minimize.
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3339 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3339 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3341 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3341 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/3341 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 515 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 4388ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2600 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 133 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 249/249 places, 3226/3226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 55 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-06-01 06:46:08] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:46:08] [INFO ] Invariant cache hit.
[2024-06-01 06:46:08] [INFO ] Implicit Places using invariants in 779 ms returned []
[2024-06-01 06:46:08] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:46:08] [INFO ] Invariant cache hit.
[2024-06-01 06:46:09] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-06-01 06:46:11] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
[2024-06-01 06:46:11] [INFO ] Redundant transitions in 252 ms returned []
Running 3225 sub problems to find dead transitions.
[2024-06-01 06:46:11] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:46:11] [INFO ] Invariant cache hit.
[2024-06-01 06:46:11] [INFO ] State equation strengthened by 252 read => feed constraints.
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-q8m016-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-01
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-02
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-06
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-08
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-09
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-10
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2024-11
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2023-12
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2023-13
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2023-14
Could not compute solution for formula : BugTracking-PT-q8m016-CTLCardinality-2023-15

BK_STOP 1717224399164

--------------------
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-q8m016-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/637/ctl_0_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/637/ctl_1_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/637/ctl_2_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/637/ctl_3_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/637/ctl_4_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/637/ctl_5_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/637/ctl_6_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/637/ctl_7_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/637/ctl_8_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/637/ctl_9_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/637/ctl_10_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/637/ctl_11_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/637/ctl_12_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/637/ctl_13_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/637/ctl_14_
ctl formula name BugTracking-PT-q8m016-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/637/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-q8m016"
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-q8m016, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399400409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m016.tgz
mv BugTracking-PT-q8m016 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;