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-171690530500529.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-AN16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530500529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.5K Apr 12 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 10:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 10:23 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.6K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717048890105

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-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:01:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 06:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:01:31] [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 06:01:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 06:01:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 488 ms
[2024-05-30 06:01:31] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4864 PT places and 4096.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:01:31] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-30 06:01:31] [INFO ] Skeletonized 15 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 3 formulas.
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 13 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 40244 steps (152 resets) in 146 ms. (273 steps per ms) remains 16/54 properties
BEST_FIRST walk for 4124 steps (12 resets) in 10 ms. (374 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 9 ms. (412 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 10 ms. (374 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 12 ms. (317 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 12 ms. (317 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 9 ms. (412 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 7 ms. (515 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 9 ms. (412 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 7 ms. (515 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 10 ms. (374 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 5 ms. (687 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 8 ms. (458 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 7 ms. (515 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 10 ms. (374 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 6 ms. (589 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4124 steps (12 resets) in 9 ms. (412 steps per ms) remains 16/16 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 06:01:32] [INFO ] Computed 3 invariants in 5 ms
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 11 solved, 5 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 5/12 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/12 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/5 variables, 0/12 constraints. Problems are: Problem set: 11 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 12 constraints, problems are : Problem set: 11 solved, 5 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 5/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 11 solved, 5 unsolved
Finished Parikh walk after 197 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 192 ms.
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:01:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 06:01:32] [INFO ] Flatten gal took : 13 ms
[2024-05-30 06:01:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:01:32] [INFO ] Flatten gal took : 2 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2024-05-30 06:01:32] [INFO ] Unfolded HLPN to a Petri net with 4864 places and 4096 transitions 16384 arcs in 61 ms.
[2024-05-30 06:01:32] [INFO ] Unfolded 9 HLPN properties in 7 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 47 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-30 06:01:33] [INFO ] Computed 768 invariants in 65 ms
[2024-05-30 06:01:34] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2024-05-30 06:01:34] [INFO ] Invariant cache hit.
[2024-05-30 06:01:44] [INFO ] Implicit Places using invariants and state equation in 9879 ms returned []
Implicit Place search using SMT with State Equation took 10976 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 11042 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2024-05-30 06:01:44] [INFO ] Flatten gal took : 364 ms
[2024-05-30 06:01:45] [INFO ] Flatten gal took : 259 ms
[2024-05-30 06:01:46] [INFO ] Input system was already deterministic with 4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 21398 ms. (1 steps per ms) remains 10/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2366 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6461 ms. (6 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1600 ms. (24 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3782 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 765 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 757 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 749 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1307 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 761 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2020 ms. (19 steps per ms) remains 10/10 properties
[2024-05-30 06:01:57] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp19 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 5 solved, 5 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11878ms problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 768 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.10 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 89 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 768/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 11851 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 744 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 731 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 766 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 740 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2052 ms. (19 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 187350 steps, run timeout after 12008 ms. (steps per millisecond=15 ) properties seen :0 out of 5
Probabilistic random walk after 187350 steps, saw 187293 distinct states, run finished after 12012 ms. (steps per millisecond=15 ) properties seen :0
// Phase 1: matrix 4096 rows 768 cols
[2024-05-30 06:02:26] [INFO ] Computed 47 invariants in 510 ms
Problem AtomicPropp31 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4096/4864 variables, 768/815 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4864 variables, 0/815 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/4864 variables, 0/815 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4864/4864 variables, and 815 constraints, problems are : Problem set: 1 solved, 4 unsolved in 10481 ms.
Refiners :[Generalized P Invariants (flows): 47/47 constraints, State Equation: 768/768 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 256/768 variables, 42/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4096/4864 variables, 768/815 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4864 variables, 0/815 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/4864 variables, 0/815 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4864/4864 variables, and 815 constraints, problems are : Problem set: 1 solved, 4 unsolved in 7408 ms.
Refiners :[Generalized P Invariants (flows): 47/47 constraints, State Equation: 768/768 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 18679ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 251 steps, including 0 resets, run visited all 4 properties in 27 ms. (steps per millisecond=9 )
Parikh walk visited 4 properties in 27 ms.
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
[2024-05-30 06:02:44] [INFO ] Flatten gal took : 200 ms
[2024-05-30 06:02:45] [INFO ] Flatten gal took : 209 ms
[2024-05-30 06:02:46] [INFO ] Input system was already deterministic with 4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 2 formulas.
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 16 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 06:02:46] [INFO ] Flatten gal took : 149 ms
[2024-05-30 06:02:46] [INFO ] Flatten gal took : 166 ms
[2024-05-30 06:02:46] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 154 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 06:02:47] [INFO ] Flatten gal took : 150 ms
[2024-05-30 06:02:47] [INFO ] Flatten gal took : 160 ms
[2024-05-30 06:02:47] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 29 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 06:02:47] [INFO ] Flatten gal took : 138 ms
[2024-05-30 06:02:47] [INFO ] Flatten gal took : 152 ms
[2024-05-30 06:02:48] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 06:02:48] [INFO ] Flatten gal took : 134 ms
[2024-05-30 06:02:48] [INFO ] Flatten gal took : 150 ms
[2024-05-30 06:02:48] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 36 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 06:02:48] [INFO ] Flatten gal took : 140 ms
[2024-05-30 06:02:49] [INFO ] Flatten gal took : 153 ms
[2024-05-30 06:02:49] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 10 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 06:02:49] [INFO ] Flatten gal took : 147 ms
[2024-05-30 06:02:49] [INFO ] Flatten gal took : 161 ms
[2024-05-30 06:02:50] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 75 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 06:02:50] [INFO ] Flatten gal took : 132 ms
[2024-05-30 06:02:50] [INFO ] Flatten gal took : 143 ms
[2024-05-30 06:02:50] [INFO ] Input system was already deterministic with 4096 transitions.
[2024-05-30 06:02:50] [INFO ] Flatten gal took : 180 ms
[2024-05-30 06:02:51] [INFO ] Flatten gal took : 183 ms
[2024-05-30 06:02:51] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 26 ms.
[2024-05-30 06:02:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 20 ms.
Total runtime 80438 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN16

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: 4864
TRANSITIONS: 4096
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.092s, Sys 0.010s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.016s, 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: 580
MODEL NAME: /home/mcc/execution/413/model
4864 places, 4096 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 1717051903404

--------------------
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

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-AN16"
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-AN16, 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-171690530500529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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