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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.0K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:50 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 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:11 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 146K 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-BN09-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717052030084

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-BN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:53:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 06:53:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:53:51] [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:53:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 06:53:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 670 ms
[2024-05-30 06:53:52] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-30 06:53:52] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2024-05-30 06:53:52] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-BN09-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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-BN09-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 301 ms. (133 steps per ms) remains 26/70 properties
BEST_FIRST walk for 4312 steps (48 resets) in 15 ms. (269 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 23 ms. (179 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 26 ms. (159 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 23 ms. (179 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 12 ms. (331 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 24 ms. (172 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 13 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 19 ms. (215 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 23 ms. (179 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 8 ms. (479 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 7 ms. (539 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 16 ms. (253 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 17 ms. (239 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 22 ms. (187 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 13 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 17 ms. (239 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 12 ms. (331 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 23 ms. (179 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 11 ms. (359 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 10 ms. (392 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 24 ms. (172 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 17 ms. (239 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 11 ms. (359 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 25 ms. (165 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 19 ms. (215 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4312 steps (48 resets) in 11 ms. (359 steps per ms) remains 26/26 properties
// Phase 1: matrix 1 rows 5 cols
[2024-05-30 06:53:52] [INFO ] Computed 4 invariants in 5 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 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 AtomicPropp50 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 4/4 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 5/9 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/6 variables, 0/9 constraints. Problems are: Problem set: 25 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 9 constraints, problems are : Problem set: 25 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 2/2 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/5 variables, 2/4 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 5/9 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 1/10 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/10 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6 variables, 0/10 constraints. Problems are: Problem set: 25 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 10 constraints, problems are : Problem set: 25 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 25 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 25 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-BN09-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:53:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 06:53:52] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-COL-BN09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:53:52] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-05-30 06:53:52] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 42 ms.
[2024-05-30 06:53:52] [INFO ] Unfolded 10 HLPN properties in 3 ms.
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-30 06:53:53] [INFO ] Computed 324 invariants in 35 ms
[2024-05-30 06:53:53] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-30 06:53:53] [INFO ] Invariant cache hit.
[2024-05-30 06:53:54] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1005 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 1036 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2024-05-30 06:53:54] [INFO ] Flatten gal took : 126 ms
[2024-05-30 06:53:54] [INFO ] Flatten gal took : 98 ms
[2024-05-30 06:53:54] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 40000 steps (602 resets) in 9972 ms. (4 steps per ms) remains 20/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 239 ms. (16 steps per ms) remains 20/20 properties
[2024-05-30 06:53:58] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1053 variables, 324/324 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 17 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 17 solved, 3 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 162/162 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 0/162 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 162/1053 variables, 162/324 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 17 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1380 constraints, problems are : Problem set: 17 solved, 3 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 3/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 11893ms problems are : Problem set: 17 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 46 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1053/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (601 resets) in 4352 ms. (9 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 991 ms. (40 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 180807 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 3
Probabilistic random walk after 180807 steps, saw 58678 distinct states, run finished after 3007 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-30 06:54:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 162/1053 variables, 162/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2142 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 162/1053 variables, 162/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1782 variables, 3/1380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43657 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 45984ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=11 )
Parikh walk visited 3 properties in 8 ms.
Successfully simplified 17 atomic propositions for a total of 10 simplifications.
[2024-05-30 06:55:00] [INFO ] Flatten gal took : 59 ms
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 57 ms
[2024-05-30 06:55:01] [INFO ] Input system was already deterministic with 729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 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 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 32 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 47 ms
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 49 ms
[2024-05-30 06:55:01] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 41 ms
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 43 ms
[2024-05-30 06:55:01] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.17 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 55 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 324/1053 places, 729/729 transitions.
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 32 ms
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 66 ms
[2024-05-30 06:55:01] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 196 steps (0 resets) in 38 ms. (5 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-BN09-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 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 22 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 324/1053 places, 729/729 transitions.
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 31 ms
[2024-05-30 06:55:01] [INFO ] Flatten gal took : 33 ms
[2024-05-30 06:55:02] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 44 steps (0 resets) in 11 ms. (3 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-BN09-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 38 ms
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 40 ms
[2024-05-30 06:55:02] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 33 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 43 ms
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 72 ms
[2024-05-30 06:55:02] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 34 ms
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 61 ms
[2024-05-30 06:55:02] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 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 324 transition count 729
Applied a total of 729 rules in 19 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 324/1053 places, 729/729 transitions.
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 27 ms
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 29 ms
[2024-05-30 06:55:02] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 32 ms
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 35 ms
[2024-05-30 06:55:02] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 06:55:02] [INFO ] Flatten gal took : 33 ms
[2024-05-30 06:55:03] [INFO ] Flatten gal took : 35 ms
[2024-05-30 06:55:03] [INFO ] Input system was already deterministic with 729 transitions.
[2024-05-30 06:55:03] [INFO ] Flatten gal took : 40 ms
[2024-05-30 06:55:03] [INFO ] Flatten gal took : 41 ms
[2024-05-30 06:55:03] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-05-30 06:55:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 9 ms.
Total runtime 71944 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-BN09

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/421/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 577
MODEL NAME: /home/mcc/execution/421/model
1053 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717055161671

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

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