About the Execution of LoLa+red for Sudoku-COL-BN04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 447.168 | 15544.00 | 22694.00 | 594.40 | FFTFFTTTFTFFTFTF | normal |
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.r487-tall-167912702700140.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 lolaxred
Input is Sudoku-COL-BN04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702700140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 09:33 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 4.0K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 09:36 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 36K 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-BN04-LTLFireability-00
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-01
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-02
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-03
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-04
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-05
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-06
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-07
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-08
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-09
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-10
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-11
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-12
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-13
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-14
FORMULA_NAME Sudoku-COL-BN04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679169433880
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 19:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 19:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:57:15] [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 19:57:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 19:57:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 411 ms
[2023-03-18 19:57:16] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 128 PT places and 256.0 transition bindings in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 19:57:16] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 6 ms.
[2023-03-18 19:57:16] [INFO ] Skeletonized 16 HLPN properties in 2 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).
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-BN04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-03-18 19:57:16] [INFO ] Flatten gal took : 9 ms
[2023-03-18 19:57:16] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2023-03-18 19:57:16] [INFO ] Unfolded HLPN to a Petri net with 128 places and 64 transitions 320 arcs in 13 ms.
[2023-03-18 19:57:16] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-BN04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 7 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2023-03-18 19:57:16] [INFO ] Computed 24 place invariants in 17 ms
[2023-03-18 19:57:16] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-18 19:57:16] [INFO ] Invariant cache hit.
[2023-03-18 19:57:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-18 19:57:16] [INFO ] Invariant cache hit.
[2023-03-18 19:57:16] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 64/128 places, 64/64 transitions.
Support contains 64 out of 64 places after structural reductions.
[2023-03-18 19:57:16] [INFO ] Flatten gal took : 26 ms
[2023-03-18 19:57:17] [INFO ] Flatten gal took : 38 ms
[2023-03-18 19:57:17] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=2 )
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
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' '!(G(F(p0)))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:17] [INFO ] Invariant cache hit.
[2023-03-18 19:57:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 19:57:17] [INFO ] Invariant cache hit.
[2023-03-18 19:57:17] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-18 19:57:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:57:17] [INFO ] Invariant cache hit.
[2023-03-18 19:57:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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 13 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-BN04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLFireability-00 finished in 496 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 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:17] [INFO ] Invariant cache hit.
[2023-03-18 19:57:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 19:57:17] [INFO ] Invariant cache hit.
[2023-03-18 19:57:17] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-18 19:57:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 19:57:17] [INFO ] Invariant cache hit.
[2023-03-18 19:57:18] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-01 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 s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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 11 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLFireability-01 finished in 174 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(G(p0)))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:18] [INFO ] Invariant cache hit.
[2023-03-18 19:57:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 19:57:18] [INFO ] Invariant cache hit.
[2023-03-18 19:57:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-18 19:57:18] [INFO ] Invariant cache hit.
[2023-03-18 19:57:18] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-04 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 s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLFireability-04 finished in 249 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(!p0))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:18] [INFO ] Invariant cache hit.
[2023-03-18 19:57:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 19:57:18] [INFO ] Invariant cache hit.
[2023-03-18 19:57:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-18 19:57:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:57:18] [INFO ] Invariant cache hit.
[2023-03-18 19:57:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 25 ms :[p0]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7181 reset in 611 ms.
Product exploration explored 100000 steps with 7180 reset in 562 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN04-LTLFireability-05 finished in 1475 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(!p0))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:19] [INFO ] Invariant cache hit.
[2023-03-18 19:57:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 19:57:19] [INFO ] Invariant cache hit.
[2023-03-18 19:57:19] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-18 19:57:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:57:19] [INFO ] Invariant cache hit.
[2023-03-18 19:57:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7184 reset in 522 ms.
Product exploration explored 100000 steps with 7175 reset in 522 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN04-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN04-LTLFireability-06 finished in 1332 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' '!(G(F(!p0)))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:21] [INFO ] Invariant cache hit.
[2023-03-18 19:57:21] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 19:57:21] [INFO ] Invariant cache hit.
[2023-03-18 19:57:21] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 19:57:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:57:21] [INFO ] Invariant cache hit.
[2023-03-18 19:57:21] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-07 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:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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 7175 reset in 510 ms.
Product exploration explored 100000 steps with 7156 reset in 512 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN04-LTLFireability-07 finished in 1464 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' '!(G(F(p0)))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:22] [INFO ] Invariant cache hit.
[2023-03-18 19:57:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 19:57:22] [INFO ] Invariant cache hit.
[2023-03-18 19:57:22] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-18 19:57:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:57:22] [INFO ] Invariant cache hit.
[2023-03-18 19:57:22] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLFireability-08 finished in 332 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 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:22] [INFO ] Invariant cache hit.
[2023-03-18 19:57:22] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 19:57:22] [INFO ] Invariant cache hit.
[2023-03-18 19:57:23] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 19:57:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 19:57:23] [INFO ] Invariant cache hit.
[2023-03-18 19:57:23] [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 133 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], 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 7187 reset in 615 ms.
Product exploration explored 100000 steps with 7171 reset in 592 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 121 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-BN04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN04-LTLFireability-09 finished in 1584 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 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:24] [INFO ] Invariant cache hit.
[2023-03-18 19:57:24] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 19:57:24] [INFO ] Invariant cache hit.
[2023-03-18 19:57:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-18 19:57:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:57:24] [INFO ] Invariant cache hit.
[2023-03-18 19:57:24] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-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 s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLFireability-10 finished in 178 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))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:24] [INFO ] Invariant cache hit.
[2023-03-18 19:57:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 19:57:24] [INFO ] Invariant cache hit.
[2023-03-18 19:57:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-18 19:57:24] [INFO ] Invariant cache hit.
[2023-03-18 19:57:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 521 ms.
Product exploration explored 100000 steps with 50000 reset in 544 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN04-LTLFireability-12 finished in 1425 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(G((!p0||G(p0)))))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:26] [INFO ] Invariant cache hit.
[2023-03-18 19:57:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 19:57:26] [INFO ] Invariant cache hit.
[2023-03-18 19:57:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-18 19:57:26] [INFO ] Invariant cache hit.
[2023-03-18 19:57:26] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), false, false]
Running random walk in product with property : Sudoku-COL-BN04-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: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLFireability-13 finished in 268 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(!p0))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:26] [INFO ] Invariant cache hit.
[2023-03-18 19:57:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 19:57:26] [INFO ] Invariant cache hit.
[2023-03-18 19:57:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 19:57:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:57:26] [INFO ] Invariant cache hit.
[2023-03-18 19:57:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7175 reset in 493 ms.
Product exploration explored 100000 steps with 7178 reset in 520 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN04-LTLFireability-14 finished in 1348 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((F(p0)&&(!p0||G(p0)))))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:57:27] [INFO ] Invariant cache hit.
[2023-03-18 19:57:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 19:57:27] [INFO ] Invariant cache hit.
[2023-03-18 19:57:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-18 19:57:27] [INFO ] Invariant cache hit.
[2023-03-18 19:57:27] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLFireability-15 finished in 281 ms.
All properties solved by simple procedures.
Total runtime 12721 ms.
ITS solved all properties within timeout
BK_STOP 1679169449424
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-BN04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Sudoku-COL-BN04, 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 r487-tall-167912702700140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN04.tgz
mv Sudoku-COL-BN04 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 ;