About the Execution of GreatSPN+red for Sudoku-COL-AN15
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-171690530500525.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-AN15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530500525
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 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-AN15-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717048607179
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-AN15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 05:56:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 05:56:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 05:56:48] [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 05:56:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 05:56:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 489 ms
[2024-05-30 05:56:48] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 14 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 05:56:48] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 05:56:48] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 05:56:49] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[225, 0, 225, 225] Max Struct:[225, 225, 225, 225]
FORMULA Sudoku-COL-AN15-UpperBounds-15 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-04 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-08 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-09 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-13 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-14 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-02 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-07 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-00 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 05:56:49] [INFO ] Invariant cache hit.
[2024-05-30 05:56:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-30 05:56:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-30 05:56:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-30 05:56:49] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[225]
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2024-05-30 05:56:49] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 66 ms.
[2024-05-30 05:56:49] [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:[225]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[225]
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 05:56:49] [INFO ] Computed 675 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[225]
RANDOM walk for 10000 steps (50 resets) in 2786 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 716 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[225]
[2024-05-30 05:56:52] [INFO ] Invariant cache hit.
[2024-05-30 05:56:54] [INFO ] [Real]Absence check using 675 positive place invariants in 1462 ms returned sat
[2024-05-30 05:56:57] [INFO ] [Real]Absence check using state equation in 2202 ms returned sat
[2024-05-30 05:56:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 156 ms.
[2024-05-30 05:56:57] [INFO ] Added : 0 causal constraints over 0 iterations in 461 ms. Result :sat
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 192 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 05:56:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[205] Max Struct:[225]
RANDOM walk for 110473 steps (557 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 67480 steps (0 resets) in 5001 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[225]
[2024-05-30 05:57:33] [INFO ] Invariant cache hit.
[2024-05-30 05:57:35] [INFO ] [Real]Absence check using 675 positive place invariants in 1493 ms returned sat
[2024-05-30 05:57:55] [INFO ] [Real]Absence check using state equation in 20488 ms returned sat
[2024-05-30 05:57:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 126 ms.
[2024-05-30 05:57:56] [INFO ] Added : 0 causal constraints over 0 iterations in 423 ms. Result :sat
Minimization took 4871 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 90 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 196 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 05:58:01] [INFO ] Invariant cache hit.
[2024-05-30 05:58:04] [INFO ] Implicit Places using invariants in 2504 ms returned []
[2024-05-30 05:58:04] [INFO ] Invariant cache hit.
[2024-05-30 05:58:10] [INFO ] Implicit Places using invariants and state equation in 6867 ms returned []
Implicit Place search using SMT with State Equation took 9374 ms to find 0 implicit places.
[2024-05-30 05:58:11] [INFO ] Redundant transitions in 161 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 9747 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 17187 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3451 ms. (11 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3277 ms. (12 steps per ms) remains 2/2 properties
Probabilistic random walk after 184114 steps, saw 184048 distinct states, run finished after 18017 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 05:58:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10315ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 2270 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 72 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 11430 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3248 ms. (12 steps per ms) remains 1/1 properties
Probabilistic random walk after 112467 steps, saw 112429 distinct states, run finished after 9042 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-30 05:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9571 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9503 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19459ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 56 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 49 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 05:59:20] [INFO ] Invariant cache hit.
[2024-05-30 05:59:23] [INFO ] Implicit Places using invariants in 2299 ms returned []
[2024-05-30 05:59:23] [INFO ] Invariant cache hit.
[2024-05-30 05:59:29] [INFO ] Implicit Places using invariants and state equation in 6566 ms returned []
Implicit Place search using SMT with State Equation took 8871 ms to find 0 implicit places.
[2024-05-30 05:59:30] [INFO ] Redundant transitions in 186 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 9121 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[205] Max Struct:[225]
Starting property specific reduction for Sudoku-COL-AN15-UpperBounds-01
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:[225]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[225]
[2024-05-30 05:59:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[225]
RANDOM walk for 10000 steps (50 resets) in 2836 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 771 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[202] Max Struct:[225]
[2024-05-30 05:59:33] [INFO ] Invariant cache hit.
[2024-05-30 05:59:34] [INFO ] [Real]Absence check using 675 positive place invariants in 876 ms returned sat
[2024-05-30 05:59:38] [INFO ] [Real]Absence check using state equation in 3721 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[202] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[202] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 52 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 05:59:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[202] Max Struct:[225]
RANDOM walk for 108665 steps (548 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 67413 steps (0 resets) in 5011 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[208] Max Struct:[225]
[2024-05-30 06:00:13] [INFO ] Invariant cache hit.
[2024-05-30 06:00:15] [INFO ] [Real]Absence check using 675 positive place invariants in 1145 ms returned sat
[2024-05-30 06:00:37] [INFO ] [Real]Absence check using state equation in 22422 ms returned sat
[2024-05-30 06:00:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 137 ms.
[2024-05-30 06:00:38] [INFO ] Added : 0 causal constraints over 0 iterations in 409 ms. Result :sat
Minimization took 4888 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[208] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[208] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 56 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 48 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 06:00:43] [INFO ] Invariant cache hit.
[2024-05-30 06:00:45] [INFO ] Implicit Places using invariants in 2223 ms returned []
[2024-05-30 06:00:45] [INFO ] Invariant cache hit.
[2024-05-30 06:00:52] [INFO ] Implicit Places using invariants and state equation in 6533 ms returned []
Implicit Place search using SMT with State Equation took 8763 ms to find 0 implicit places.
[2024-05-30 06:00:52] [INFO ] Redundant transitions in 97 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 8919 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 06:00:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[208] Max Struct:[225]
RANDOM walk for 109355 steps (551 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 66801 steps (0 resets) in 5029 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[208] Max Struct:[225]
[2024-05-30 06:01:27] [INFO ] Invariant cache hit.
[2024-05-30 06:01:28] [INFO ] [Real]Absence check using 675 positive place invariants in 1085 ms returned sat
[2024-05-30 06:01:51] [INFO ] [Real]Absence check using state equation in 22362 ms returned sat
[2024-05-30 06:01:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 130 ms.
[2024-05-30 06:01:51] [INFO ] Added : 0 causal constraints over 0 iterations in 398 ms. Result :sat
Minimization took 4907 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[208] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[208] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 69 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 43 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 06:01:57] [INFO ] Invariant cache hit.
[2024-05-30 06:01:59] [INFO ] Implicit Places using invariants in 2339 ms returned []
[2024-05-30 06:01:59] [INFO ] Invariant cache hit.
[2024-05-30 06:02:06] [INFO ] Implicit Places using invariants and state equation in 6742 ms returned []
Implicit Place search using SMT with State Equation took 9082 ms to find 0 implicit places.
[2024-05-30 06:02:06] [INFO ] Redundant transitions in 98 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 9229 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 14235 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3333 ms. (11 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3280 ms. (12 steps per ms) remains 2/2 properties
Probabilistic random walk after 140580 steps, saw 140532 distinct states, run finished after 15032 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 06:02:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4675 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9947ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 2390 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 42 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 11370 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3057 ms. (13 steps per ms) remains 1/1 properties
Probabilistic random walk after 113467 steps, saw 113429 distinct states, run finished after 9007 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-30 06:02:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9546 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9502 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19405ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 44 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 48 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 06:03:11] [INFO ] Invariant cache hit.
[2024-05-30 06:03:13] [INFO ] Implicit Places using invariants in 2292 ms returned []
[2024-05-30 06:03:13] [INFO ] Invariant cache hit.
[2024-05-30 06:03:20] [INFO ] Implicit Places using invariants and state equation in 7307 ms returned []
Implicit Place search using SMT with State Equation took 9601 ms to find 0 implicit places.
[2024-05-30 06:03:20] [INFO ] Redundant transitions in 102 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 9760 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[208] Max Struct:[225]
Ending property specific reduction for Sudoku-COL-AN15-UpperBounds-01 in 230953 ms.
[2024-05-30 06:03:21] [INFO ] Flatten gal took : 468 ms
[2024-05-30 06:03:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-30 06:03:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4050 places, 3375 transitions and 13500 arcs took 19 ms.
Total runtime 393285 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Sudoku-COL-AN15
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4050
TRANSITIONS: 3375
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.085s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.013s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 665
MODEL NAME: /home/mcc/execution/412/model
4050 places, 3375 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1717050998260
--------------------
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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-AN15"
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-AN15, 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-171690530500525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN15.tgz
mv Sudoku-COL-AN15 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 ;