About the Execution of 2023-gold 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.r417-tall-171690556200306.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 gold2023
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 r417-tall-171690556200306
=====================================================================
--------------------
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 1717136459939
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN11
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 06:21:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 06:21:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:21:01] [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-05-31 06:21:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:21:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 378 ms
[2024-05-31 06:21:02] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 964 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2024-05-31 06:21:02] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-31 06:21:02] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 06:21:02] [INFO ] Computed 3 invariants in 4 ms
FORMULA Sudoku-COL-AN11-UpperBounds-12 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-09 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-06 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-05 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-01 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 06:21:02] [INFO ] Invariant cache hit.
[2024-05-31 06:21:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 06:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-31 06:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:21:02] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-31 06:21:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 06:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-31 06:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 1 ms.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 1 ms.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 06:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 06:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121, 121, 121]
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2024-05-31 06:21:03] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 38 ms.
[2024-05-31 06:21:03] [INFO ] Unfolded 8 HLPN properties in 2 ms.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 2778 ms. (steps per millisecond=3 ) properties (out of 8) seen :872
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 8) seen :24
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 06:21:08] [INFO ] Computed 363 invariants in 25 ms
[2024-05-31 06:21:09] [INFO ] [Real]Absence check using 363 positive place invariants in 237 ms returned sat
[2024-05-31 06:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:09] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2024-05-31 06:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:10] [INFO ] [Nat]Absence check using 363 positive place invariants in 193 ms returned sat
[2024-05-31 06:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:11] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-31 06:21:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 79 ms.
[2024-05-31 06:21:11] [INFO ] Added : 0 causal constraints over 0 iterations in 224 ms. Result :sat
Minimization took 339 ms.
[2024-05-31 06:21:12] [INFO ] [Real]Absence check using 363 positive place invariants in 241 ms returned sat
[2024-05-31 06:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:12] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2024-05-31 06:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:13] [INFO ] [Nat]Absence check using 363 positive place invariants in 182 ms returned sat
[2024-05-31 06:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:13] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-31 06:21:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 49 ms.
[2024-05-31 06:21:14] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 335 ms.
[2024-05-31 06:21:14] [INFO ] [Real]Absence check using 363 positive place invariants in 238 ms returned sat
[2024-05-31 06:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:15] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2024-05-31 06:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:15] [INFO ] [Nat]Absence check using 363 positive place invariants in 182 ms returned sat
[2024-05-31 06:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:16] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2024-05-31 06:21:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 51 ms.
[2024-05-31 06:21:16] [INFO ] Added : 0 causal constraints over 0 iterations in 174 ms. Result :sat
Minimization took 340 ms.
[2024-05-31 06:21:17] [INFO ] [Real]Absence check using 363 positive place invariants in 237 ms returned sat
[2024-05-31 06:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:18] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2024-05-31 06:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:18] [INFO ] [Nat]Absence check using 363 positive place invariants in 185 ms returned sat
[2024-05-31 06:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:19] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2024-05-31 06:21:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 52 ms.
[2024-05-31 06:21:19] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 334 ms.
[2024-05-31 06:21:20] [INFO ] [Real]Absence check using 363 positive place invariants in 243 ms returned sat
[2024-05-31 06:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:20] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-31 06:21:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:21] [INFO ] [Nat]Absence check using 363 positive place invariants in 187 ms returned sat
[2024-05-31 06:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:21] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2024-05-31 06:21:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-31 06:21:22] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 338 ms.
[2024-05-31 06:21:22] [INFO ] [Real]Absence check using 363 positive place invariants in 244 ms returned sat
[2024-05-31 06:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:23] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-05-31 06:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:23] [INFO ] [Nat]Absence check using 363 positive place invariants in 184 ms returned sat
[2024-05-31 06:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:24] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-31 06:21:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 47 ms.
[2024-05-31 06:21:24] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 337 ms.
[2024-05-31 06:21:25] [INFO ] [Real]Absence check using 363 positive place invariants in 251 ms returned sat
[2024-05-31 06:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:26] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2024-05-31 06:21:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:26] [INFO ] [Nat]Absence check using 363 positive place invariants in 195 ms returned sat
[2024-05-31 06:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:27] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2024-05-31 06:21:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-31 06:21:27] [INFO ] Added : 0 causal constraints over 0 iterations in 161 ms. Result :sat
Minimization took 362 ms.
[2024-05-31 06:21:28] [INFO ] [Real]Absence check using 363 positive place invariants in 248 ms returned sat
[2024-05-31 06:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:28] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-31 06:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:21:29] [INFO ] [Nat]Absence check using 363 positive place invariants in 179 ms returned sat
[2024-05-31 06:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:21:29] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2024-05-31 06:21:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-31 06:21:30] [INFO ] Added : 0 causal constraints over 0 iterations in 158 ms. Result :sat
Minimization took 336 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121, 121, 121] Max seen :[109, 109, 109, 109, 109, 109, 109, 109]
FORMULA Sudoku-COL-AN11-UpperBounds-15 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-14 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-13 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-11 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-07 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-04 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-02 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-00 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 31666 ms.
BK_STOP 1717136495729
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="gold2023"
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 gold2023"
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 r417-tall-171690556200306"
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 ;