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-167912702700139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-COL-BN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702700139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 09:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 36K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-00
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-01
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-02
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-03
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-04
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-05
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-06
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-07
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-08
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-09
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-10
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-11
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-12
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-13
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-14
FORMULA_NAME Sudoku-COL-BN04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679169382095

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-COL-BN04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 19:56:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 19:56:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:56:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 19:56:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 19:56:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2023-03-18 19:56:24] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 128 PT places and 256.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 19:56:24] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2023-03-18 19:56:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-BN04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10007 steps, including 555 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 26) seen :19
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-18 19:56:24] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 19:56:24] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 19:56:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 19:56:24] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-BN04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 19:56:25] [INFO ] Flatten gal took : 10 ms
FORMULA Sudoku-COL-BN04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 19:56:25] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2023-03-18 19:56:25] [INFO ] Unfolded HLPN to a Petri net with 128 places and 64 transitions 320 arcs in 11 ms.
[2023-03-18 19:56:25] [INFO ] Unfolded 10 HLPN properties in 1 ms.
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 15 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 19:56:25] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-18 19:56:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 19:56:25] [INFO ] Invariant cache hit.
[2023-03-18 19:56:25] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-18 19:56:25] [INFO ] Invariant cache hit.
[2023-03-18 19:56:25] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2023-03-18 19:56:25] [INFO ] Flatten gal took : 15 ms
[2023-03-18 19:56:25] [INFO ] Flatten gal took : 12 ms
[2023-03-18 19:56:25] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 714 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:56:25] [INFO ] Invariant cache hit.
[2023-03-18 19:56:25] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:56:25] [INFO ] [Nat]Absence check using 64 positive place invariants in 12 ms returned sat
[2023-03-18 19:56:25] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
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).
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 19:56:26] [INFO ] Invariant cache hit.
[2023-03-18 19:56:26] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 19:56:26] [INFO ] Invariant cache hit.
[2023-03-18 19:56:26] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-18 19:56:26] [INFO ] Invariant cache hit.
[2023-03-18 19:56:26] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-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 27 steps with 1 reset in 2 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-00 finished in 586 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.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2023-03-18 19:56:26] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-18 19:56:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 19:56:26] [INFO ] Invariant cache hit.
[2023-03-18 19:56:26] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-18 19:56:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:56:26] [INFO ] Invariant cache hit.
[2023-03-18 19:56:26] [INFO ] Dead Transitions using invariants and state equation in 68 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 272 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-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 54 steps with 3 reset in 1 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-01 finished in 349 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 4 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 19:56:27] [INFO ] Computed 64 place invariants in 1 ms
[2023-03-18 19:56:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 19:56:27] [INFO ] Invariant cache hit.
[2023-03-18 19:56:27] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-18 19:56:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 19:56:27] [INFO ] Invariant cache hit.
[2023-03-18 19:56:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-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 30 steps with 2 reset in 2 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-02 finished in 337 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 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 19:56:27] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-18 19:56:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 19:56:27] [INFO ] Invariant cache hit.
[2023-03-18 19:56:27] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-18 19:56:27] [INFO ] Invariant cache hit.
[2023-03-18 19:56:27] [INFO ] Dead Transitions using invariants and state equation in 45 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 169 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-COL-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 120 steps with 8 reset in 2 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-03 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' '!(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 19:56:27] [INFO ] Computed 64 place invariants in 1 ms
[2023-03-18 19:56:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-18 19:56:27] [INFO ] Invariant cache hit.
[2023-03-18 19:56:27] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-18 19:56:27] [INFO ] Invariant cache hit.
[2023-03-18 19:56:27] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-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 7168 reset in 735 ms.
Product exploration explored 100000 steps with 7175 reset in 758 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 256 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 30 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 211 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 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2023-03-18 19:56:30] [INFO ] Invariant cache hit.
[2023-03-18 19:56:30] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned sat
[2023-03-18 19:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 19:56:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-18 19:56:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 19:56:30] [INFO ] [Nat]Absence check using 64 positive place invariants in 10 ms returned sat
[2023-03-18 19:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 19:56:30] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-18 19:56:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 19:56:30] [INFO ] Added : 0 causal constraints over 0 iterations in 44 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 5 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:56:30] [INFO ] Invariant cache hit.
[2023-03-18 19:56:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-18 19:56:30] [INFO ] Invariant cache hit.
[2023-03-18 19:56:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-18 19:56:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:56:30] [INFO ] Invariant cache hit.
[2023-03-18 19:56:30] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 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 296 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 25 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 164 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 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2023-03-18 19:56:31] [INFO ] Invariant cache hit.
[2023-03-18 19:56:31] [INFO ] [Real]Absence check using 64 positive place invariants in 9 ms returned sat
[2023-03-18 19:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 19:56:31] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-18 19:56:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 19:56:31] [INFO ] [Nat]Absence check using 64 positive place invariants in 10 ms returned sat
[2023-03-18 19:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 19:56:31] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-18 19:56:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 19:56:31] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7179 reset in 657 ms.
Product exploration explored 100000 steps with 7178 reset in 676 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 5 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:56:32] [INFO ] Invariant cache hit.
[2023-03-18 19:56:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 19:56:32] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-18 19:56:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property Sudoku-COL-BN04-LTLCardinality-05 finished in 5492 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 19:56:33] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-18 19:56:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Dead Transitions using invariants and state equation in 40 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 137 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-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 29 steps with 1 reset in 2 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-07 finished in 254 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 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.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-18 19:56:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Dead Transitions using invariants and state equation in 39 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 182 ms. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], 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 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-09 finished in 236 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&&X(F(p1)))))'
Support contains 80 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 3 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 19:56:33] [INFO ] Computed 64 place invariants in 4 ms
[2023-03-18 19:56:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-18 19:56:33] [INFO ] Invariant cache hit.
[2023-03-18 19:56:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-COL-BN04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT 2 (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 s50 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-10 finished in 353 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(G(p1))))))'
Support contains 80 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 6 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 19:56:34] [INFO ] Invariant cache hit.
[2023-03-18 19:56:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 19:56:34] [INFO ] Invariant cache hit.
[2023-03-18 19:56:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-18 19:56:34] [INFO ] Invariant cache hit.
[2023-03-18 19:56:34] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-LTLCardinality-14 finished in 414 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 19:56:34] [INFO ] Flatten gal took : 16 ms
[2023-03-18 19:56:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-18 19:56:34] [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 11032 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-BN04
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679169426006

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/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: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type SKEL/SRCH) for 0 Sudoku-COL-BN04-LTLCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SKEL/SRCH) for Sudoku-COL-BN04-LTLCardinality-05
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 5 (type EXCL) for 0 Sudoku-COL-BN04-LTLCardinality-05
lola: time limit : 1800 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-COL-BN04-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1800 7/32 Sudoku-COL-BN04-LTLCardinality-05 859177 m, 171835 m/sec, 5700599 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-COL-BN04-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1800 12/32 Sudoku-COL-BN04-LTLCardinality-05 1620911 m, 152346 m/sec, 11247830 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-COL-BN04-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1800 17/32 Sudoku-COL-BN04-LTLCardinality-05 2387450 m, 153307 m/sec, 16796440 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-COL-BN04-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/1800 23/32 Sudoku-COL-BN04-LTLCardinality-05 3194754 m, 161460 m/sec, 22228643 t fired, .

Time elapsed: 20 secs. Pages in use: 23
# 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-COL-BN04-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/1800 28/32 Sudoku-COL-BN04-LTLCardinality-05 3957198 m, 152488 m/sec, 27730701 t fired, .

Time elapsed: 25 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 5 (type EXCL) for Sudoku-COL-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-COL-BN04-LTLCardinality-05: CONJ 0 1 0 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: LAUNCH task # 3 (type EXCL) for 0 Sudoku-COL-BN04-LTLCardinality-05
lola: time limit : 3570 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for Sudoku-COL-BN04-LTLCardinality-05
lola: result : true
lola: markings : 65
lola: fired transitions : 64
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-BN04-LTLCardinality-05: CONJ unknown CONJ


Time elapsed: 30 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-COL-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-COL-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-167912702700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN04.tgz
mv Sudoku-COL-BN04 execution
cd execution
if [ "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 ;