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.r489-tall-167912706400179.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 ltsminxred
Input is Sudoku-PT-AN03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706400179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 15K Feb 26 09:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 09:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 26 09:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 143K Feb 26 09:35 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 9.9K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 26 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 44K Feb 26 09:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 225K Feb 26 09:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:16 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 21K 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-AN03-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679203349860

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 05:22:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 05:22:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:22:31] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-19 05:22:31] [INFO ] Transformed 54 places.
[2023-03-19 05:22:31] [INFO ] Transformed 27 transitions.
[2023-03-19 05:22:31] [INFO ] Parsed PT model containing 54 places and 27 transitions and 108 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2023-03-19 05:22:31] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-19 05:22:31] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 05:22:31] [INFO ] Invariant cache hit.
[2023-03-19 05:22:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-19 05:22:31] [INFO ] Invariant cache hit.
[2023-03-19 05:22:31] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 54/54 places, 27/27 transitions.
Support contains 54 out of 54 places after structural reductions.
[2023-03-19 05:22:32] [INFO ] Flatten gal took : 19 ms
[2023-03-19 05:22:32] [INFO ] Flatten gal took : 7 ms
[2023-03-19 05:22:32] [INFO ] Input system was already deterministic with 27 transitions.
Incomplete random walk after 10000 steps, including 1177 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 26) seen :15
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 05:22:32] [INFO ] Invariant cache hit.
[2023-03-19 05:22:33] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 05:22:33] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-19 05:22:33] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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(((p1 U (p2||G(p1)))||p0)))'
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-19 05:22:33] [INFO ] Invariant cache hit.
[2023-03-19 05:22:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:22:33] [INFO ] Invariant cache hit.
[2023-03-19 05:22:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 05:22:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:22:33] [INFO ] Invariant cache hit.
[2023-03-19 05:22:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}]], initial=2, aps=[p2:(AND (GT 1 (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35)) (LEQ 3 (ADD s0 s1 s2 s3 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-00 finished in 507 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 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 3 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2023-03-19 05:22:33] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-19 05:22:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:22:33] [INFO ] Invariant cache hit.
[2023-03-19 05:22:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-19 05:22:33] [INFO ] Invariant cache hit.
[2023-03-19 05:22:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-02 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 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8))], 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 301 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 72 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-PT-AN03-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN03-LTLCardinality-02 finished in 899 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 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2023-03-19 05:22:34] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-19 05:22:34] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 05:22:34] [INFO ] Invariant cache hit.
[2023-03-19 05:22:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-19 05:22:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 05:22:34] [INFO ] Invariant cache hit.
[2023-03-19 05:22:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8))], 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 11738 reset in 419 ms.
Product exploration explored 100000 steps with 11735 reset in 379 ms.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 191 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 46 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 183 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-19 05:22:36] [INFO ] Invariant cache hit.
[2023-03-19 05:22:36] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-19 05:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:22:36] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-19 05:22:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:22:36] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-19 05:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:22:36] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-19 05:22:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 05:22:36] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-19 05:22:36] [INFO ] Invariant cache hit.
[2023-03-19 05:22:36] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:22:36] [INFO ] Invariant cache hit.
[2023-03-19 05:22:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-19 05:22:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:22:36] [INFO ] Invariant cache hit.
[2023-03-19 05:22:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 54/54 places, 27/27 transitions.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 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 29 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 188 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2023-03-19 05:22:37] [INFO ] Invariant cache hit.
[2023-03-19 05:22:37] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2023-03-19 05:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:22:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-19 05:22:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:22:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-19 05:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:22:37] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-19 05:22:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 05:22:37] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11750 reset in 319 ms.
Product exploration explored 100000 steps with 11748 reset in 350 ms.
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-19 05:22:37] [INFO ] Invariant cache hit.
[2023-03-19 05:22:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 05:22:37] [INFO ] Invariant cache hit.
[2023-03-19 05:22:37] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-19 05:22:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:22:37] [INFO ] Invariant cache hit.
[2023-03-19 05:22:37] [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 134 ms. Remains : 54/54 places, 27/27 transitions.
Treatment of property Sudoku-PT-AN03-LTLCardinality-04 finished in 3306 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 27 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 27 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2023-03-19 05:22:38] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-19 05:22:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 05:22:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8)) (GT 2 (ADD s18 s19 s20 s21 s22 s23 s24 s25 s26)))], 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 7 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-06 finished in 155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 27 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-19 05:22:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s7 s19) (GT 1 s9))], 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 2 reset in 2 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-08 finished in 179 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 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 27 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 05:22:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 05:22:38] [INFO ] Invariant cache hit.
[2023-03-19 05:22:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s17), p1:(LEQ 1 s3)], 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 12 steps with 1 reset in 1 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-14 finished in 402 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)))'
[2023-03-19 05:22:38] [INFO ] Flatten gal took : 7 ms
[2023-03-19 05:22:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 05:22:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 27 transitions and 108 arcs took 1 ms.
Total runtime 7597 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/770/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Sudoku-PT-AN03-LTLCardinality-04

BK_STOP 1679203361341

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2023
ltl formula name Sudoku-PT-AN03-LTLCardinality-04
ltl formula formula --ltl=/tmp/770/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 27 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/770/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/770/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/770/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/770/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-AN03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-PT-AN03, 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 r489-tall-167912706400179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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