fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690530400477
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Sudoku-COL-AN09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2227.787 252886.00 281077.00 700.70 81 81 81 81 81 81 81 81 81 81 81 81 81 81 81 81 normal

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.r399-tall-171690530400477.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 greatspnxred
Input is Sudoku-COL-AN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530400477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 10:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 10:06 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 28K 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 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 11:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 11:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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-AN09-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717036638110

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 02:37:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 02:37:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:37:19] [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-30 02:37:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 02:37:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 481 ms
[2024-05-30 02:37:19] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-05-30 02:37:19] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 02:37:19] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 02:37:19] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 81, 81, 81] Max Struct:[81, 81, 81, 81]
FORMULA Sudoku-COL-AN09-UpperBounds-15 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-12 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-05 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-03 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-02 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-08 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-09 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 02:37:19] [INFO ] Invariant cache hit.
[2024-05-30 02:37:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 02:37:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-30 02:37:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 02:37:20] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[81]
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-05-30 02:37:20] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 34 ms.
[2024-05-30 02:37:20] [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:[81]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[81]
// Phase 1: matrix 729 rows 972 cols
[2024-05-30 02:37:20] [INFO ] Computed 243 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (141 resets) in 582 ms. (17 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 145 ms. (68 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[81]
[2024-05-30 02:37:20] [INFO ] Invariant cache hit.
[2024-05-30 02:37:21] [INFO ] [Real]Absence check using 243 positive place invariants in 154 ms returned sat
[2024-05-30 02:37:21] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2024-05-30 02:37:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-30 02:37:22] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :sat
Minimization took 648 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 62 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 02:37:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[81]
RANDOM walk for 554427 steps (7866 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 317814 steps (19 resets) in 5001 ms. (63 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77] Max Struct:[81]
[2024-05-30 02:37:57] [INFO ] Invariant cache hit.
[2024-05-30 02:37:58] [INFO ] [Real]Absence check using 243 positive place invariants in 179 ms returned sat
[2024-05-30 02:37:58] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2024-05-30 02:37:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-30 02:37:59] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Minimization took 5203 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 30 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 79 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 02:38:04] [INFO ] Invariant cache hit.
[2024-05-30 02:38:04] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-30 02:38:04] [INFO ] Invariant cache hit.
[2024-05-30 02:38:06] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
[2024-05-30 02:38:06] [INFO ] Redundant transitions in 34 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 1735 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 02:38:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[77] Max Struct:[81]
RANDOM walk for 567909 steps (8061 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 369628 steps (23 resets) in 5004 ms. (73 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[81]
[2024-05-30 02:38:41] [INFO ] Invariant cache hit.
[2024-05-30 02:38:41] [INFO ] [Real]Absence check using 243 positive place invariants in 195 ms returned sat
[2024-05-30 02:38:41] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2024-05-30 02:38:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-30 02:38:42] [INFO ] Added : 0 causal constraints over 0 iterations in 103 ms. Result :sat
Minimization took 5227 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[78] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 77 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 02:38:47] [INFO ] Invariant cache hit.
[2024-05-30 02:38:47] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-30 02:38:47] [INFO ] Invariant cache hit.
[2024-05-30 02:38:48] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2024-05-30 02:38:48] [INFO ] Redundant transitions in 10 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1633 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 02:38:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[78] Max Struct:[81]
RANDOM walk for 568911 steps (8071 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 367077 steps (23 resets) in 5005 ms. (73 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[81]
[2024-05-30 02:39:23] [INFO ] Invariant cache hit.
[2024-05-30 02:39:24] [INFO ] [Real]Absence check using 243 positive place invariants in 195 ms returned sat
[2024-05-30 02:39:24] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-05-30 02:39:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-30 02:39:24] [INFO ] Added : 0 causal constraints over 0 iterations in 108 ms. Result :sat
Minimization took 5264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[78] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 02:39:30] [INFO ] Invariant cache hit.
[2024-05-30 02:39:30] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-30 02:39:30] [INFO ] Invariant cache hit.
[2024-05-30 02:39:31] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2024-05-30 02:39:31] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1536 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (565 resets) in 3553 ms. (11 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 912 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 895 ms. (44 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 135798 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 2
Probabilistic random walk after 135798 steps, saw 53494 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-30 02:39:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4394 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 6321ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 3157 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 694 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 686 ms. (58 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 131697 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 131697 steps, saw 52817 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-30 02:39:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 2/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27483 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 29167ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 02:40:16] [INFO ] Invariant cache hit.
[2024-05-30 02:40:16] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-30 02:40:16] [INFO ] Invariant cache hit.
[2024-05-30 02:40:17] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
[2024-05-30 02:40:17] [INFO ] Redundant transitions in 10 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1508 ms. Remains : 972/972 places, 729/729 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[78] Max Struct:[81]
Starting property specific reduction for Sudoku-COL-AN09-UpperBounds-00
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:[81]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[81]
[2024-05-30 02:40:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (142 resets) in 550 ms. (18 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 168 ms. (59 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[75] Max Struct:[81]
[2024-05-30 02:40:18] [INFO ] Invariant cache hit.
[2024-05-30 02:40:18] [INFO ] [Real]Absence check using 243 positive place invariants in 120 ms returned sat
[2024-05-30 02:40:19] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-30 02:40:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-30 02:40:19] [INFO ] Added : 0 causal constraints over 0 iterations in 114 ms. Result :sat
Minimization took 623 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[75] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[75] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 02:40:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[75] Max Struct:[81]
RANDOM walk for 547871 steps (7771 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 304085 steps (19 resets) in 5001 ms. (60 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[81]
[2024-05-30 02:40:54] [INFO ] Invariant cache hit.
[2024-05-30 02:40:55] [INFO ] [Real]Absence check using 243 positive place invariants in 283 ms returned sat
[2024-05-30 02:40:55] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2024-05-30 02:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 02:40:56] [INFO ] [Nat]Absence check using 243 positive place invariants in 169 ms returned sat
[2024-05-30 02:40:56] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2024-05-30 02:40:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-30 02:40:56] [INFO ] Added : 0 causal constraints over 0 iterations in 95 ms. Result :sat
Minimization took 1965 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[81] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 02:40:59] [INFO ] Invariant cache hit.
[2024-05-30 02:40:59] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-30 02:40:59] [INFO ] Invariant cache hit.
[2024-05-30 02:41:00] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2024-05-30 02:41:00] [INFO ] Redundant transitions in 9 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 1576 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 02:41:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[81] Max Struct:[81]
FORMULA Sudoku-COL-AN09-UpperBounds-04 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-10 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-11 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-13 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-14 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-00 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 753923 steps (10699 resets) in 30001 ms. (25 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Sudoku-COL-AN09-UpperBounds-00 in 72965 ms.
[2024-05-30 02:41:30] [INFO ] Flatten gal took : 137 ms
Total runtime 251653 ms.
ITS solved all properties within timeout

BK_STOP 1717036890996

--------------------
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-AN09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-COL-AN09, 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 r399-tall-171690530400477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN09.tgz
mv Sudoku-COL-AN09 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 ;