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-171690530400473.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Sudoku-COL-AN09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530400473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 10:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 10:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 11:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 11:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717033619102

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 01:47:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 01:47:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:47:00] [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 01:47:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 01:47:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 477 ms
[2024-05-30 01:47:00] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
[2024-05-30 01:47:00] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-30 01:47:00] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Sudoku-COL-AN09-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40168 steps (480 resets) in 299 ms. (133 steps per ms) remains 21/57 properties
BEST_FIRST walk for 4312 steps (48 resets) in 22 ms. (187 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 15 ms. (269 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 27 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 24 ms. (172 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 25 ms. (165 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 12 ms. (331 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 8 ms. (479 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 14 ms. (287 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 21 ms. (196 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 20 ms. (205 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 25 ms. (165 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 24 ms. (172 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 24 ms. (172 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 25 ms. (165 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 21 ms. (196 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 36 ms. (116 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 13 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 19 ms. (215 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 21 ms. (196 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 18 ms. (226 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4312 steps (48 resets) in 11 ms. (359 steps per ms) remains 21/21 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 01:47:01] [INFO ] Computed 3 invariants in 4 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 20 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/5 variables, 0/8 constraints. Problems are: Problem set: 20 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 8 constraints, problems are : Problem set: 20 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 20 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 20 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN09-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:47:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 01:47:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:47:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN09-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:47:01] [INFO ] Flatten gal took : 2 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-05-30 01:47:01] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 25 ms.
[2024-05-30 01:47:01] [INFO ] Unfolded 12 HLPN properties in 2 ms.
Support contains 972 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-30 01:47:01] [INFO ] Computed 243 invariants in 14 ms
[2024-05-30 01:47:02] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-30 01:47:02] [INFO ] Invariant cache hit.
[2024-05-30 01:47:02] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 972 out of 972 places after structural reductions.
[2024-05-30 01:47:02] [INFO ] Flatten gal took : 108 ms
[2024-05-30 01:47:03] [INFO ] Flatten gal took : 86 ms
[2024-05-30 01:47:03] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 40000 steps (565 resets) in 8812 ms. (4 steps per ms) remains 17/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
[2024-05-30 01:47:06] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 15 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 15 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 15 solved, 2 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 15 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 15 solved, 2 unsolved in 4976 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 8839ms problems are : Problem set: 15 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 972 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (565 resets) in 2969 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1045 ms. (38 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 220810 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 220810 steps, saw 68106 distinct states, run finished after 3004 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-30 01:47:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1424 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1701 variables, 2/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1701 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 42785 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 44392ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 281 ms.
Support contains 972 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (565 resets) in 2732 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1037 ms. (38 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266669 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266669 steps, saw 75745 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-30 01:48:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1701 variables, 1/1216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22563 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23885ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 972 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 01:48:31] [INFO ] Invariant cache hit.
[2024-05-30 01:48:31] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-30 01:48:31] [INFO ] Invariant cache hit.
[2024-05-30 01:48:32] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-30 01:48:32] [INFO ] Redundant transitions in 39 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 886 ms. Remains : 972/972 places, 729/729 transitions.
Successfully simplified 15 atomic propositions for a total of 12 simplifications.
[2024-05-30 01:48:32] [INFO ] Flatten gal took : 54 ms
[2024-05-30 01:48:32] [INFO ] Flatten gal took : 50 ms
[2024-05-30 01:48:32] [INFO ] Input system was already deterministic with 729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 24 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 38 ms
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 44 ms
[2024-05-30 01:48:33] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 20 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 243/972 places, 729/729 transitions.
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 26 ms
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 29 ms
[2024-05-30 01:48:33] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 34 ms
[2024-05-30 01:48:33] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 243/972 places, 729/729 transitions.
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 27 ms
[2024-05-30 01:48:33] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 28 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 31 ms
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 34 ms
[2024-05-30 01:48:33] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 29 ms
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 32 ms
[2024-05-30 01:48:33] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 29 ms
[2024-05-30 01:48:33] [INFO ] Flatten gal took : 32 ms
[2024-05-30 01:48:34] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 164 steps (0 resets) in 24 ms. (6 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN09-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:48:34] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 3 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 972/972 places, 729/729 transitions.
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 29 ms
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 31 ms
[2024-05-30 01:48:34] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 46 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 243/972 places, 729/729 transitions.
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 21 ms
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:48:34] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 5 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 243/972 places, 729/729 transitions.
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 20 ms
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:48:34] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 243/972 places, 729/729 transitions.
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 20 ms
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:48:34] [INFO ] Input system was already deterministic with 729 transitions.
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:48:34] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:48:34] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-05-30 01:48:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 972 places, 729 transitions and 2916 arcs took 6 ms.
Total runtime 94600 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 972
TRANSITIONS: 729
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.001s]


----------------------------------------------------------------------
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: 587
MODEL NAME: /home/mcc/execution/413/model
972 places, 729 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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
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-AN09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Sudoku-COL-AN09, examination is CTLCardinality"
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-171690530400473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN09.tgz
mv Sudoku-COL-AN09 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;