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-167912702500003.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-AN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702500003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.7K Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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 3.3K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 09:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:15 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 6.5K 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-AN01-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679158563015

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-AN01
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 16:56:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 16:56:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 16:56:04] [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 16:56:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 16:56:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 425 ms
[2023-03-18 16:56:05] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4 PT places and 1.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 16:56:05] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 16:56:05] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 16:56:08] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 16:56:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 16:56:08] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:9
[2023-03-18 16:56:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-18 16:56:08] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 16:56:08] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2023-03-18 16:56:08] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN01-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 16:56:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 16:56:08] [INFO ] Unfolded HLPN to a Petri net with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 16:56:08] [INFO ] Unfolded 3 HLPN properties in 1 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 6 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:08] [INFO ] Invariant cache hit.
[2023-03-18 16:56:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 16:56:08] [INFO ] Invariant cache hit.
[2023-03-18 16:56:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-18 16:56:08] [INFO ] Invariant cache hit.
[2023-03-18 16:56:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 4/4 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-18 16:56:08] [INFO ] Flatten gal took : 2 ms
[2023-03-18 16:56:08] [INFO ] Flatten gal took : 2 ms
[2023-03-18 16:56:08] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 16:56:08] [INFO ] Invariant cache hit.
[2023-03-18 16:56:09] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 16:56:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 16:56:09] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/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 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 2 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 16:56:09] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 16:56:09] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 16:56:09] [INFO ] Invariant cache hit.
[2023-03-18 16:56:09] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-18 16:56:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:56:09] [INFO ] Invariant cache hit.
[2023-03-18 16:56:09] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-07 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 s0 s1)], 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 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 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 p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 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 p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 16:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:10] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-18 16:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:56:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 16:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-18 16:56:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 16:56:10] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 16:56:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 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 36 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 143 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 16:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:10] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 16:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:56:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 16:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:10] [INFO ] [Nat]Absence check using state equation in 0 ms returned sat
[2023-03-18 16:56:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 16:56:10] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 16:56:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property Sudoku-COL-AN01-LTLCardinality-07 finished in 1737 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(G(p0)) U (F(p0)&&p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2 transition count 1
Applied a total of 2 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 16:56:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 16:56:10] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 16:56:10] [INFO ] Invariant cache hit.
[2023-03-18 16:56:10] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 1 s0) (LEQ s1 s0)), p0:(LEQ 1 s0)], 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 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN01-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLCardinality-10 finished in 293 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(X(G(p0))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Applied a total of 3 rules in 0 ms. Remains 1 /4 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 16:56:11] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 16:56:11] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 16:56:11] [INFO ] Invariant cache hit.
[2023-03-18 16:56:11] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-18 16:56:11] [INFO ] Invariant cache hit.
[2023-03-18 16:56:11] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 29 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:56:12] [INFO ] Invariant cache hit.
[2023-03-18 16:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:12] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-18 16:56:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 16:56:12] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:12] [INFO ] Invariant cache hit.
[2023-03-18 16:56:12] [INFO ] Implicit Places using invariants in 11 ms returned []
[2023-03-18 16:56:12] [INFO ] Invariant cache hit.
[2023-03-18 16:56:12] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2023-03-18 16:56:12] [INFO ] Invariant cache hit.
[2023-03-18 16:56:12] [INFO ] Dead Transitions using invariants and state equation in 11 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:56:12] [INFO ] Invariant cache hit.
[2023-03-18 16:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 16:56:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 16:56:12] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 31 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:56:13] [INFO ] Invariant cache hit.
[2023-03-18 16:56:13] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20 ms. Remains : 1/1 places, 1/1 transitions.
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:13] [INFO ] Invariant cache hit.
[2023-03-18 16:56:13] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 16:56:13] [INFO ] Invariant cache hit.
[2023-03-18 16:56:13] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-18 16:56:13] [INFO ] Invariant cache hit.
[2023-03-18 16:56:13] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 1/1 places, 1/1 transitions.
Treatment of property Sudoku-COL-AN01-LTLCardinality-12 finished in 2111 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)))'
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(X(G(p0))))'
Found a Lengthening insensitive property : Sudoku-COL-AN01-LTLCardinality-12
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 1 /4 variables (removed 3) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:13] [INFO ] Invariant cache hit.
[2023-03-18 16:56:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 16:56:13] [INFO ] Invariant cache hit.
[2023-03-18 16:56:13] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 16:56:13] [INFO ] Invariant cache hit.
[2023-03-18 16:56:13] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1/4 places, 1/1 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54 ms. Remains : 1/4 places, 1/1 transitions.
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:56:14] [INFO ] Invariant cache hit.
[2023-03-18 16:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:14] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-18 16:56:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 16:56:14] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:14] [INFO ] Invariant cache hit.
[2023-03-18 16:56:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 16:56:14] [INFO ] Invariant cache hit.
[2023-03-18 16:56:14] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-18 16:56:14] [INFO ] Invariant cache hit.
[2023-03-18 16:56:14] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:56:14] [INFO ] Invariant cache hit.
[2023-03-18 16:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:56:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 16:56:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 16:56:14] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 32 ms.
Product exploration explored 100000 steps with 50000 reset in 32 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:56:15] [INFO ] Invariant cache hit.
[2023-03-18 16:56:15] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18 ms. Remains : 1/1 places, 1/1 transitions.
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 16:56:15] [INFO ] Invariant cache hit.
[2023-03-18 16:56:15] [INFO ] Implicit Places using invariants in 11 ms returned []
[2023-03-18 16:56:15] [INFO ] Invariant cache hit.
[2023-03-18 16:56:15] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-18 16:56:15] [INFO ] Invariant cache hit.
[2023-03-18 16:56:15] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 1/1 places, 1/1 transitions.
Treatment of property Sudoku-COL-AN01-LTLCardinality-12 finished in 2077 ms.
[2023-03-18 16:56:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 16:56:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-18 16:56:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 1 transitions and 4 arcs took 1 ms.
Total runtime 10799 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN01
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA Sudoku-COL-AN01-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-AN01-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679158577601

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-COL-AN01-LTLCardinality-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Sudoku-COL-AN01-LTLCardinality-12
lola: result : true
lola: markings : 3
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-COL-AN01-LTLCardinality-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Sudoku-COL-AN01-LTLCardinality-07
lola: result : true
lola: markings : 3
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN01-LTLCardinality-07: LTL true LTL model checker
Sudoku-COL-AN01-LTLCardinality-12: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-AN01"
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-AN01, 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-167912702500003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN01.tgz
mv Sudoku-COL-AN01 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 ;