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.r519-tall-167987245100308.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 Murphy-COL-D3N050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245100308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 7 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 7 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D3N050-LTLFireability-00
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-01
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-02
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-03
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-04
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-05
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-06
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-07
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-08
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-09
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-10
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-11
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-12
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-13
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-14
FORMULA_NAME Murphy-COL-D3N050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680938617064

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D3N050
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-08 07:23:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 07:23:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:23:38] [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-04-08 07:23:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:23:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 641 ms
[2023-04-08 07:23:39] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 28.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:23:39] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-08 07:23:39] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA Murphy-COL-D3N050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
[2023-04-08 07:23:39] [INFO ] Flatten gal took : 13 ms
[2023-04-08 07:23:39] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:23:39] [INFO ] Unfolded HLPN to a Petri net with 24 places and 28 transitions 108 arcs in 6 ms.
[2023-04-08 07:23:39] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D3N050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:23:39] [INFO ] Computed 5 invariants in 7 ms
[2023-04-08 07:23:39] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
[2023-04-08 07:23:39] [INFO ] Invariant cache hit.
[2023-04-08 07:23:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:23:39] [INFO ] Invariant cache hit.
[2023-04-08 07:23:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:39] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-08 07:23:39] [INFO ] Invariant cache hit.
[2023-04-08 07:23:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-04-08 07:23:39] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:23:39] [INFO ] Flatten gal took : 7 ms
[2023-04-08 07:23:39] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 18) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:23:40] [INFO ] Invariant cache hit.
[2023-04-08 07:23:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:23:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:23:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:23:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:40] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:23:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:40] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:23:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 3 ms to minimize.
[2023-04-08 07:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-08 07:23:40] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-08 07:23:40] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 32 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 13 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:40] [INFO ] Invariant cache hit.
[2023-04-08 07:23:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 337650 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337650 steps, saw 229263 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:43] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:43] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:23:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:43] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-04-08 07:23:43] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:23:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:43] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:23:43] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2023-04-08 07:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-04-08 07:23:44] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-08 07:23:44] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-08 07:23:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-04-08 07:23:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:44] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:23:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:23:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:44] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:23:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:44] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:23:44] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-08 07:23:44] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA Murphy-COL-D3N050-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Murphy-COL-D3N050-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((!p1&&(X(p2)||F(p3)))))))'
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 24/24 places, 28/28 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 566 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p0 (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p3) p0 (NOT p2)), acceptance={0} source=5 dest: 8}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=8 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p3) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(OR (AND (GEQ s13 2) (GEQ s17 1)) (AND (GEQ s12 2) (GEQ s16 1)) (AND (GEQ s14 2) (GEQ s18 1)) (AND (GEQ s15 2) (GEQ s19 1))), p0:(OR (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 36 reset in 385 ms.
Product exploration explored 100000 steps with 35 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 17 factoid took 448 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:47] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:47] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2023-04-08 07:23:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:47] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-04-08 07:23:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:47] [INFO ] After 38ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-04-08 07:23:47] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-08 07:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:23:47] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2023-04-08 07:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-08 07:23:47] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-08 07:23:47] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10048 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=233 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 208723 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208723 steps, saw 141799 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-08 07:23:51] [INFO ] Invariant cache hit.
[2023-04-08 07:23:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:23:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:23:51] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:51] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:23:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:51] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:23:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-08 07:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-08 07:23:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-08 07:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-08 07:23:51] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-08 07:23:51] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 63 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:51] [INFO ] Invariant cache hit.
[2023-04-08 07:23:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-08 07:23:51] [INFO ] Invariant cache hit.
[2023-04-08 07:23:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-08 07:23:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:23:51] [INFO ] Invariant cache hit.
[2023-04-08 07:23:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-04-08 07:23:51] [INFO ] Invariant cache hit.
[2023-04-08 07:23:51] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:23:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:51] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:23:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:51] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:51] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:23:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:51] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:23:51] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-08 07:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-08 07:23:51] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-08 07:23:51] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p3)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 20 factoid took 742 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 368 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:53] [INFO ] Invariant cache hit.
[2023-04-08 07:23:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:23:53] [INFO ] Invariant cache hit.
[2023-04-08 07:23:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:23:53] [INFO ] Invariant cache hit.
[2023-04-08 07:23:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-08 07:23:53] [INFO ] Invariant cache hit.
[2023-04-08 07:23:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 24/24 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 354 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:23:54] [INFO ] Invariant cache hit.
[2023-04-08 07:23:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:54] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:54] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:23:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:54] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:54] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:23:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:54] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:23:54] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-08 07:23:54] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 48 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:54] [INFO ] Invariant cache hit.
[2023-04-08 07:23:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 433693 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 433693 steps, saw 292753 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:23:57] [INFO ] Invariant cache hit.
[2023-04-08 07:23:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:23:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:23:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:23:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:57] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:23:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:57] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:23:57] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-08 07:23:58] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 53 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:23:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:58] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:23:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:23:58] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:23:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:23:58] [INFO ] After 26ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:23:58] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-08 07:23:58] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 (NOT p3) (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND (NOT p0) (NOT p3) (NOT p2)))]
Knowledge based reduction with 12 factoid took 707 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 355 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 377 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 37 reset in 210 ms.
Product exploration explored 100000 steps with 39 reset in 234 ms.
Applying partial POR strategy [false, false, true, false, true, false, true, true, false]
Stuttering acceptance computed with spot in 449 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:24:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 24/24 places, 28/28 transitions.
Treatment of property Murphy-COL-D3N050-LTLFireability-00 finished in 16786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(!p0)||G(((G(p1) U X(p1)) U p0))))'
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 212 ms :[false, (NOT p0), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0)), true, (AND p0 p1)]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s6 1))), p1:(OR (AND (GEQ s3 3) (GEQ s11 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42801 steps with 15 reset in 75 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-01 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0||X((X(G(p2))||p1))))))'
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 26 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s6 1))), p1:(OR (AND (GEQ s0 1) (GEQ s4 1)...], 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]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Stack based approach found an accepted trace after 20147 steps with 0 reset with depth 20148 and stack size 19598 in 68 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-02 finished in 485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] Implicit Places using invariants in 25 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 26 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1) (OR (LT s0 1) (LT s4 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-05 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:02] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-08 07:24:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (LT s20 3) (LT s21 3) (LT s22 3) (LT s23 3)), p1:(OR (AND (LT s12 1) (LT s13 1) (LT s14 1) (LT s15 1)) (AND (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2854 reset in 186 ms.
Stack based approach found an accepted trace after 138 steps with 4 reset with depth 46 and stack size 46 in 2 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-06 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X(p2)||p1)))'
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1)), p2:(OR (AND (GEQ s13 2) (GEQ s17 1)) (AND (GEQ s12 2) (GEQ s16 1)) (AND (GEQ s14 2) (GEQ s18 1)) ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26807 reset in 176 ms.
Stack based approach found an accepted trace after 879 steps with 238 reset with depth 7 and stack size 7 in 2 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-08 finished in 441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s3 3) (GEQ s11 1) (GEQ s19 1)) (AND (GEQ s2 3) (GEQ s10 1) (GEQ s18 1)) (AND (GEQ s0 3) (GEQ s8 1) (GEQ s16 1)) (AND (GEQ s1 3) (GEQ s9 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D3N050-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D3N050-LTLFireability-10 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(F(!p0))||(X(F(!p0))&&p1)))||(p2&&X((F(p3)||G(p2)))))))'
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:24:04] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:24:04] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 07:24:04] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 373 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3) (NOT p2)), (AND p0 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(OR p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p2 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (OR (LT s13 2) (LT s17 1)) (OR (LT s12 2) (LT s16 1)) (OR (LT s14 2) (LT s18 1)) (OR (LT s15 2) (LT s19 1))), p2:(OR (AND (GEQ s0 1) (GEQ s4 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (AND p1 p2)), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR p0 p1))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 21 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D3N050-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D3N050-LTLFireability-11 finished in 891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(!p1)&&p0))||(F(!p1)&&F(G(p3))&&p2))))'
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:04] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:24:04] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:24:04] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-08 07:24:04] [INFO ] Invariant cache hit.
[2023-04-08 07:24:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR p1 (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, p1, (OR (NOT p0) p1), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND p1 (NOT p3))]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 5}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 p3), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1))), p2:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s1 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-12 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:05] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-08 07:24:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 45 ms :[p0]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s9 1)) (AND (GEQ s3 1) (GEQ s7 1) (G...], 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 0 reset in 186 ms.
Stack based approach found an accepted trace after 193 steps with 0 reset with depth 194 and stack size 194 in 0 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-13 finished in 389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(!p0))||G(p1))))'
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:05] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:24:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 24/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 412 ms :[true, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p0:(OR (AND (GEQ s13 2) (GEQ s17 1)) (AND (GEQ s12 2) (GEQ s16 1)) (AND (GEQ s14 2) (GEQ s18 1)) (AND (GEQ s15 2) (GEQ s19 1))), p1:(AND (OR (AND (GEQ s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 396 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 108 ms. Reduced automaton from 6 states, 17 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 258061 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 258061 steps, saw 174948 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-08 07:24:10] [INFO ] Invariant cache hit.
[2023-04-08 07:24:10] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:10] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:10] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-04-08 07:24:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:10] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:10] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-04-08 07:24:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:10] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-04-08 07:24:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2023-04-08 07:24:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:24:10] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-08 07:24:10] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:10] [INFO ] Invariant cache hit.
[2023-04-08 07:24:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 246086 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246086 steps, saw 167225 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-08 07:24:13] [INFO ] Invariant cache hit.
[2023-04-08 07:24:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:13] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:13] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:13] [INFO ] After 29ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:14] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2023-04-08 07:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:24:14] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-08 07:24:14] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 45 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:14] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-08 07:24:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:14] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:14] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:14] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:14] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-08 07:24:14] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 128 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, p0]
Stuttering acceptance computed with spot in 59 ms :[true, p0]
Support contains 8 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:14] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-08 07:24:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:24:14] [INFO ] Invariant cache hit.
[2023-04-08 07:24:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 24/24 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, p0]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1980309 steps, run timeout after 3002 ms. (steps per millisecond=659 ) properties seen :{}
Probabilistic random walk after 1980309 steps, saw 1346645 distinct states, run finished after 3002 ms. (steps per millisecond=659 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:24:17] [INFO ] Invariant cache hit.
[2023-04-08 07:24:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:17] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:18] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:18] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:18] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-08 07:24:18] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Graph (complete) has 92 edges and 24 vertex of which 12 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 12 transition count 16
Applied a total of 5 rules in 3 ms. Remains 12 /24 variables (removed 12) and now considering 16/28 (removed 12) transitions.
// Phase 1: matrix 16 rows 12 cols
[2023-04-08 07:24:18] [INFO ] Computed 0 invariants in 1 ms
[2023-04-08 07:24:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 12/24 places, 16/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Probably explored full state space saw : 1296 states, properties seen :0
Probabilistic random walk after 8208 steps, saw 1296 distinct states, run finished after 9 ms. (steps per millisecond=912 ) properties seen :0
Explored full state space saw : 1296 states, properties seen :0
Exhaustive walk after 8208 steps, saw 1296 distinct states, run finished after 7 ms. (steps per millisecond=1172 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (G (NOT p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D3N050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D3N050-LTLFireability-14 finished in 12405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:24:18] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:24:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:18] [INFO ] Invariant cache hit.
[2023-04-08 07:24:18] [INFO ] Implicit Places using invariants in 28 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2665 steps with 0 reset in 11 ms.
FORMULA Murphy-COL-D3N050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D3N050-LTLFireability-15 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((!p1&&(X(p2)||F(p3)))))))'
Found a Lengthening insensitive property : Murphy-COL-D3N050-LTLFireability-00
Stuttering acceptance computed with spot in 391 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:18] [INFO ] Invariant cache hit.
[2023-04-08 07:24:18] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:18] [INFO ] Invariant cache hit.
[2023-04-08 07:24:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:24:18] [INFO ] Invariant cache hit.
[2023-04-08 07:24:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:18] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 07:24:18] [INFO ] Invariant cache hit.
[2023-04-08 07:24:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 122 ms. Remains : 24/24 places, 28/28 transitions.
Running random walk in product with property : Murphy-COL-D3N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p0 (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p3) p0 (NOT p2)), acceptance={0} source=5 dest: 8}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=8 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p3) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(OR (AND (GEQ s13 2) (GEQ s17 1)) (AND (GEQ s12 2) (GEQ s16 1)) (AND (GEQ s14 2) (GEQ s18 1)) (AND (GEQ s15 2) (GEQ s19 1))), p0:(OR (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35 reset in 222 ms.
Product exploration explored 100000 steps with 37 reset in 221 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 17 factoid took 358 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-08 07:24:20] [INFO ] Invariant cache hit.
[2023-04-08 07:24:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:20] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2023-04-08 07:24:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:20] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-04-08 07:24:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:20] [INFO ] After 38ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-04-08 07:24:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-08 07:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-08 07:24:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-08 07:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:24:20] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-08 07:24:20] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:20] [INFO ] Invariant cache hit.
[2023-04-08 07:24:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10032 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=257 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 279495 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279495 steps, saw 189438 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-08 07:24:23] [INFO ] Invariant cache hit.
[2023-04-08 07:24:23] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:24:23] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:24] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:24] [INFO ] After 37ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2023-04-08 07:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-08 07:24:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-08 07:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-08 07:24:24] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-08 07:24:24] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 80 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:24] [INFO ] Invariant cache hit.
[2023-04-08 07:24:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:24:24] [INFO ] Invariant cache hit.
[2023-04-08 07:24:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:24:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:24] [INFO ] Invariant cache hit.
[2023-04-08 07:24:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-04-08 07:24:24] [INFO ] Invariant cache hit.
[2023-04-08 07:24:24] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:24] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:24] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:24] [INFO ] After 29ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-08 07:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-08 07:24:24] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-08 07:24:24] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p3)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 20 factoid took 710 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 372 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:26] [INFO ] Invariant cache hit.
[2023-04-08 07:24:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:26] [INFO ] Invariant cache hit.
[2023-04-08 07:24:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:24:26] [INFO ] Invariant cache hit.
[2023-04-08 07:24:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-08 07:24:26] [INFO ] Invariant cache hit.
[2023-04-08 07:24:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 24/24 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 345 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=173 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:24:27] [INFO ] Invariant cache hit.
[2023-04-08 07:24:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:27] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:27] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:27] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:27] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:27] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-08 07:24:27] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 40 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:27] [INFO ] Invariant cache hit.
[2023-04-08 07:24:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10029 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=323 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 277553 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277553 steps, saw 188038 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:30] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:30] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:30] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:30] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-08 07:24:30] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 38 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:30] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-08 07:24:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:30] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:31] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:31] [INFO ] After 29ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:31] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-08 07:24:31] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 (NOT p3) (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND (NOT p0) (NOT p3) (NOT p2)))]
Knowledge based reduction with 12 factoid took 680 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 362 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 368 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 36 reset in 198 ms.
Product exploration explored 100000 steps with 36 reset in 207 ms.
Applying partial POR strategy [false, false, true, false, true, false, true, true, false]
Stuttering acceptance computed with spot in 392 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3) p2) (AND (NOT p1) (NOT p3) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:33] [INFO ] Invariant cache hit.
[2023-04-08 07:24:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:33] [INFO ] Invariant cache hit.
[2023-04-08 07:24:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:33] [INFO ] Invariant cache hit.
[2023-04-08 07:24:33] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:33] [INFO ] Invariant cache hit.
[2023-04-08 07:24:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:24:33] [INFO ] Invariant cache hit.
[2023-04-08 07:24:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-08 07:24:33] [INFO ] Invariant cache hit.
[2023-04-08 07:24:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 24/24 places, 28/28 transitions.
Treatment of property Murphy-COL-D3N050-LTLFireability-00 finished in 15706 ms.
[2023-04-08 07:24:34] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:24:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-08 07:24:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 0 ms.
Total runtime 55528 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Murphy-COL-D3N050
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Murphy-COL-D3N050-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680938675191

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Murphy-COL-D3N050-LTLFireability-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Murphy-COL-D3N050-LTLFireability-00
lola: result : false
lola: markings : 226
lola: fired transitions : 276
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Murphy-COL-D3N050-LTLFireability-00: LTL false 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="Murphy-COL-D3N050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Murphy-COL-D3N050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r519-tall-167987245100308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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