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.r536-tall-171690532400481.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 ltsminxred
Input is Sudoku-COL-AN10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532400481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.2K Apr 12 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 10:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 10:11 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:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 10:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 10:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-AN10-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717259696970

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:34:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:34:58] [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-06-01 16:34:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:34:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 525 ms
[2024-06-01 16:34:58] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
[2024-06-01 16:34:58] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 16:34:58] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN10-CTLCardinality-2024-06 FALSE 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).
AF dead knowledge conclusive for 2 formulas.
FORMULA Sudoku-COL-AN10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 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 40388 steps (392 resets) in 291 ms. (138 steps per ms) remains 14/66 properties
BEST_FIRST walk for 40388 steps (392 resets) in 127 ms. (315 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 136 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 125 ms. (320 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 135 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 94 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 117 ms. (342 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 111 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 117 ms. (342 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 114 ms. (351 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 99 ms. (403 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 117 ms. (342 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 105 ms. (381 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 63 ms. (631 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40388 steps (392 resets) in 105 ms. (381 steps per ms) remains 14/14 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 16:34:59] [INFO ] Computed 3 invariants in 4 ms
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 11 solved, 3 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/10 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/10 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/5 variables, 0/10 constraints. Problems are: Problem set: 11 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 10 constraints, problems are : Problem set: 11 solved, 3 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 11 solved, 3 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 16 ms.
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:35:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 16:35:00] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-COL-AN10-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:35:00] [INFO ] Flatten gal took : 2 ms
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2024-06-01 16:35:00] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 31 ms.
[2024-06-01 16:35:00] [INFO ] Unfolded 10 HLPN properties in 3 ms.
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-06-01 16:35:00] [INFO ] Computed 300 invariants in 28 ms
[2024-06-01 16:35:00] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-06-01 16:35:00] [INFO ] Invariant cache hit.
[2024-06-01 16:35:01] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1122 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 1157 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2024-06-01 16:35:01] [INFO ] Flatten gal took : 130 ms
[2024-06-01 16:35:02] [INFO ] Flatten gal took : 108 ms
[2024-06-01 16:35:02] [INFO ] Input system was already deterministic with 1000 transitions.
RANDOM walk for 40000 steps (457 resets) in 8730 ms. (4 steps per ms) remains 12/54 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1051 ms. (38 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 450 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 947 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 892 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1078 ms. (37 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1016 ms. (39 steps per ms) remains 12/12 properties
[2024-06-01 16:35:06] [INFO ] Invariant cache hit.
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1300 variables, 300/300 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 200/200 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 12260ms problems are : Problem set: 7 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 42 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 4826 ms. (8 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 850 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 109499 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 5
Probabilistic random walk after 109499 steps, saw 55509 distinct states, run finished after 3004 ms. (steps per millisecond=36 ) properties seen :0
[2024-06-01 16:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5816 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1605 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 51192ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 54 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 29 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-06-01 16:36:15] [INFO ] Invariant cache hit.
[2024-06-01 16:36:15] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-01 16:36:15] [INFO ] Invariant cache hit.
[2024-06-01 16:36:16] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2024-06-01 16:36:16] [INFO ] Redundant transitions in 53 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 1498 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
[2024-06-01 16:36:16] [INFO ] Flatten gal took : 65 ms
[2024-06-01 16:36:17] [INFO ] Flatten gal took : 69 ms
[2024-06-01 16:36:17] [INFO ] Input system was already deterministic with 1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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-AN10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:17] [INFO ] Flatten gal took : 49 ms
[2024-06-01 16:36:17] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:36:17] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:17] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:36:17] [INFO ] Flatten gal took : 72 ms
[2024-06-01 16:36:17] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 63 ms
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 63 ms
[2024-06-01 16:36:18] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 38 ms
[2024-06-01 16:36:18] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 38 ms
[2024-06-01 16:36:18] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 9 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:36:18] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 39 ms
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:36:18] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 26 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:18] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:36:19] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:36:19] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2024-06-01 16:36:19] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:36:19] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:36:19] [INFO ] Input system was already deterministic with 1000 transitions.
[2024-06-01 16:36:19] [INFO ] Flatten gal took : 47 ms
[2024-06-01 16:36:19] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:36:19] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 10 ms.
[2024-06-01 16:36:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1300 places, 1000 transitions and 4000 arcs took 12 ms.
Total runtime 81433 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-01
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-02
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-03
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-04
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-07
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-09
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-10
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-11
Could not compute solution for formula : Sudoku-COL-AN10-CTLCardinality-2024-14

BK_STOP 1717259779970

--------------------
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
mcc2024
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/543/ctl_0_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/543/ctl_1_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/543/ctl_2_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/543/ctl_3_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/543/ctl_4_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/543/ctl_5_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/543/ctl_6_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/543/ctl_7_
ctl formula name Sudoku-COL-AN10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/543/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-AN10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-COL-AN10, 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 r536-tall-171690532400481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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