About the Execution of ITS-Tools for Sudoku-COL-BN01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 358.500 | 19896.00 | 19836.00 | 3022.70 | FFFFTTFFTFFTFTFF | normal |
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-165303545400172.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-BN01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.7K Apr 30 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 30 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 11:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 11:35 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 25K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 9.7K 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-BN01-LTLFireability-00
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-01
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-02
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-03
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-04
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-05
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-06
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-07
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-08
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-09
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-10
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-11
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-12
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-13
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-14
FORMULA_NAME Sudoku-COL-BN01-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653086575379
Running Version 202205111006
[2022-05-20 22:42:56] [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 22:42:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:42:56] [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 22:42:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 22:42:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 536 ms
[2022-05-20 22:42:57] [WARNING] OR operator with single subterm is malformed PNML.
[2022-05-20 22:42:57] [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/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 22:42:57] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 7 ms.
[2022-05-20 22:42:57] [INFO ] Skeletonized 16 HLPN properties in 1 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.
[2022-05-20 22:42:57] [INFO ] Unfolded HLPN to a Petri net with 5 places and 1 transitions 5 arcs in 3 ms.
[2022-05-20 22:42:57] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-BN01-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4 transition count 1
Applied a total of 1 rules in 5 ms. Remains 4 /5 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:57] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-20 22:42:57] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:42:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:42:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/5 places, 1/1 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/5 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2022-05-20 22:42:57] [INFO ] Flatten gal took : 11 ms
[2022-05-20 22:42:57] [INFO ] Flatten gal took : 4 ms
[2022-05-20 22:42:57] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 1181 ms. (steps per millisecond=8 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:42:59] [INFO ] After 93ms 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-BN01-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-BN01-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-BN01-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&G(p0))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:42:59] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:42:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-20 22:42:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-20 22:42:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 2 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLFireability-02 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p1 U p1)&&F(!p1)&&p0) U (F(p1)||p1))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:42:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:42:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:42:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLFireability-03 finished in 175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p0)) U X(!((!p0 U p0)||p0))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:00] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:00] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 83 ms :[p0, true, p0]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 138 ms.
Product exploration explored 100000 steps with 50000 reset in 80 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).
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 65 ms :[true, p0, p0]
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:01] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 22:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:43:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-20 22:43:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:43:01] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:01] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
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).
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 547 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:02] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 22:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:43:02] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2022-05-20 22:43:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:43:02] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Product exploration explored 100000 steps with 50000 reset in 38 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 452 ms :[true, p0, p0]
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2022-05-20 22:43:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Built C files in :
/tmp/ltsmin11744494343939170668
[2022-05-20 22:43:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11744494343939170668
Running compilation step : cd /tmp/ltsmin11744494343939170668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 159 ms.
Running link step : cd /tmp/ltsmin11744494343939170668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11744494343939170668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12717607288521439095.hoa' '--buchi-type=spotba'
LTSmin run took 414 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-BN01-LTLFireability-04 finished in 4816 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((!p0 U X(F(p0)))||X(p0)))&&F(p0)))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:04] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:04] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLFireability-07 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!F(p0) U F(((G(p0)||F(p0)) U p0)))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:04] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:04] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:04] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-20 22:43:05] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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]]
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Product exploration explored 100000 steps with 50000 reset in 38 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).
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 2345 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 66 ms :[true, p0, p0]
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:07] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-20 22:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:43:07] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:43:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:43:07] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:08] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:08] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
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).
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 438 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 1571 ms :[true, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 248 ms :[true, p0, p0]
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:10] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-20 22:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:43:10] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 22:43:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 22:43:10] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 85 ms :[true, p0, p0]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 31 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0]
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2022-05-20 22:43:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Built C files in :
/tmp/ltsmin14159600685408378946
[2022-05-20 22:43:11] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14159600685408378946
Running compilation step : cd /tmp/ltsmin14159600685408378946;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 135 ms.
Running link step : cd /tmp/ltsmin14159600685408378946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14159600685408378946;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2231356372077830728.hoa' '--buchi-type=spotba'
LTSmin run took 260 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-BN01-LTLFireability-08 finished in 6599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(G((G(F(p0))&&G(p0))))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:11] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-20 22:43:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:11] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 0 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLFireability-09 finished in 166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||X(X((F(X(!p0))||G(!p0)))))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:11] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:11] [INFO ] Computed 3 place invariants in 9 ms
[2022-05-20 22:43:11] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 527 ms :[p0, false, false, false, p0]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 25 ms.
Product exploration explored 100000 steps with 50000 reset in 30 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).
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 (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-BN01-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN01-LTLFireability-11 finished in 759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U p0))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:12] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:12] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-20 22:43:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-12 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 (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLFireability-12 finished in 140 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G((p0 U !(p0 U p0)))))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 4 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:12] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:12] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-20 22:43:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:12] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-13 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 (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 98 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).
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 (NOT p0)), (X (X (NOT 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 301 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-BN01-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN01-LTLFireability-13 finished in 681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((!(X(p0)&&G(p0)) U p0))) U G(p0)))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:13] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-20 22:43:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 985 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLFireability-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:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 0 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLFireability-14 finished in 1071 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F((G(p0) U G(X(F(p0))))))||F(p0))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:14] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:43:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 22:43:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:43:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:43:14] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-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:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLFireability-15 finished in 182 ms.
All properties solved by simple procedures.
Total runtime 18022 ms.
BK_STOP 1653086595275
--------------------
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-BN01"
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-BN01, 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-165303545400172"
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 [ "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 '
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 ;