Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K Feb 26 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 09:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 9.7K Mar 5 18:23 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-BN01-LTLCardinality-00
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-01
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-02
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-03
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-04
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-05
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-06
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-07
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-08
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-09
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-10
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-11
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-12
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-13
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-14
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679170410230

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN01
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 20:13:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:13:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:13:32] [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.
[2023-03-18 20:13:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:13:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 389 ms
[2023-03-18 20:13:32] [WARNING] OR operator with single subterm is malformed PNML.
[2023-03-18 20:13:32] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5 PT places and 1.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 20:13:33] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 18 ms.
[2023-03-18 20:13:33] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-BN01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-18 20:13:34] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 20:13:35] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 20:13:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 20:13:35] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-BN01-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:13:35] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 20:13:35] [INFO ] Flatten gal took : 28 ms
[2023-03-18 20:13:35] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-BN01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:13:35] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:35] [INFO ] Unfolded HLPN to a Petri net with 5 places and 1 transitions 5 arcs in 4 ms.
[2023-03-18 20:13:35] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Applied a total of 0 rules in 23 ms. Remains 5 /5 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 20:13:35] [INFO ] Invariant cache hit.
[2023-03-18 20:13:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 20:13:36] [INFO ] Invariant cache hit.
[2023-03-18 20:13:36] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-18 20:13:36] [INFO ] Invariant cache hit.
[2023-03-18 20:13:36] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 5/5 places, 1/1 transitions.
Support contains 5 out of 5 places after structural reductions.
[2023-03-18 20:13:36] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:13:36] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:36] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:13:36] [INFO ] Invariant cache hit.
[2023-03-18 20:13:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 20:13:36] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 20:13:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-18 20:13:36] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
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).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Graph (complete) has 4 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Applied a total of 1 rules in 21 ms. Remains 1 /5 variables (removed 4) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 20:13:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 20:13:36] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 20:13:37] [INFO ] Invariant cache hit.
[2023-03-18 20:13:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-18 20:13:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:13:37] [INFO ] Invariant cache hit.
[2023-03-18 20:13:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/5 places, 1/1 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 1/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], 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 1 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-BN01-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLCardinality-04 finished in 748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Applied a total of 0 rules in 1 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 20:13:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 20:13:37] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 20:13:37] [INFO ] Invariant cache hit.
[2023-03-18 20:13:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 20:13:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:13:37] [INFO ] Invariant cache hit.
[2023-03-18 20:13:37] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLCardinality-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:(LEQ s1 s0)], 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 50000 reset in 349 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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 p0), (X (X 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 438 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN01-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN01-LTLCardinality-10 finished in 1629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3 transition count 1
Applied a total of 2 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2023-03-18 20:13:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 20:13:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 20:13:39] [INFO ] Invariant cache hit.
[2023-03-18 20:13:39] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-18 20:13:39] [INFO ] Invariant cache hit.
[2023-03-18 20:13:39] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 3/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-COL-BN01-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LEQ s1 s0) (LEQ 2 s1)), p0:(GT s0 s2)], 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 50000 reset in 454 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0))
Knowledge based reduction with 8 factoid took 691 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN01-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN01-LTLCardinality-12 finished in 2095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2023-03-18 20:13:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 20:13:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:13:41] [INFO ] Invariant cache hit.
[2023-03-18 20:13:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-18 20:13:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:13:41] [INFO ] Invariant cache hit.
[2023-03-18 20:13:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 3/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLCardinality-14 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 (GT s1 s2) (GT 1 s0))], 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 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 313 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
[2023-03-18 20:13:42] [INFO ] Invariant cache hit.
[2023-03-18 20:13:42] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2023-03-18 20:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:13:42] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-18 20:13:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 20:13:42] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 20:13:42] [INFO ] Invariant cache hit.
[2023-03-18 20:13:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:13:43] [INFO ] Invariant cache hit.
[2023-03-18 20:13:43] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-18 20:13:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:13:43] [INFO ] Invariant cache hit.
[2023-03-18 20:13:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 3/3 places, 1/1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 550 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
[2023-03-18 20:13:44] [INFO ] Invariant cache hit.
[2023-03-18 20:13:44] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2023-03-18 20:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:13:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-18 20:13:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 20:13:44] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Built C files in :
/tmp/ltsmin15237116618907205310
[2023-03-18 20:13:44] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2023-03-18 20:13:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:13:44] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2023-03-18 20:13:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:13:44] [INFO ] Computing Do-Not-Accords matrix : 1 transitions.
[2023-03-18 20:13:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:13:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15237116618907205310
Running compilation step : cd /tmp/ltsmin15237116618907205310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 498 ms.
Running link step : cd /tmp/ltsmin15237116618907205310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 127 ms.
Running LTSmin : cd /tmp/ltsmin15237116618907205310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1388253272110864704.hoa' '--buchi-type=spotba'
LTSmin run took 1985 ms.
FORMULA Sudoku-COL-BN01-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-BN01-LTLCardinality-14 finished in 6125 ms.
All properties solved by simple procedures.
Total runtime 15153 ms.

BK_STOP 1679170428994

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN01.tgz
mv Sudoku-COL-BN01 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;