fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r491-tall-167912710000109
Last Updated
May 14, 2023

About the Execution of Smart+red for Sudoku-COL-AN14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
567.663 184497.00 195344.00 736.10 196 196 196 196 196 196 196 196 196 196 196 196 196 196 196 196 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r491-tall-167912710000109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Sudoku-COL-AN14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710000109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 08:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 09:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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-AN14-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679215930376

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN14
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 08:52:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 08:52:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 08:52:12] [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.
[2023-03-19 08:52:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 08:52:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 455 ms
[2023-03-19 08:52:12] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-19 08:52:12] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-19 08:52:12] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 1 rows 4 cols
[2023-03-19 08:52:12] [INFO ] Computed 3 place invariants in 3 ms
FORMULA Sudoku-COL-AN14-UpperBounds-15 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-14 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-11 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-09 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-08 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-07 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-06 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-05 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-04 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-01 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-19 08:52:12] [INFO ] Invariant cache hit.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-19 08:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-19 08:52:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 08:52:13] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-19 08:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-19 08:52:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 08:52:13] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-19 08:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-19 08:52:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 08:52:13] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-19 08:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-19 08:52:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 08:52:13] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-19 08:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-19 08:52:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 08:52:13] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-19 08:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 08:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-19 08:52:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 08:52:13] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [196, 196, 196, 196, 196, 196]
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2023-03-19 08:52:13] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 59 ms.
[2023-03-19 08:52:13] [INFO ] Unfolded 6 HLPN properties in 3 ms.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 5141 ms. (steps per millisecond=1 ) properties (out of 6) seen :1056
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=15 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 6) seen :12
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-19 08:52:22] [INFO ] Computed 588 place invariants in 42 ms
[2023-03-19 08:52:23] [INFO ] [Real]Absence check using 588 positive place invariants in 913 ms returned sat
[2023-03-19 08:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:25] [INFO ] [Real]Absence check using state equation in 1810 ms returned sat
[2023-03-19 08:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:27] [INFO ] [Nat]Absence check using 588 positive place invariants in 696 ms returned sat
[2023-03-19 08:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:29] [INFO ] [Nat]Absence check using state equation in 1946 ms returned sat
[2023-03-19 08:52:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 152 ms.
[2023-03-19 08:52:29] [INFO ] Added : 0 causal constraints over 0 iterations in 396 ms. Result :sat
Minimization took 1351 ms.
[2023-03-19 08:52:32] [INFO ] [Real]Absence check using 588 positive place invariants in 950 ms returned sat
[2023-03-19 08:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:34] [INFO ] [Real]Absence check using state equation in 1788 ms returned sat
[2023-03-19 08:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:35] [INFO ] [Nat]Absence check using 588 positive place invariants in 704 ms returned sat
[2023-03-19 08:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:37] [INFO ] [Nat]Absence check using state equation in 2140 ms returned sat
[2023-03-19 08:52:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 163 ms.
[2023-03-19 08:52:37] [INFO ] Added : 0 causal constraints over 0 iterations in 409 ms. Result :sat
Minimization took 1232 ms.
[2023-03-19 08:52:40] [INFO ] [Real]Absence check using 588 positive place invariants in 940 ms returned sat
[2023-03-19 08:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:42] [INFO ] [Real]Absence check using state equation in 1786 ms returned sat
[2023-03-19 08:52:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:43] [INFO ] [Nat]Absence check using 588 positive place invariants in 687 ms returned sat
[2023-03-19 08:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:45] [INFO ] [Nat]Absence check using state equation in 1963 ms returned sat
[2023-03-19 08:52:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 141 ms.
[2023-03-19 08:52:45] [INFO ] Added : 0 causal constraints over 0 iterations in 361 ms. Result :sat
Minimization took 1497 ms.
[2023-03-19 08:52:48] [INFO ] [Real]Absence check using 588 positive place invariants in 945 ms returned sat
[2023-03-19 08:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:50] [INFO ] [Real]Absence check using state equation in 1804 ms returned sat
[2023-03-19 08:52:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:52:51] [INFO ] [Nat]Absence check using 588 positive place invariants in 675 ms returned sat
[2023-03-19 08:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:53] [INFO ] [Nat]Absence check using state equation in 2063 ms returned sat
[2023-03-19 08:52:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 156 ms.
[2023-03-19 08:52:54] [INFO ] Added : 0 causal constraints over 0 iterations in 425 ms. Result :sat
Minimization took 1339 ms.
[2023-03-19 08:52:57] [INFO ] [Real]Absence check using 588 positive place invariants in 949 ms returned sat
[2023-03-19 08:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:52:59] [INFO ] [Real]Absence check using state equation in 1916 ms returned sat
[2023-03-19 08:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:53:00] [INFO ] [Nat]Absence check using 588 positive place invariants in 684 ms returned sat
[2023-03-19 08:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:53:02] [INFO ] [Nat]Absence check using state equation in 1967 ms returned sat
[2023-03-19 08:53:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 221 ms.
[2023-03-19 08:53:02] [INFO ] Added : 0 causal constraints over 0 iterations in 452 ms. Result :sat
Minimization took 1366 ms.
[2023-03-19 08:53:05] [INFO ] [Real]Absence check using 588 positive place invariants in 957 ms returned sat
[2023-03-19 08:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:53:07] [INFO ] [Real]Absence check using state equation in 1777 ms returned sat
[2023-03-19 08:53:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:53:08] [INFO ] [Nat]Absence check using 588 positive place invariants in 696 ms returned sat
[2023-03-19 08:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:53:10] [INFO ] [Nat]Absence check using state equation in 1952 ms returned sat
[2023-03-19 08:53:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 127 ms.
[2023-03-19 08:53:10] [INFO ] Added : 0 causal constraints over 0 iterations in 379 ms. Result :sat
Minimization took 1465 ms.
Current structural bounds on expressions (after SMT) : [196, 196, 196, 196, 196, 196] Max seen :[176, 176, 176, 176, 176, 176]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 205 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2023-03-19 08:53:12] [INFO ] Invariant cache hit.
Finished random walk after 59742 steps, including 347 resets, run visited all 6 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 84741 steps, including 0 resets, run visited all 6 properties in 5058 ms. (steps per millisecond=16 )
Finished Best-First random walk after 79434 steps, including 0 resets, run visited all 6 properties in 5008 ms. (steps per millisecond=15 )
Finished Best-First random walk after 94374 steps, including 0 resets, run visited all 6 properties in 5012 ms. (steps per millisecond=18 )
Finished Best-First random walk after 80185 steps, including 0 resets, run visited all 6 properties in 5022 ms. (steps per millisecond=15 )
Finished Best-First random walk after 78819 steps, including 0 resets, run visited all 6 properties in 5015 ms. (steps per millisecond=15 )
Finished Best-First random walk after 87996 steps, including 0 resets, run visited all 6 properties in 5019 ms. (steps per millisecond=17 )
[2023-03-19 08:54:12] [INFO ] Invariant cache hit.
[2023-03-19 08:54:14] [INFO ] [Real]Absence check using 588 positive place invariants in 876 ms returned sat
[2023-03-19 08:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:16] [INFO ] [Real]Absence check using state equation in 2113 ms returned sat
[2023-03-19 08:54:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:54:17] [INFO ] [Nat]Absence check using 588 positive place invariants in 1022 ms returned sat
[2023-03-19 08:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:19] [INFO ] [Nat]Absence check using state equation in 1853 ms returned sat
[2023-03-19 08:54:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-19 08:54:20] [INFO ] Added : 0 causal constraints over 0 iterations in 326 ms. Result :sat
Minimization took 1889 ms.
[2023-03-19 08:54:23] [INFO ] [Real]Absence check using 588 positive place invariants in 843 ms returned sat
[2023-03-19 08:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:25] [INFO ] [Real]Absence check using state equation in 2045 ms returned sat
[2023-03-19 08:54:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:54:26] [INFO ] [Nat]Absence check using 588 positive place invariants in 1057 ms returned sat
[2023-03-19 08:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:28] [INFO ] [Nat]Absence check using state equation in 1872 ms returned sat
[2023-03-19 08:54:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 140 ms.
[2023-03-19 08:54:29] [INFO ] Added : 0 causal constraints over 0 iterations in 355 ms. Result :sat
Minimization took 1851 ms.
[2023-03-19 08:54:32] [INFO ] [Real]Absence check using 588 positive place invariants in 808 ms returned sat
[2023-03-19 08:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:34] [INFO ] [Real]Absence check using state equation in 2065 ms returned sat
[2023-03-19 08:54:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:54:35] [INFO ] [Nat]Absence check using 588 positive place invariants in 1034 ms returned sat
[2023-03-19 08:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:37] [INFO ] [Nat]Absence check using state equation in 1848 ms returned sat
[2023-03-19 08:54:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 135 ms.
[2023-03-19 08:54:38] [INFO ] Added : 0 causal constraints over 0 iterations in 359 ms. Result :sat
Minimization took 1789 ms.
[2023-03-19 08:54:41] [INFO ] [Real]Absence check using 588 positive place invariants in 834 ms returned sat
[2023-03-19 08:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:43] [INFO ] [Real]Absence check using state equation in 1894 ms returned sat
[2023-03-19 08:54:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:54:44] [INFO ] [Nat]Absence check using 588 positive place invariants in 1038 ms returned sat
[2023-03-19 08:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:46] [INFO ] [Nat]Absence check using state equation in 1824 ms returned sat
[2023-03-19 08:54:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 129 ms.
[2023-03-19 08:54:47] [INFO ] Added : 0 causal constraints over 0 iterations in 333 ms. Result :sat
Minimization took 1780 ms.
[2023-03-19 08:54:50] [INFO ] [Real]Absence check using 588 positive place invariants in 829 ms returned sat
[2023-03-19 08:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:52] [INFO ] [Real]Absence check using state equation in 2002 ms returned sat
[2023-03-19 08:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:54:53] [INFO ] [Nat]Absence check using 588 positive place invariants in 1035 ms returned sat
[2023-03-19 08:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:54:55] [INFO ] [Nat]Absence check using state equation in 1837 ms returned sat
[2023-03-19 08:54:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 124 ms.
[2023-03-19 08:54:55] [INFO ] Added : 0 causal constraints over 0 iterations in 337 ms. Result :sat
Minimization took 1795 ms.
[2023-03-19 08:54:59] [INFO ] [Real]Absence check using 588 positive place invariants in 864 ms returned sat
[2023-03-19 08:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:55:01] [INFO ] [Real]Absence check using state equation in 2032 ms returned sat
[2023-03-19 08:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:55:02] [INFO ] [Nat]Absence check using 588 positive place invariants in 1109 ms returned sat
[2023-03-19 08:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:55:04] [INFO ] [Nat]Absence check using state equation in 1936 ms returned sat
[2023-03-19 08:55:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-19 08:55:05] [INFO ] Added : 0 causal constraints over 0 iterations in 284 ms. Result :sat
Minimization took 1784 ms.
Current structural bounds on expressions (after SMT) : [196, 196, 196, 196, 196, 196] Max seen :[178, 178, 178, 178, 178, 178]
FORMULA Sudoku-COL-AN14-UpperBounds-13 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-12 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-10 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-03 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-02 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-00 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 181519 ms.
ITS solved all properties within timeout

BK_STOP 1679216114873

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-AN14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Sudoku-COL-AN14, 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 r491-tall-167912710000109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;