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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 8.5K Apr 30 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 30 11:37 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 3.7K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:12 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 146K 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-BN09-LTLFireability-00
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-01
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-02
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-03
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-04
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-05
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-06
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-07
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-08
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-09
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-10
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-11
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-12
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-13
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-14
FORMULA_NAME Sudoku-COL-BN09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653089260736

Running Version 202205111006
[2022-05-20 23:27:41] [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 23:27:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:27:41] [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 23:27:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 23:27:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 634 ms
[2022-05-20 23:27:42] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 23:27:42] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 5 ms.
[2022-05-20 23:27:42] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
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).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2022-05-20 23:27:42] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 69 ms.
[2022-05-20 23:27:42] [INFO ] Unfolded 16 HLPN properties in 5 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-BN09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 324 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 28 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:43] [INFO ] Computed 75 place invariants in 62 ms
[2022-05-20 23:27:43] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:43] [INFO ] Computed 75 place invariants in 32 ms
[2022-05-20 23:27:43] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:43] [INFO ] Computed 75 place invariants in 29 ms
[2022-05-20 23:27:44] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/1053 places, 729/729 transitions.
Support contains 324 out of 324 places after structural reductions.
[2022-05-20 23:27:44] [INFO ] Flatten gal took : 288 ms
[2022-05-20 23:27:46] [INFO ] Flatten gal took : 323 ms
[2022-05-20 23:27:47] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4182 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:52] [INFO ] Computed 75 place invariants in 25 ms
[2022-05-20 23:27:54] [INFO ] After 193ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(p0))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:55] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-20 23:27:55] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:55] [INFO ] Computed 75 place invariants in 18 ms
[2022-05-20 23:27:55] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:55] [INFO ] Computed 75 place invariants in 19 ms
[2022-05-20 23:27:56] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-01 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:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], 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 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-01 finished in 1004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p0))||(p0 U p0))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:56] [INFO ] Computed 75 place invariants in 15 ms
[2022-05-20 23:27:56] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:56] [INFO ] Computed 75 place invariants in 25 ms
[2022-05-20 23:27:56] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2022-05-20 23:27:56] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:56] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-20 23:27:56] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s90 1) (GEQ s166 1) (GEQ s279 1)) (AND (GEQ s21 1) (GEQ s102 1) (GEQ s188 1) (GEQ s318 1)) (AND (GEQ s46 1) (GEQ s118 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 11 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-03 finished in 728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((!p0 U F(!p0))))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:56] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-20 23:27:57] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:57] [INFO ] Computed 75 place invariants in 15 ms
[2022-05-20 23:27:57] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:27:57] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-20 23:27:57] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 9780 ms.
Product exploration explored 100000 steps with 33333 reset in 9741 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-BN09-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN09-LTLFireability-04 finished in 22649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U !X(!p0)))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 1 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:19] [INFO ] Computed 75 place invariants in 28 ms
[2022-05-20 23:28:19] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:19] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-20 23:28:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:19] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-20 23:28:20] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-08 finished in 698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(!p0)&&!p0)) U !(F(G(X(!p0)))||G(!p0)))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:20] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-20 23:28:20] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:20] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-20 23:28:20] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2022-05-20 23:28:20] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:20] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-20 23:28:20] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-09 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:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1509 reset in 4714 ms.
Product exploration explored 100000 steps with 1507 reset in 4849 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-BN09-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN09-LTLFireability-09 finished in 12827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:33] [INFO ] Computed 75 place invariants in 19 ms
[2022-05-20 23:28:33] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:33] [INFO ] Computed 75 place invariants in 14 ms
[2022-05-20 23:28:33] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2022-05-20 23:28:33] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:33] [INFO ] Computed 75 place invariants in 19 ms
[2022-05-20 23:28:33] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s90 1) (GEQ s166 1) (GEQ s279 1)) (AND (GEQ s21 1) (GEQ s102 1) (GEQ s188 1) (GEQ s318 1)) (AND (GEQ s46 1) (GEQ s118 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 8 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-10 finished in 691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)||F(G(!p0))))&&G(p0))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:33] [INFO ] Computed 75 place invariants in 15 ms
[2022-05-20 23:28:33] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:33] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-20 23:28:34] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:34] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-20 23:28:34] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-11 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 s0 1) (GEQ s90 1) (GEQ s166 1) (GEQ s279 1)) (AND (GEQ s21 1) (GEQ s102 1) (GEQ s188 1) (GEQ s318 1)) (AND (GEQ s46 1) (GEQ s118 1) (GEQ ...], 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 67 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-11 finished in 687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:34] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-20 23:28:34] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:34] [INFO ] Computed 75 place invariants in 21 ms
[2022-05-20 23:28:34] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:34] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-20 23:28:35] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-12 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 s0 1) (GEQ s90 1) (GEQ s166 1) (GEQ s279 1)) (AND (GEQ s21 1) (GEQ s102 1) (GEQ s188 1) (GEQ s318 1)) (AND (GEQ s46 1) (GEQ s118 1) (GEQ ...], 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 63 steps with 0 reset in 5 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-12 finished in 678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:35] [INFO ] Computed 75 place invariants in 18 ms
[2022-05-20 23:28:35] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:35] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-20 23:28:35] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:35] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-20 23:28:35] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s90 1) (GEQ s166 1) (GEQ s279 1)) (AND (GEQ s21 1) (GEQ s102 1) (GEQ s188 1) (GEQ s318 1)) (AND (GEQ s46 1) (GEQ s118 1) (GEQ ...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-13 finished in 696 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((F(!p0) U X(!p0))))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:35] [INFO ] Computed 75 place invariants in 16 ms
[2022-05-20 23:28:35] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:36] [INFO ] Computed 75 place invariants in 25 ms
[2022-05-20 23:28:36] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2022-05-20 23:28:36] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-20 23:28:36] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-20 23:28:36] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-BN09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], 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 69 steps with 0 reset in 5 ms.
FORMULA Sudoku-COL-BN09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLFireability-15 finished in 682 ms.
All properties solved by simple procedures.
Total runtime 54729 ms.

BK_STOP 1653089316975

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

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