Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545300084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-AN06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545300084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.9K Apr 30 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 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-AN06-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653065983842

Running Version 202205111006
[2022-05-20 16:59:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 16:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:59:45] [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.
[2022-05-20 16:59:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 16:59:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 489 ms
[2022-05-20 16:59:45] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 324 PT places and 216.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 16:59:45] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 8 ms.
[2022-05-20 16:59:45] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(6), N(6)] of place Rows breaks symmetries in sort N
[2022-05-20 16:59:45] [INFO ] Unfolded HLPN to a Petri net with 324 places and 216 transitions 864 arcs in 17 ms.
[2022-05-20 16:59:45] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 13 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:46] [INFO ] Computed 17 place invariants in 30 ms
[2022-05-20 16:59:46] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:46] [INFO ] Computed 17 place invariants in 8 ms
[2022-05-20 16:59:46] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:46] [INFO ] Computed 17 place invariants in 14 ms
[2022-05-20 16:59:46] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/324 places, 216/216 transitions.
Support contains 108 out of 108 places after structural reductions.
[2022-05-20 16:59:47] [INFO ] Flatten gal took : 100 ms
[2022-05-20 16:59:47] [INFO ] Flatten gal took : 100 ms
[2022-05-20 16:59:48] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:49] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-20 16:59:49] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X((X(p0) U p0)) U p0))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:49] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:49] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:49] [INFO ] Computed 17 place invariants in 9 ms
[2022-05-20 16:59:49] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:49] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 16:59:50] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-00 finished in 551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:50] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:50] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:50] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:50] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-05-20 16:59:50] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:50] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 16:59:50] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3181 reset in 1510 ms.
Product exploration explored 100000 steps with 3183 reset in 1459 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLFireability-04 finished in 3516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&G((F(p0) U true))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:53] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 16:59:53] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:53] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:53] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:53] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1712 ms.
Product exploration explored 100000 steps with 50000 reset in 1723 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLFireability-05 finished in 3976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U !p0)))||G(p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:57] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:57] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:57] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-20 16:59:57] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:57] [INFO ] Computed 17 place invariants in 8 ms
[2022-05-20 16:59:57] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 468 ms :[p0, false, p0, false]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1774 ms.
Product exploration explored 100000 steps with 50000 reset in 1789 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLFireability-06 finished in 4539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U G(p0)) U !p0))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 17:00:02] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-20 17:00:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-05-20 17:00:02] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 17:00:02] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0, true]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-08 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(G(!p0) U !p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-20 17:00:02] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 17:00:02] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-20 17:00:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-20 17:00:02] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, false, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-09 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 17:00:02] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:02] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 17:00:03] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:03] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 17:00:03] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 419 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2212 ms.
Product exploration explored 100000 steps with 33333 reset in 2234 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 : [p0, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLFireability-11 finished in 5507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 17:00:08] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:08] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-20 17:00:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 17:00:08] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-13 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))&&G((!p0 U G(F(X(p0)))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 17:00:08] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:08] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 17:00:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-05-20 17:00:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 17:00:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 17:00:09] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s49 1) (GEQ s78 1)) (AND (GEQ s13 1) (GEQ s53 1) (GEQ s103 1)) (AND (GEQ s28 1) (GEQ s64 1) (GEQ s100 1)) (AND (GEQ s27 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-15 finished in 294 ms.
All properties solved by simple procedures.
Total runtime 24079 ms.

BK_STOP 1653066009458

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-AN06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545300084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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