About the Execution of LTSMin+red for Sudoku-PT-AN16
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532900693.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Sudoku-PT-AN16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532900693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 119M
-rw-r--r-- 1 mcc users 1.6M Apr 12 12:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9M Apr 12 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 698K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7M Apr 12 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 12 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7M Apr 12 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40M Apr 12 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 144K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 345K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.3M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717278042736
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:40:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 21:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:40:44] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2024-06-01 21:40:44] [INFO ] Transformed 4864 places.
[2024-06-01 21:40:44] [INFO ] Transformed 4096 transitions.
[2024-06-01 21:40:44] [INFO ] Found NUPN structural information;
[2024-06-01 21:40:44] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 577 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 54 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[256, 0, 256, 1, 1, 1, 0, 1, 0, 1, 1] Max Struct:[256, 4096, 256, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-05 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-06 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-02 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-04 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-07 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-00 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[4096, 1, 1]
// Phase 1: matrix 4096 rows 4864 cols
[2024-06-01 21:40:44] [INFO ] Computed 768 invariants in 94 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[4096, 1, 1]
RANDOM walk for 10000 steps (44 resets) in 3576 ms. (2 steps per ms)
FORMULA Sudoku-PT-AN16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Sudoku-PT-AN16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 837 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[235] Max Struct:[4096]
[2024-06-01 21:40:49] [INFO ] Invariant cache hit.
[2024-06-01 21:40:52] [INFO ] [Real]Absence check using 768 positive place invariants in 1739 ms returned sat
[2024-06-01 21:40:54] [INFO ] [Real]Absence check using state equation in 2307 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[235] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[235] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 349 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 21:40:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[235] Max Struct:[4096]
RANDOM walk for 81944 steps (362 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 55245 steps (0 resets) in 5056 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[235] Max Struct:[4096]
[2024-06-01 21:41:29] [INFO ] Invariant cache hit.
[2024-06-01 21:41:33] [INFO ] [Real]Absence check using 768 positive place invariants in 2668 ms returned sat
[2024-06-01 21:41:49] [INFO ] [Real]Absence check using state equation in 15866 ms returned sat
[2024-06-01 21:41:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 159 ms.
[2024-06-01 21:41:50] [INFO ] Added : 0 causal constraints over 0 iterations in 519 ms. Result :sat
Minimization took 4699 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[235] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[235] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 124 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 249 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:41:55] [INFO ] Invariant cache hit.
[2024-06-01 21:42:07] [INFO ] Implicit Places using invariants in 11776 ms returned []
[2024-06-01 21:42:07] [INFO ] Invariant cache hit.
[2024-06-01 21:42:24] [INFO ] Implicit Places using invariants and state equation in 17656 ms returned []
Implicit Place search using SMT with State Equation took 29447 ms to find 0 implicit places.
[2024-06-01 21:42:25] [INFO ] Redundant transitions in 240 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29952 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 18328 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4585 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3957 ms. (10 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 146822 steps, run timeout after 18026 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 146822 steps, saw 146778 distinct states, run finished after 18043 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 21:42:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3632 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3445 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8263ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 80 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 18662 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4609 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3877 ms. (10 steps per ms) remains 2/2 properties
Probabilistic random walk after 143970 steps, saw 143928 distinct states, run finished after 18099 ms. (steps per millisecond=7 ) properties seen :0
[2024-06-01 21:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 1 solved, 1 unsolved in 8298 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 768/4864 variables, 768/4864 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4864 variables, 768/5632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4864 variables, 0/5632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8960/8960 variables, and 10496 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45046 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 4864/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 54436ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 79 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[235] Max Struct:[4096]
Starting property specific reduction for Sudoku-PT-AN16-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[4096]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4096]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4096]
[2024-06-01 21:44:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4096]
RANDOM walk for 10000 steps (44 resets) in 3579 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 837 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[231] Max Struct:[4096]
[2024-06-01 21:44:22] [INFO ] Invariant cache hit.
[2024-06-01 21:44:24] [INFO ] [Real]Absence check using 768 positive place invariants in 1695 ms returned sat
[2024-06-01 21:44:27] [INFO ] [Real]Absence check using state equation in 2624 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[231] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[231] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 84 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 21:44:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[231] Max Struct:[4096]
RANDOM walk for 84622 steps (373 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 58838 steps (0 resets) in 5041 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[232] Max Struct:[4096]
[2024-06-01 21:45:02] [INFO ] Invariant cache hit.
[2024-06-01 21:45:05] [INFO ] [Real]Absence check using 768 positive place invariants in 2343 ms returned sat
[2024-06-01 21:45:19] [INFO ] [Real]Absence check using state equation in 13618 ms returned sat
[2024-06-01 21:45:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 154 ms.
[2024-06-01 21:45:20] [INFO ] Added : 0 causal constraints over 0 iterations in 481 ms. Result :sat
Minimization took 5586 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[232] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[232] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 92 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 86 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:45:26] [INFO ] Invariant cache hit.
[2024-06-01 21:45:36] [INFO ] Implicit Places using invariants in 10819 ms returned []
[2024-06-01 21:45:36] [INFO ] Invariant cache hit.
[2024-06-01 21:45:54] [INFO ] Implicit Places using invariants and state equation in 17745 ms returned []
Implicit Place search using SMT with State Equation took 28569 ms to find 0 implicit places.
[2024-06-01 21:45:54] [INFO ] Redundant transitions in 256 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28920 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 21:45:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[232] Max Struct:[4096]
RANDOM walk for 89176 steps (394 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 58758 steps (0 resets) in 5009 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[234] Max Struct:[4096]
[2024-06-01 21:46:30] [INFO ] Invariant cache hit.
[2024-06-01 21:46:32] [INFO ] [Real]Absence check using 768 positive place invariants in 1832 ms returned sat
[2024-06-01 21:46:50] [INFO ] [Real]Absence check using state equation in 17474 ms returned sat
[2024-06-01 21:46:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 178 ms.
[2024-06-01 21:46:50] [INFO ] Added : 0 causal constraints over 0 iterations in 506 ms. Result :sat
Minimization took 5597 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[234] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[234] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 76 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 71 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:46:56] [INFO ] Invariant cache hit.
[2024-06-01 21:47:07] [INFO ] Implicit Places using invariants in 11018 ms returned []
[2024-06-01 21:47:07] [INFO ] Invariant cache hit.
[2024-06-01 21:47:25] [INFO ] Implicit Places using invariants and state equation in 17912 ms returned []
Implicit Place search using SMT with State Equation took 28934 ms to find 0 implicit places.
[2024-06-01 21:47:25] [INFO ] Redundant transitions in 158 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29181 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 21:47:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[234] Max Struct:[4096]
RANDOM walk for 82582 steps (364 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 51768 steps (0 resets) in 5048 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[234] Max Struct:[4096]
[2024-06-01 21:48:00] [INFO ] Invariant cache hit.
[2024-06-01 21:48:03] [INFO ] [Real]Absence check using 768 positive place invariants in 1873 ms returned sat
[2024-06-01 21:48:21] [INFO ] [Real]Absence check using state equation in 17654 ms returned sat
[2024-06-01 21:48:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 174 ms.
[2024-06-01 21:48:21] [INFO ] Added : 0 causal constraints over 0 iterations in 507 ms. Result :sat
Minimization took 4669 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[234] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[234] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 85 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 73 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:48:26] [INFO ] Invariant cache hit.
[2024-06-01 21:48:38] [INFO ] Implicit Places using invariants in 11680 ms returned []
[2024-06-01 21:48:38] [INFO ] Invariant cache hit.
[2024-06-01 21:48:55] [INFO ] Implicit Places using invariants and state equation in 17240 ms returned []
Implicit Place search using SMT with State Equation took 28930 ms to find 0 implicit places.
[2024-06-01 21:48:55] [INFO ] Redundant transitions in 165 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29179 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 22962 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5760 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4890 ms. (8 steps per ms) remains 2/2 properties
Probabilistic random walk after 226149 steps, saw 226083 distinct states, run finished after 27033 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 21:49:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3538 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3539 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7960ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 109 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 20061 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4713 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4097 ms. (9 steps per ms) remains 2/2 properties
Probabilistic random walk after 171283 steps, saw 171233 distinct states, run finished after 21036 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 21:50:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 1 solved, 1 unsolved in 8100 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 768/4864 variables, 768/4864 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4864 variables, 768/5632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4864 variables, 0/5632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4096/8960 variables, 4864/10496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8960 variables, 0/10496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/8960 variables, 0/10496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8960/8960 variables, and 10496 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4984 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 4864/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 13975ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 235 steps, including 0 resets, run visited all 1 properties in 37 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 47 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[234] Max Struct:[4096]
Ending property specific reduction for Sudoku-PT-AN16-UpperBounds-01 in 365871 ms.
[2024-06-01 21:50:24] [INFO ] Flatten gal took : 361 ms
[2024-06-01 21:50:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-06-01 21:50:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 21 ms.
Total runtime 580771 ms.
There are residual formulas that ITS could not solve within timeout
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 : Sudoku-PT-AN16-UpperBounds-01
BK_STOP 1717278624884
--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name Sudoku-PT-AN16-UpperBounds-01
ub formula formula --maxsum=/tmp/630/ub_0_
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="Sudoku-PT-AN16"
export BK_EXAMINATION="UpperBounds"
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 Sudoku-PT-AN16, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532900693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN16.tgz
mv Sudoku-PT-AN16 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;