About the Execution of LoLa+red for Sudoku-PT-BN04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 717.279 | 49610.00 | 55295.00 | 544.70 | FFFFT?TFFFFFTFFF | 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-167912702900299.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-PT-BN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702900299
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 40K Feb 26 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 230K Feb 26 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 488K 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 18K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 496K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Feb 26 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 53K 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-PT-BN04-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679182301059
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 23:31:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:31:42] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-18 23:31:42] [INFO ] Transformed 128 places.
[2023-03-18 23:31:42] [INFO ] Transformed 64 transitions.
[2023-03-18 23:31:42] [INFO ] Parsed PT model containing 128 places and 64 transitions and 320 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-BN04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2023-03-18 23:31:43] [INFO ] Computed 64 place invariants in 11 ms
[2023-03-18 23:31:43] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-18 23:31:43] [INFO ] Invariant cache hit.
[2023-03-18 23:31:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-18 23:31:43] [INFO ] Invariant cache hit.
[2023-03-18 23:31:43] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2023-03-18 23:31:43] [INFO ] Flatten gal took : 27 ms
[2023-03-18 23:31:43] [INFO ] Flatten gal took : 17 ms
[2023-03-18 23:31:43] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 715 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 23:31:44] [INFO ] Invariant cache hit.
[2023-03-18 23:31:44] [INFO ] [Real]Absence check using 64 positive place invariants in 9 ms returned sat
[2023-03-18 23:31:44] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-18 23:31:44] [INFO ] [Nat]Absence check using 64 positive place invariants in 10 ms returned sat
[2023-03-18 23:31:44] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-PT-BN04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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).
FORMULA Sudoku-PT-BN04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&(F(p1) U G((p0||(p2&&F(p0))))))))'
Support contains 112 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:31:44] [INFO ] Invariant cache hit.
[2023-03-18 23:31:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-18 23:31:44] [INFO ] Invariant cache hit.
[2023-03-18 23:31:44] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-18 23:31:44] [INFO ] Invariant cache hit.
[2023-03-18 23:31:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 (ADD s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127)), p2:(LEQ (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 4 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-00 finished in 686 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 16 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 64 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 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 23:31:45] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-18 23:31:45] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 23:31:45] [INFO ] Invariant cache hit.
[2023-03-18 23:31:45] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-18 23:31:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:31:45] [INFO ] Invariant cache hit.
[2023-03-18 23:31:45] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-01 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:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31))], 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 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-01 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((p0&&G(F(p1)))))'
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2023-03-18 23:31:45] [INFO ] Computed 64 place invariants in 3 ms
[2023-03-18 23:31:45] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-18 23:31:45] [INFO ] Invariant cache hit.
[2023-03-18 23:31:45] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-18 23:31:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:31:45] [INFO ] Invariant cache hit.
[2023-03-18 23:31:45] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 2 reset in 3 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-02 finished in 427 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' '!((p0 U X(G(p1))))'
Support contains 32 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 2 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 23:31:46] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-18 23:31:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 23:31:46] [INFO ] Invariant cache hit.
[2023-03-18 23:31:46] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 23:31:46] [INFO ] Invariant cache hit.
[2023-03-18 23:31:46] [INFO ] Dead Transitions using invariants and state equation in 47 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 158 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15)), p0:(AND (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s48 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 738 steps with 52 reset in 10 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-03 finished in 264 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&&F(G(p1)))))'
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2023-03-18 23:31:46] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-18 23:31:46] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-18 23:31:46] [INFO ] Invariant cache hit.
[2023-03-18 23:31:46] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-18 23:31:46] [INFO ] Invariant cache hit.
[2023-03-18 23:31:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7188 reset in 764 ms.
Product exploration explored 100000 steps with 7175 reset in 788 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
[2023-03-18 23:31:48] [INFO ] Invariant cache hit.
[2023-03-18 23:31:49] [INFO ] [Real]Absence check using 64 positive place invariants in 12 ms returned sat
[2023-03-18 23:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:31:49] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-18 23:31:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:31:49] [INFO ] [Nat]Absence check using 64 positive place invariants in 13 ms returned sat
[2023-03-18 23:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:31:49] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-18 23:31:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 23:31:49] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:31:49] [INFO ] Invariant cache hit.
[2023-03-18 23:31:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-18 23:31:49] [INFO ] Invariant cache hit.
[2023-03-18 23:31:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-18 23:31:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:31:49] [INFO ] Invariant cache hit.
[2023-03-18 23:31:49] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2023-03-18 23:31:50] [INFO ] Invariant cache hit.
[2023-03-18 23:31:50] [INFO ] [Real]Absence check using 64 positive place invariants in 9 ms returned sat
[2023-03-18 23:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:31:50] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-18 23:31:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:31:50] [INFO ] [Nat]Absence check using 64 positive place invariants in 11 ms returned sat
[2023-03-18 23:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:31:50] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-18 23:31:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 23:31:50] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7180 reset in 711 ms.
Product exploration explored 100000 steps with 7158 reset in 745 ms.
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 13 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:31:51] [INFO ] Invariant cache hit.
[2023-03-18 23:31:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 23:31:51] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-18 23:31:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property Sudoku-PT-BN04-LTLCardinality-05 finished in 5828 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&&F(p1)))))'
Support contains 32 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 2 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 23:31:52] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-18 23:31:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Dead Transitions using invariants and state equation in 60 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 171 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47)), p0:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-07 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 65 transition count 64
Applied a total of 63 rules in 4 ms. Remains 65 /128 variables (removed 63) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 65 cols
[2023-03-18 23:31:52] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-18 23:31:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/128 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 65/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GT 1 s52) (GT s16 s25)), p0:(GT s16 s25)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-08 finished in 278 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 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 64 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 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 23:31:52] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-18 23:31:52] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-18 23:31:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s43 s5) (GT 1 s29))], 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-09 finished in 235 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 2 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 1 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:31:52] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Dead Transitions using invariants and state equation in 39 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 174 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s19 s32)], 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]]
Entered a terminal (fully accepting) state of product in 25 steps with 12 reset in 2 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-11 finished in 264 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 U (p1||G(p0))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 64 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 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 23:31:53] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-18 23:31:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s16 s13) (GT 1 s21)), p0:(GT 1 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 43 steps with 3 reset in 1 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-13 finished in 257 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 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 60 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.1 ms
Discarding 68 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 60 /128 variables (removed 68) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 60 cols
[2023-03-18 23:31:53] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-18 23:31:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 60/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s57)], 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 25 steps with 1 reset in 1 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-14 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0))) U X(p2))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 66 transition count 64
Applied a total of 62 rules in 4 ms. Remains 66 /128 variables (removed 62) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 66 cols
[2023-03-18 23:31:53] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-18 23:31:53] [INFO ] Invariant cache hit.
[2023-03-18 23:31:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/128 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 66/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) p0 (NOT p2)), true, (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GT 1 s63) (LEQ s61 s16)), p0:(LEQ 1 s63), p2:(LEQ s64 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-15 finished in 457 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&&F(G(p1)))))'
[2023-03-18 23:31:54] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:31:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:31:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 64 transitions and 320 arcs took 1 ms.
Total runtime 11835 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-BN04
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
BK_STOP 1679182350669
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type SKEL/SRCH) for 0 Sudoku-PT-BN04-LTLCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SKEL/SRCH) for Sudoku-PT-BN04-LTLCardinality-05
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 3 (type EXCL) for 0 Sudoku-PT-BN04-LTLCardinality-05
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for Sudoku-PT-BN04-LTLCardinality-05
lola: result : true
lola: markings : 65
lola: fired transitions : 64
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 5 (type EXCL) for 0 Sudoku-PT-BN04-LTLCardinality-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN04-LTLCardinality-05: CONJ 0 0 1 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/3600 7/32 Sudoku-PT-BN04-LTLCardinality-05 877626 m, 175525 m/sec, 5843784 t fired, .
Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN04-LTLCardinality-05: CONJ 0 0 1 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/3600 12/32 Sudoku-PT-BN04-LTLCardinality-05 1599130 m, 144300 m/sec, 11217236 t fired, .
Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN04-LTLCardinality-05: CONJ 0 0 1 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/3600 17/32 Sudoku-PT-BN04-LTLCardinality-05 2374735 m, 155121 m/sec, 16555798 t fired, .
Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN04-LTLCardinality-05: CONJ 0 0 1 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/3600 22/32 Sudoku-PT-BN04-LTLCardinality-05 3061457 m, 137344 m/sec, 21733989 t fired, .
Time elapsed: 20 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN04-LTLCardinality-05: CONJ 0 0 1 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/3600 27/32 Sudoku-PT-BN04-LTLCardinality-05 3791265 m, 145961 m/sec, 26750453 t fired, .
Time elapsed: 25 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN04-LTLCardinality-05: CONJ 0 0 1 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/3600 32/32 Sudoku-PT-BN04-LTLCardinality-05 4462666 m, 134280 m/sec, 31908156 t fired, .
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 5 (type EXCL) for Sudoku-PT-BN04-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN04-LTLCardinality-05: CONJ 0 0 0 0 3 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-BN04-LTLCardinality-05: CONJ unknown CONJ
Time elapsed: 35 secs. Pages in use: 32
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-PT-BN04"
export BK_EXAMINATION="LTLCardinality"
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-PT-BN04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912702900299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN04.tgz
mv Sudoku-PT-BN04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;