About the Execution of LTSMin+red for Sudoku-COL-AN11
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-171690532500493.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-COL-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532500493
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.1K Apr 12 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 11:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 11:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN11-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717260597110
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:49:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:49:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:49:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:49:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:49:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2024-06-01 16:49:58] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-06-01 16:49:58] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-06-01 16:49:58] [INFO ] Skeletonized 4 HLPN properties in 1 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 16:49:58] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 121, 121, 121] Max Struct:[121, 121, 121, 121]
FORMULA Sudoku-COL-AN11-UpperBounds-05 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-12 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-06 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-08 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-09 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-10 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-01 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 16:49:58] [INFO ] Invariant cache hit.
[2024-06-01 16:49:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 16:49:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 16:49:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 16:49:59] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[121]
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2024-06-01 16:49:59] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 62 ms.
[2024-06-01 16:49:59] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[121]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[121]
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 16:49:59] [INFO ] Computed 363 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[121]
RANDOM walk for 10000 steps (94 resets) in 1093 ms. (9 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 260 ms. (38 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[110] Max Struct:[121]
[2024-06-01 16:50:00] [INFO ] Invariant cache hit.
[2024-06-01 16:50:01] [INFO ] [Real]Absence check using 363 positive place invariants in 408 ms returned sat
[2024-06-01 16:50:03] [INFO ] [Real]Absence check using state equation in 2343 ms returned sat
[2024-06-01 16:50:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 67 ms.
[2024-06-01 16:50:04] [INFO ] Added : 0 causal constraints over 0 iterations in 209 ms. Result :sat
Minimization took 535 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[110] Max Struct:[121]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[110] Max Struct:[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 105 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-06-01 16:50:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[110] Max Struct:[121]
RANDOM walk for 290038 steps (2744 resets) in 30001 ms. (9 steps per ms)
BEST_FIRST walk for 191177 steps (4 resets) in 5003 ms. (38 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[121]
[2024-06-01 16:50:39] [INFO ] Invariant cache hit.
[2024-06-01 16:50:41] [INFO ] [Real]Absence check using 363 positive place invariants in 953 ms returned sat
[2024-06-01 16:50:44] [INFO ] [Real]Absence check using state equation in 2994 ms returned sat
[2024-06-01 16:50:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 56 ms.
[2024-06-01 16:50:44] [INFO ] Added : 0 causal constraints over 0 iterations in 172 ms. Result :sat
Minimization took 5227 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[121]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[113] Max Struct:[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 46 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 58 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 16:50:49] [INFO ] Invariant cache hit.
[2024-06-01 16:50:50] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-06-01 16:50:50] [INFO ] Invariant cache hit.
[2024-06-01 16:50:53] [INFO ] Implicit Places using invariants and state equation in 2568 ms returned []
Implicit Place search using SMT with State Equation took 3390 ms to find 0 implicit places.
[2024-06-01 16:50:53] [INFO ] Redundant transitions in 82 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 3558 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-06-01 16:50:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[113] Max Struct:[121]
RANDOM walk for 301135 steps (2850 resets) in 30001 ms. (10 steps per ms)
BEST_FIRST walk for 181502 steps (4 resets) in 5014 ms. (36 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[121]
[2024-06-01 16:51:28] [INFO ] Invariant cache hit.
[2024-06-01 16:51:29] [INFO ] [Real]Absence check using 363 positive place invariants in 943 ms returned sat
[2024-06-01 16:51:32] [INFO ] [Real]Absence check using state equation in 2903 ms returned sat
[2024-06-01 16:51:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 51 ms.
[2024-06-01 16:51:32] [INFO ] Added : 0 causal constraints over 0 iterations in 173 ms. Result :sat
Minimization took 5429 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[121]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[113] Max Struct:[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 32 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 16:51:38] [INFO ] Invariant cache hit.
[2024-06-01 16:51:38] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-06-01 16:51:38] [INFO ] Invariant cache hit.
[2024-06-01 16:51:41] [INFO ] Implicit Places using invariants and state equation in 2477 ms returned []
Implicit Place search using SMT with State Equation took 3255 ms to find 0 implicit places.
[2024-06-01 16:51:41] [INFO ] Redundant transitions in 62 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 3343 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 6073 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1618 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1454 ms. (27 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 136454 steps, run timeout after 6044 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 136454 steps, saw 86645 distinct states, run finished after 6050 ms. (steps per millisecond=22 ) properties seen :0
[2024-06-01 16:51:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 363/1694 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1694 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 2057 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2714 ms.
Refiners :[Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 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/1331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 363/1694 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1694 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1331/3025 variables, 1694/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3025 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/3025 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 2057 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2345 ms.
Refiners :[Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5581ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 484 ms.
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 21 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 5237 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1960 ms. (20 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286586 steps, run timeout after 6001 ms. (steps per millisecond=47 ) properties seen :0 out of 1
Probabilistic random walk after 286586 steps, saw 134010 distinct states, run finished after 6001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 16:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 363/1694 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1694 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/3025 variables, 1694/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3025 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3025 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 2057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1907 ms.
Refiners :[Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 363/1694 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1694 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 2057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31686 ms.
Refiners :[Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 33693ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 13 ms.
FORMULA Sudoku-COL-AN11-UpperBounds-02 121 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN11-UpperBounds-04 121 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN11-UpperBounds-07 121 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN11-UpperBounds-11 121 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN11-UpperBounds-13 121 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN11-UpperBounds-14 121 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN11-UpperBounds-15 121 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN11-UpperBounds-00 121 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 159588 ms.
ITS solved all properties within timeout
BK_STOP 1717260757886
--------------------
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 UpperBounds -timeout 360 -rebuildPNML
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-COL-AN11"
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-COL-AN11, 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-171690532500493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN11.tgz
mv Sudoku-COL-AN11 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 ;