About the Execution of GreatSPN+red for Sudoku-PT-AN11
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530800653.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-PT-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530800653
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 44M
-rw-r--r-- 1 mcc users 603K Apr 12 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 11:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 354K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 616K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 82K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 203K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 746K 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-PT-AN11-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717071771380
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 12:22:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 12:22:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:22:52] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-30 12:22:52] [INFO ] Transformed 1694 places.
[2024-05-30 12:22:52] [INFO ] Transformed 1331 transitions.
[2024-05-30 12:22:52] [INFO ] Found NUPN structural information;
[2024-05-30 12:22:52] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 24 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 121, 121, 121, 1, 1, 1, 1, 1, 1, 0, 0] Max Struct:[1331, 121, 121, 121, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-05 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-06 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-01 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[1331, 1, 1]
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 12:22:52] [INFO ] Computed 363 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1331, 1, 1]
RANDOM walk for 10000 steps (94 resets) in 1136 ms. (8 steps per ms)
FORMULA Sudoku-PT-AN11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Sudoku-PT-AN11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 311 ms. (32 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[109] Max Struct:[1331]
[2024-05-30 12:22:54] [INFO ] Invariant cache hit.
[2024-05-30 12:22:55] [INFO ] [Real]Absence check using 363 positive place invariants in 249 ms returned sat
[2024-05-30 12:22:56] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2024-05-30 12:22:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 68 ms.
[2024-05-30 12:22:56] [INFO ] Added : 0 causal constraints over 0 iterations in 222 ms. Result :sat
Minimization took 541 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[109] Max Struct:[1331]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[109] Max Struct:[1331]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 102 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 12:22:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[109] Max Struct:[1331]
RANDOM walk for 274376 steps (2596 resets) in 30001 ms. (9 steps per ms)
BEST_FIRST walk for 163826 steps (3 resets) in 5008 ms. (32 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[114] Max Struct:[1331]
[2024-05-30 12:23:32] [INFO ] Invariant cache hit.
[2024-05-30 12:23:33] [INFO ] [Real]Absence check using 363 positive place invariants in 928 ms returned sat
[2024-05-30 12:23:34] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2024-05-30 12:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:23:40] [INFO ] [Nat]Absence check using 363 positive place invariants in 1210 ms returned sat
[2024-05-30 12:23:42] [INFO ] [Nat]Absence check using state equation in 2070 ms returned sat
[2024-05-30 12:23:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 110 ms.
[2024-05-30 12:23:42] [INFO ] Added : 0 causal constraints over 0 iterations in 258 ms. Result :sat
Minimization took 5309 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[114] Max Struct:[1331]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[114] Max Struct:[1331]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 72 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 46 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 12:23:48] [INFO ] Invariant cache hit.
[2024-05-30 12:23:51] [INFO ] Implicit Places using invariants in 2963 ms returned []
[2024-05-30 12:23:51] [INFO ] Invariant cache hit.
[2024-05-30 12:23:54] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 6441 ms to find 0 implicit places.
[2024-05-30 12:23:54] [INFO ] Redundant transitions in 58 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 6562 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 12:23:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[114] Max Struct:[1331]
RANDOM walk for 282154 steps (2669 resets) in 30001 ms. (9 steps per ms)
BEST_FIRST walk for 160451 steps (3 resets) in 5001 ms. (32 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[114] Max Struct:[1331]
[2024-05-30 12:24:29] [INFO ] Invariant cache hit.
[2024-05-30 12:24:31] [INFO ] [Real]Absence check using 363 positive place invariants in 885 ms returned sat
[2024-05-30 12:24:32] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2024-05-30 12:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:24:37] [INFO ] [Nat]Absence check using 363 positive place invariants in 1196 ms returned sat
[2024-05-30 12:24:39] [INFO ] [Nat]Absence check using state equation in 2055 ms returned sat
[2024-05-30 12:24:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-30 12:24:40] [INFO ] Added : 0 causal constraints over 0 iterations in 179 ms. Result :sat
Minimization took 5317 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[114] Max Struct:[1331]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[114] Max Struct:[1331]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 12:24:45] [INFO ] Invariant cache hit.
[2024-05-30 12:24:48] [INFO ] Implicit Places using invariants in 2956 ms returned []
[2024-05-30 12:24:48] [INFO ] Invariant cache hit.
[2024-05-30 12:24:52] [INFO ] Implicit Places using invariants and state equation in 3884 ms returned []
Implicit Place search using SMT with State Equation took 6856 ms to find 0 implicit places.
[2024-05-30 12:24:52] [INFO ] Redundant transitions in 63 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 6949 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 8308 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1957 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2142 ms. (18 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 210214 steps, run timeout after 9001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 210214 steps, saw 119295 distinct states, run finished after 9008 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-30 12:25:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 1331/1331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1331 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 363/1694 variables, 363/1694 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 363/2057 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1749 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 1331/1331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1331 variables, 0/1331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1694 constraints, problems are : Problem set: 1 solved, 1 unsolved in 899 ms.
Refiners :[Domain max(s): 1331/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3227ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 33 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 5729 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1265 ms. (31 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 99310 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 99310 steps, saw 67226 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-30 12:25:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 1331/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1331 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 363/1694 variables, 363/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 363/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4000 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 1331/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1331 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 363/1694 variables, 363/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 363/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4107 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8268ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 24 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[114] Max Struct:[1331]
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-00
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1331]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1331]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1331]
[2024-05-30 12:25:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1331]
RANDOM walk for 10000 steps (95 resets) in 1043 ms. (9 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 287 ms. (34 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[110] Max Struct:[1331]
[2024-05-30 12:25:22] [INFO ] Invariant cache hit.
[2024-05-30 12:25:23] [INFO ] [Real]Absence check using 363 positive place invariants in 378 ms returned sat
[2024-05-30 12:25:24] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2024-05-30 12:25:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 66 ms.
[2024-05-30 12:25:24] [INFO ] Added : 0 causal constraints over 0 iterations in 185 ms. Result :sat
Minimization took 535 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[110] Max Struct:[1331]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[110] Max Struct:[1331]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 33 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 12:25:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[110] Max Struct:[1331]
RANDOM walk for 272888 steps (2582 resets) in 30001 ms. (9 steps per ms)
BEST_FIRST walk for 170608 steps (4 resets) in 5002 ms. (34 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[1331]
[2024-05-30 12:26:00] [INFO ] Invariant cache hit.
[2024-05-30 12:26:01] [INFO ] [Real]Absence check using 363 positive place invariants in 340 ms returned sat
[2024-05-30 12:26:02] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2024-05-30 12:26:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-30 12:26:02] [INFO ] Added : 0 causal constraints over 0 iterations in 184 ms. Result :sat
Minimization took 5237 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[1331]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[113] Max Struct:[1331]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 21 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 12:26:07] [INFO ] Invariant cache hit.
[2024-05-30 12:26:10] [INFO ] Implicit Places using invariants in 2878 ms returned []
[2024-05-30 12:26:10] [INFO ] Invariant cache hit.
[2024-05-30 12:26:14] [INFO ] Implicit Places using invariants and state equation in 3764 ms returned []
Implicit Place search using SMT with State Equation took 6645 ms to find 0 implicit places.
[2024-05-30 12:26:14] [INFO ] Redundant transitions in 32 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 6707 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 12:26:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[113] Max Struct:[1331]
RANDOM walk for 272102 steps (2574 resets) in 30001 ms. (9 steps per ms)
BEST_FIRST walk for 186554 steps (4 resets) in 5006 ms. (37 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[1331]
[2024-05-30 12:26:49] [INFO ] Invariant cache hit.
[2024-05-30 12:26:49] [INFO ] [Real]Absence check using 363 positive place invariants in 363 ms returned sat
[2024-05-30 12:26:50] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2024-05-30 12:26:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 52 ms.
[2024-05-30 12:26:51] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 5296 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[1331]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[113] Max Struct:[1331]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 12:26:56] [INFO ] Invariant cache hit.
[2024-05-30 12:26:59] [INFO ] Implicit Places using invariants in 2876 ms returned []
[2024-05-30 12:26:59] [INFO ] Invariant cache hit.
[2024-05-30 12:27:03] [INFO ] Implicit Places using invariants and state equation in 3784 ms returned []
Implicit Place search using SMT with State Equation took 6670 ms to find 0 implicit places.
[2024-05-30 12:27:03] [INFO ] Redundant transitions in 23 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 6729 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 5826 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1612 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1327 ms. (30 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 151042 steps, run timeout after 6019 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 151042 steps, saw 101210 distinct states, run finished after 6019 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-30 12:27:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 1331/1331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1331 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/3025 variables, and 1694 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1199 ms.
Refiners :[Domain max(s): 1331/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 1331/1331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1331 variables, 0/1331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 363/1694 variables, 363/1694 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 363/2057 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1740 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3121ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 114 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 6 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[113] Max Struct:[1331]
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-00 in 113204 ms.
[2024-05-30 12:27:15] [INFO ] Flatten gal took : 154 ms
[2024-05-30 12:27:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-30 12:27:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 10 ms.
Total runtime 262632 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Sudoku-PT-AN11
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: 1694
TRANSITIONS: 1331
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.008s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 650
MODEL NAME: /home/mcc/execution/412/model
1694 places, 1331 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 1717074396583
--------------------
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-PT-AN11"
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-PT-AN11, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530800653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;