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-171690532600563.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-BN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532600563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.6K Apr 12 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:54 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 4.0K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 13:57 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 446K 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-BN16-LTLCardinality-00
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-01
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-02
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-03
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-04
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-05
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-06
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-07
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-08
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-09
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-10
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-11
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-12
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-13
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-14
FORMULA_NAME Sudoku-COL-BN16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717267023963

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:37:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 18:37:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:37:05] [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 18:37:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:37:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 705 ms
[2024-06-01 18:37:05] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5120 PT places and 65536.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 18:37:06] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2024-06-01 18:37:06] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-BN16-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-14 FALSE 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).
Remains 12 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 40244 steps (152 resets) in 222 ms. (180 steps per ms) remains 8/21 properties
BEST_FIRST walk for 40244 steps (152 resets) in 78 ms. (509 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40244 steps (152 resets) in 57 ms. (693 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40244 steps (152 resets) in 60 ms. (659 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40244 steps (152 resets) in 12 ms. (3095 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40244 steps (152 resets) in 26 ms. (1490 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40244 steps (152 resets) in 27 ms. (1437 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40244 steps (152 resets) in 29 ms. (1341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40244 steps (152 resets) in 12 ms. (3095 steps per ms) remains 8/8 properties
// Phase 1: matrix 1 rows 5 cols
[2024-06-01 18:37:06] [INFO ] Computed 4 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 5/6 variables, and 4 constraints, problems are : Problem set: 8 solved, 0 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-BN16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 18:37:06] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 18:37:06] [INFO ] Flatten gal took : 12 ms
[2024-06-01 18:37:06] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-BN16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 18:37:06] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2024-06-01 18:37:07] [INFO ] Unfolded HLPN to a Petri net with 5120 places and 4096 transitions 20480 arcs in 127 ms.
[2024-06-01 18:37:07] [INFO ] Unfolded 7 HLPN properties in 3 ms.
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 44 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 18:37:07] [INFO ] Computed 1024 invariants in 66 ms
[2024-06-01 18:37:08] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2024-06-01 18:37:08] [INFO ] Invariant cache hit.
[2024-06-01 18:37:20] [INFO ] Implicit Places using invariants and state equation in 11940 ms returned []
Implicit Place search using SMT with State Equation took 13431 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 13498 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 5120 out of 5120 places after structural reductions.
[2024-06-01 18:37:21] [INFO ] Flatten gal took : 441 ms
[2024-06-01 18:37:21] [INFO ] Flatten gal took : 297 ms
[2024-06-01 18:37:22] [INFO ] Input system was already deterministic with 4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 18297 ms. (2 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1186 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1751 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1094 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3184 ms. (12 steps per ms) remains 4/4 properties
[2024-06-01 18:37:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4779 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3968 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9134ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1024 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.16 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 101 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 1024/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 15509 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 891 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 847 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2986 ms. (13 steps per ms) remains 3/3 properties
Probabilistic random walk after 261747 steps, saw 261661 distinct states, run finished after 15020 ms. (steps per millisecond=17 ) properties seen :0
// Phase 1: matrix 4096 rows 1024 cols
[2024-06-01 18:37:59] [INFO ] Computed 168 invariants in 852 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4096/5120 variables, 1024/1192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5120 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/5120 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5120/5120 variables, and 1192 constraints, problems are : Problem set: 0 solved, 3 unsolved in 21603 ms.
Refiners :[Generalized P Invariants (flows): 168/168 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/5120 variables, and 1192 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27847 ms.
Refiners :[Generalized P Invariants (flows): 168/168 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 50526ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 33 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:38:49] [INFO ] Invariant cache hit.
[2024-06-01 18:38:49] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 18:38:49] [INFO ] Invariant cache hit.
[2024-06-01 18:41:29] [INFO ] Implicit Places using invariants and state equation in 160042 ms returned []
Implicit Place search using SMT with State Equation took 160261 ms to find 0 implicit places.
[2024-06-01 18:41:30] [INFO ] Redundant transitions in 254 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 160555 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 212 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 18:41:30] [INFO ] Computed 1024 invariants in 30 ms
[2024-06-01 18:41:33] [INFO ] Implicit Places using invariants in 2774 ms returned []
[2024-06-01 18:41:33] [INFO ] Invariant cache hit.
[2024-06-01 18:41:49] [INFO ] Implicit Places using invariants and state equation in 15745 ms returned []
Implicit Place search using SMT with State Equation took 18535 ms to find 0 implicit places.
[2024-06-01 18:41:49] [INFO ] Redundant transitions in 248 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19013 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-01
Stuttering criterion allowed to conclude after 210 steps with 0 reset in 138 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-01 finished in 19464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 192 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:41:49] [INFO ] Invariant cache hit.
[2024-06-01 18:41:56] [INFO ] Implicit Places using invariants in 7012 ms returned []
[2024-06-01 18:41:56] [INFO ] Invariant cache hit.
[2024-06-01 18:42:14] [INFO ] Implicit Places using invariants and state equation in 17131 ms returned []
Implicit Place search using SMT with State Equation took 24149 ms to find 0 implicit places.
[2024-06-01 18:42:14] [INFO ] Redundant transitions in 169 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24524 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-02
Product exploration timeout after 19060 steps with 90 reset in 10004 ms.
Product exploration timeout after 19040 steps with 89 reset in 10003 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 516 steps (0 resets) in 376 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
[2024-06-01 18:42:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 83 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:42:54] [INFO ] Invariant cache hit.
[2024-06-01 18:43:01] [INFO ] Implicit Places using invariants in 6992 ms returned []
[2024-06-01 18:43:01] [INFO ] Invariant cache hit.
[2024-06-01 18:43:18] [INFO ] Implicit Places using invariants and state equation in 17142 ms returned []
Implicit Place search using SMT with State Equation took 24147 ms to find 0 implicit places.
[2024-06-01 18:43:18] [INFO ] Redundant transitions in 173 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24413 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 516 steps (0 resets) in 370 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-06-01 18:43:22] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration timeout after 18240 steps with 86 reset in 10002 ms.
Product exploration timeout after 18180 steps with 86 reset in 10005 ms.
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 69 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:43:57] [INFO ] Invariant cache hit.
[2024-06-01 18:44:04] [INFO ] Implicit Places using invariants in 6849 ms returned []
[2024-06-01 18:44:04] [INFO ] Invariant cache hit.
[2024-06-01 18:44:21] [INFO ] Implicit Places using invariants and state equation in 16888 ms returned []
Implicit Place search using SMT with State Equation took 23740 ms to find 0 implicit places.
[2024-06-01 18:44:21] [INFO ] Redundant transitions in 176 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23993 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-02 finished in 152761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U G(p1)))'
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 32 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:44:22] [INFO ] Invariant cache hit.
[2024-06-01 18:44:28] [INFO ] Implicit Places using invariants in 5991 ms returned []
[2024-06-01 18:44:28] [INFO ] Invariant cache hit.
[2024-06-01 18:44:44] [INFO ] Implicit Places using invariants and state equation in 16469 ms returned []
Implicit Place search using SMT with State Equation took 22464 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 22501 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-04
Product exploration timeout after 9410 steps with 2165 reset in 10020 ms.
Product exploration timeout after 9270 steps with 2128 reset in 10004 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 38 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 18:45:10] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 36 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:45:25] [INFO ] Invariant cache hit.
[2024-06-01 18:45:32] [INFO ] Implicit Places using invariants in 6469 ms returned []
[2024-06-01 18:45:32] [INFO ] Invariant cache hit.
[2024-06-01 18:45:47] [INFO ] Implicit Places using invariants and state equation in 15850 ms returned []
Implicit Place search using SMT with State Equation took 22323 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 22365 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 37 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 18:45:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration timeout after 9340 steps with 2115 reset in 10001 ms.
Product exploration timeout after 9590 steps with 2186 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 227 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:46:28] [INFO ] Redundant transitions in 167 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 27 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:46:28] [INFO ] Invariant cache hit.
[2024-06-01 18:46:35] [INFO ] Implicit Places using invariants in 6286 ms returned []
[2024-06-01 18:46:35] [INFO ] Invariant cache hit.
[2024-06-01 18:46:51] [INFO ] Implicit Places using invariants and state equation in 16688 ms returned []
Implicit Place search using SMT with State Equation took 22991 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 23024 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-04 finished in 149813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 512 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 369 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-06-01 18:46:53] [INFO ] Computed 168 invariants in 671 ms
[2024-06-01 18:46:54] [INFO ] Implicit Places using invariants in 1576 ms returned []
[2024-06-01 18:46:54] [INFO ] Invariant cache hit.
[2024-06-01 18:49:34] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160032 ms
Implicit Place search using SMT with State Equation took 161618 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161989 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-05
Product exploration timeout after 17610 steps with 8805 reset in 10005 ms.
Product exploration timeout after 17500 steps with 8750 reset in 10001 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN16-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN16-LTLCardinality-05 finished in 183483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 78 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 18:49:55] [INFO ] Computed 1024 invariants in 39 ms
[2024-06-01 18:49:58] [INFO ] Implicit Places using invariants in 2782 ms returned []
[2024-06-01 18:49:58] [INFO ] Invariant cache hit.
[2024-06-01 18:50:14] [INFO ] Implicit Places using invariants and state equation in 16023 ms returned []
Implicit Place search using SMT with State Equation took 18836 ms to find 0 implicit places.
[2024-06-01 18:50:14] [INFO ] Redundant transitions in 169 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19091 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-07
Product exploration timeout after 14200 steps with 110 reset in 10002 ms.
Product exploration timeout after 14120 steps with 109 reset in 10006 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 512 steps (0 resets) in 725 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 18:50:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 77 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:50:58] [INFO ] Invariant cache hit.
[2024-06-01 18:51:05] [INFO ] Implicit Places using invariants in 6365 ms returned []
[2024-06-01 18:51:05] [INFO ] Invariant cache hit.
[2024-06-01 18:51:22] [INFO ] Implicit Places using invariants and state equation in 16967 ms returned []
Implicit Place search using SMT with State Equation took 23344 ms to find 0 implicit places.
[2024-06-01 18:51:22] [INFO ] Redundant transitions in 175 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23617 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 512 steps (0 resets) in 443 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-06-01 18:51:28] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 14130 steps with 109 reset in 10002 ms.
Product exploration timeout after 14130 steps with 109 reset in 10002 ms.
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 70 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:52:04] [INFO ] Invariant cache hit.
[2024-06-01 18:52:10] [INFO ] Implicit Places using invariants in 6167 ms returned []
[2024-06-01 18:52:10] [INFO ] Invariant cache hit.
[2024-06-01 18:52:25] [INFO ] Implicit Places using invariants and state equation in 15563 ms returned []
Implicit Place search using SMT with State Equation took 21734 ms to find 0 implicit places.
[2024-06-01 18:52:26] [INFO ] Redundant transitions in 168 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22001 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-07 finished in 150586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 137 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:52:26] [INFO ] Invariant cache hit.
[2024-06-01 18:52:33] [INFO ] Implicit Places using invariants in 7209 ms returned []
[2024-06-01 18:52:33] [INFO ] Invariant cache hit.
[2024-06-01 18:52:50] [INFO ] Implicit Places using invariants and state equation in 16732 ms returned []
Implicit Place search using SMT with State Equation took 23943 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 24082 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-12 finished in 24242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0&&G(p1))))))'
Support contains 768 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 45 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-06-01 18:52:51] [INFO ] Computed 168 invariants in 695 ms
[2024-06-01 18:52:51] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2024-06-01 18:52:51] [INFO ] Invariant cache hit.
[2024-06-01 18:55:32] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 161379 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161428 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-15 finished in 161658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U G(p1)))'
Found a Shortening insensitive property : Sudoku-COL-BN16-LTLCardinality-04
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 64 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 18:55:32] [INFO ] Computed 1024 invariants in 17 ms
[2024-06-01 18:55:35] [INFO ] Implicit Places using invariants in 2530 ms returned []
[2024-06-01 18:55:35] [INFO ] Invariant cache hit.
[2024-06-01 18:55:49] [INFO ] Implicit Places using invariants and state equation in 14756 ms returned []
Implicit Place search using SMT with State Equation took 17289 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 LI_LTL mode , in 1 iterations and 17355 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-04
Product exploration timeout after 9490 steps with 2166 reset in 10005 ms.
Product exploration timeout after 9460 steps with 2167 reset in 10008 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 24 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 18:56:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 40 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:56:31] [INFO ] Invariant cache hit.
[2024-06-01 18:56:37] [INFO ] Implicit Places using invariants in 6049 ms returned []
[2024-06-01 18:56:37] [INFO ] Invariant cache hit.
[2024-06-01 18:56:52] [INFO ] Implicit Places using invariants and state equation in 15809 ms returned []
Implicit Place search using SMT with State Equation took 21859 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 21900 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 54 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 18:56:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration timeout after 9680 steps with 2197 reset in 10008 ms.
Product exploration timeout after 9720 steps with 2220 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 67 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:57:33] [INFO ] Redundant transitions in 162 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 38 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:57:33] [INFO ] Invariant cache hit.
[2024-06-01 18:57:39] [INFO ] Implicit Places using invariants in 5980 ms returned []
[2024-06-01 18:57:39] [INFO ] Invariant cache hit.
[2024-06-01 18:57:54] [INFO ] Implicit Places using invariants and state equation in 15037 ms returned []
Implicit Place search using SMT with State Equation took 21063 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 21108 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-04 finished in 142701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 18:57:55] [INFO ] Flatten gal took : 499 ms
[2024-06-01 18:57:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 24 ms.
[2024-06-01 18:57:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5120 places, 4096 transitions and 20480 arcs took 99 ms.
Total runtime 1250828 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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-BN16"
export BK_EXAMINATION="LTLCardinality"
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-BN16, examination is LTLCardinality"
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-171690532600563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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