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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:22 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 DES-PT-10a-LTLCardinality-00
FORMULA_NAME DES-PT-10a-LTLCardinality-01
FORMULA_NAME DES-PT-10a-LTLCardinality-02
FORMULA_NAME DES-PT-10a-LTLCardinality-03
FORMULA_NAME DES-PT-10a-LTLCardinality-04
FORMULA_NAME DES-PT-10a-LTLCardinality-05
FORMULA_NAME DES-PT-10a-LTLCardinality-06
FORMULA_NAME DES-PT-10a-LTLCardinality-07
FORMULA_NAME DES-PT-10a-LTLCardinality-08
FORMULA_NAME DES-PT-10a-LTLCardinality-09
FORMULA_NAME DES-PT-10a-LTLCardinality-10
FORMULA_NAME DES-PT-10a-LTLCardinality-11
FORMULA_NAME DES-PT-10a-LTLCardinality-12
FORMULA_NAME DES-PT-10a-LTLCardinality-13
FORMULA_NAME DES-PT-10a-LTLCardinality-14
FORMULA_NAME DES-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678293511753

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 16:38:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 16:38:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 16:38:33] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-08 16:38:33] [INFO ] Transformed 155 places.
[2023-03-08 16:38:33] [INFO ] Transformed 112 transitions.
[2023-03-08 16:38:33] [INFO ] Found NUPN structural information;
[2023-03-08 16:38:33] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-10a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Applied a total of 0 rules in 15 ms. Remains 155 /155 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 155 cols
[2023-03-08 16:38:33] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-08 16:38:33] [INFO ] Implicit Places using invariants in 266 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/155 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 154/155 places, 98/98 transitions.
Support contains 29 out of 154 places after structural reductions.
[2023-03-08 16:38:34] [INFO ] Flatten gal took : 36 ms
[2023-03-08 16:38:34] [INFO ] Flatten gal took : 15 ms
[2023-03-08 16:38:34] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 227 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 98 rows 154 cols
[2023-03-08 16:38:34] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 16:38:34] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 16:38:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 16:38:34] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:38:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 16:38:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 105 ms returned sat
[2023-03-08 16:38:35] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:38:35] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-08 16:38:35] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 98/98 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 153 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 153 transition count 95
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 36 ms. Remains 152 /154 variables (removed 2) and now considering 94/98 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 152/154 places, 94/98 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:38:35] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 16:38:35] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 16:38:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 16:38:35] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 16:38:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2023-03-08 16:38:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2023-03-08 16:38:35] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 16:38:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:38:35] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 16:38:35] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 16:38:35] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 20 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 152/152 places, 94/94 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:38:35] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 16:38:36] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 16:38:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 16:38:36] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:38:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 16:38:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2023-03-08 16:38:36] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:38:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:38:36] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 16:38:36] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 16:38:36] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 152/152 places, 94/94 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1825030 steps, run timeout after 3001 ms. (steps per millisecond=608 ) properties seen :{}
Probabilistic random walk after 1825030 steps, saw 254590 distinct states, run finished after 3002 ms. (steps per millisecond=607 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 16:38:39] [INFO ] Invariant cache hit.
[2023-03-08 16:38:39] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 16:38:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 16:38:39] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:38:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 16:38:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2023-03-08 16:38:39] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:38:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:38:39] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 16:38:39] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 16:38:39] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 16:38:39] [INFO ] Invariant cache hit.
[2023-03-08 16:38:39] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 16:38:39] [INFO ] Invariant cache hit.
[2023-03-08 16:38:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:38:39] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 16:38:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:38:39] [INFO ] Invariant cache hit.
[2023-03-08 16:38:39] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 9 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:38:39] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 16:38:39] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 16:38:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 16:38:39] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:38:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 3 ms returned sat
[2023-03-08 16:38:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-08 16:38:40] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:38:40] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 16:38:40] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA DES-PT-10a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 57 stabilizing places and 52 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 15 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:38:40] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 16:38:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 16:38:40] [INFO ] Invariant cache hit.
[2023-03-08 16:38:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 16:38:40] [INFO ] Invariant cache hit.
[2023-03-08 16:38:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s7 0) (EQ s54 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 434 ms.
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 16:38:42] [INFO ] Invariant cache hit.
[2023-03-08 16:38:42] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:38:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 16:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:38:42] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-08 16:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:38:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 16:38:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 16:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:38:43] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-08 16:38:43] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 16:38:43] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:38:43] [INFO ] Invariant cache hit.
[2023-03-08 16:38:43] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 16:38:43] [INFO ] Invariant cache hit.
[2023-03-08 16:38:43] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 16:38:43] [INFO ] Invariant cache hit.
[2023-03-08 16:38:43] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 16:38:44] [INFO ] Invariant cache hit.
[2023-03-08 16:38:44] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 16:38:44] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 16:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:38:44] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-08 16:38:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:38:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:38:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 16:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:38:44] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-08 16:38:44] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-08 16:38:44] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 209 ms.
Product exploration explored 100000 steps with 25000 reset in 222 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:38:45] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 16:38:45] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-01 finished in 6124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 10 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 16:38:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s123 1), p1:(AND (EQ s131 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-02 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 9 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:38:46] [INFO ] Invariant cache hit.
[2023-03-08 16:38:46] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 16:38:47] [INFO ] Invariant cache hit.
[2023-03-08 16:38:47] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-04 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 (NEQ s49 0) (NEQ s150 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 DES-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-04 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((!p1 U X(p2)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 154 cols
[2023-03-08 16:38:47] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 16:38:47] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 16:38:47] [INFO ] Invariant cache hit.
[2023-03-08 16:38:47] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 16:38:47] [INFO ] Invariant cache hit.
[2023-03-08 16:38:47] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 154/154 places, 98/98 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : DES-PT-10a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s82 0) (EQ s111 1)), p1:(OR (EQ s111 0) (EQ s82 1)), p2:(AND (OR (EQ s117 0) (EQ s147 1)) (OR (EQ s111 0) (EQ s82 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]]
Stuttering criterion allowed to conclude after 45 steps with 2 reset in 1 ms.
FORMULA DES-PT-10a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-05 finished in 629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 7 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:38:47] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 16:38:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:38:47] [INFO ] Invariant cache hit.
[2023-03-08 16:38:48] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 16:38:48] [INFO ] Invariant cache hit.
[2023-03-08 16:38:48] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s92 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 96 steps with 1 reset in 1 ms.
FORMULA DES-PT-10a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-06 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 8 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:38:48] [INFO ] Invariant cache hit.
[2023-03-08 16:38:48] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:38:48] [INFO ] Invariant cache hit.
[2023-03-08 16:38:48] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 16:38:48] [INFO ] Invariant cache hit.
[2023-03-08 16:38:48] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s136 0) (EQ s17 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 263 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLCardinality-08 finished in 963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 7 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:38:49] [INFO ] Invariant cache hit.
[2023-03-08 16:38:49] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:38:49] [INFO ] Invariant cache hit.
[2023-03-08 16:38:49] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 16:38:49] [INFO ] Invariant cache hit.
[2023-03-08 16:38:49] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-09 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 (EQ s78 0) (EQ s3 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 29 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-09 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(!p1 U X(!p2))))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 7 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:38:49] [INFO ] Invariant cache hit.
[2023-03-08 16:38:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 16:38:49] [INFO ] Invariant cache hit.
[2023-03-08 16:38:49] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-08 16:38:49] [INFO ] Invariant cache hit.
[2023-03-08 16:38:49] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : DES-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s151 1)), p1:(OR (EQ s33 0) (EQ s20 1)), p2:(OR (EQ s105 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33385 reset in 274 ms.
Product exploration explored 100000 steps with 33477 reset in 330 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 948 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:38:52] [INFO ] Invariant cache hit.
[2023-03-08 16:38:52] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:38:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:38:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 16:38:52] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:38:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-08 16:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 16:38:52] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-08 16:38:52] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Applied a total of 8 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 144 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1015796 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1015796 steps, saw 143649 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:38:55] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 16:38:55] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:38:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:38:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-08 16:38:56] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:38:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:38:56] [INFO ] After 80ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:38:56] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-08 16:38:56] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 16:38:56] [INFO ] Invariant cache hit.
[2023-03-08 16:38:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:38:56] [INFO ] Invariant cache hit.
[2023-03-08 16:38:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:38:56] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 16:38:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:38:56] [INFO ] Invariant cache hit.
[2023-03-08 16:38:56] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 153/153 places, 95/95 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 95
Applied a total of 1 rules in 13 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:38:56] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 16:38:56] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:38:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:38:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 16:38:57] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:38:57] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-08 16:38:57] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2023-03-08 16:38:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-08 16:38:57] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-08 16:38:57] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 20 factoid took 996 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:38:58] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 16:38:58] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:38:58] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 16:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:38:58] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-08 16:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:38:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 16:38:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 16:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:38:58] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-08 16:38:58] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 16:38:59] [INFO ] Added : 75 causal constraints over 15 iterations in 190 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:38:59] [INFO ] Invariant cache hit.
[2023-03-08 16:38:59] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 16:38:59] [INFO ] Invariant cache hit.
[2023-03-08 16:38:59] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 16:38:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:38:59] [INFO ] Invariant cache hit.
[2023-03-08 16:38:59] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 778 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 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 48 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:39:00] [INFO ] Invariant cache hit.
[2023-03-08 16:39:00] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:00] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-08 16:39:00] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-08 16:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-08 16:39:00] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-08 16:39:01] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Applied a total of 8 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1216400 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 1216400 steps, saw 170383 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:39:04] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 16:39:04] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 16:39:04] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:39:04] [INFO ] After 75ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:04] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-08 16:39:04] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 849 steps, including 3 resets, run visited all 3 properties in 11 ms. (steps per millisecond=77 )
Parikh walk visited 3 properties in 18 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p1) p2)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (AND p0 (NOT p1))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 18 factoid took 851 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:39:05] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 16:39:05] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:39:05] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 16:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:06] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-08 16:39:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:39:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 16:39:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 16:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:06] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-08 16:39:06] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 16:39:06] [INFO ] Added : 75 causal constraints over 15 iterations in 178 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 24879 reset in 289 ms.
Product exploration explored 100000 steps with 25150 reset in 304 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:07] [INFO ] Invariant cache hit.
[2023-03-08 16:39:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 16:39:07] [INFO ] Invariant cache hit.
[2023-03-08 16:39:07] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 16:39:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:39:07] [INFO ] Invariant cache hit.
[2023-03-08 16:39:07] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-11 finished in 17954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 13 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:39:07] [INFO ] Invariant cache hit.
[2023-03-08 16:39:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:39:07] [INFO ] Invariant cache hit.
[2023-03-08 16:39:07] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 16:39:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:39:07] [INFO ] Invariant cache hit.
[2023-03-08 16:39:07] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s96 1))], 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 2221 reset in 188 ms.
Product exploration explored 100000 steps with 2244 reset in 211 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:08] [INFO ] Invariant cache hit.
[2023-03-08 16:39:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:39:08] [INFO ] Invariant cache hit.
[2023-03-08 16:39:09] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 16:39:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:39:09] [INFO ] Invariant cache hit.
[2023-03-08 16:39:09] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2214 reset in 192 ms.
Product exploration explored 100000 steps with 2205 reset in 246 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:09] [INFO ] Invariant cache hit.
[2023-03-08 16:39:10] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:39:10] [INFO ] Invariant cache hit.
[2023-03-08 16:39:10] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 16:39:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:39:10] [INFO ] Invariant cache hit.
[2023-03-08 16:39:10] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-13 finished in 2682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 96
Applied a total of 2 rules in 7 ms. Remains 152 /154 variables (removed 2) and now considering 96/98 (removed 2) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 16:39:10] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 16:39:10] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 16:39:10] [INFO ] Invariant cache hit.
[2023-03-08 16:39:10] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 16:39:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:39:10] [INFO ] Invariant cache hit.
[2023-03-08 16:39:10] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/154 places, 96/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 152/154 places, 96/98 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2298 reset in 181 ms.
Product exploration explored 100000 steps with 2259 reset in 201 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Detected a total of 55/152 stabilizing places and 50/96 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 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 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1936448 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :{}
Probabilistic random walk after 1936448 steps, saw 263093 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 16:39:14] [INFO ] Invariant cache hit.
[2023-03-08 16:39:14] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:39:14] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:14] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 27 ms returned sat
[2023-03-08 16:39:14] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:39:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-08 16:39:14] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-08 16:39:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2023-03-08 16:39:14] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 16:39:14] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 96/96 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 94
Applied a total of 3 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 94/96 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 152/152 places, 94/96 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1886468 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{}
Probabilistic random walk after 1886468 steps, saw 260163 distinct states, run finished after 3001 ms. (steps per millisecond=628 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:39:17] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 16:39:17] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:39:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2023-03-08 16:39:17] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:39:17] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 16:39:17] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 506 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=168 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 210 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 16:39:18] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 16:39:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 16:39:18] [INFO ] Invariant cache hit.
[2023-03-08 16:39:18] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 16:39:18] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 16:39:18] [INFO ] Invariant cache hit.
[2023-03-08 16:39:18] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 152/152 places, 96/96 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Detected a total of 55/152 stabilizing places and 50/96 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 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 64 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1919339 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1919339 steps, saw 260637 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 16:39:21] [INFO ] Invariant cache hit.
[2023-03-08 16:39:21] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:39:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:21] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 16:39:21] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:39:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-08 16:39:21] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-08 16:39:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-08 16:39:21] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 16:39:21] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 96/96 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 94
Applied a total of 3 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 94/96 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 152/152 places, 94/96 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1937840 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :{}
Probabilistic random walk after 1937840 steps, saw 266429 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:39:24] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 16:39:25] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:39:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 16:39:25] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:39:25] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 16:39:25] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 434 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=144 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2295 reset in 177 ms.
Product exploration explored 100000 steps with 2267 reset in 193 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 16:39:25] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 16:39:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 16:39:26] [INFO ] Invariant cache hit.
[2023-03-08 16:39:26] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 16:39:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:39:26] [INFO ] Invariant cache hit.
[2023-03-08 16:39:26] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 152/152 places, 96/96 transitions.
Treatment of property DES-PT-10a-LTLCardinality-14 finished in 16039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 2 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:39:26] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 16:39:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 16:39:26] [INFO ] Invariant cache hit.
[2023-03-08 16:39:26] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 16:39:26] [INFO ] Invariant cache hit.
[2023-03-08 16:39:26] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s26 0) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 225 ms.
Product exploration explored 100000 steps with 33333 reset in 239 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLCardinality-15 finished in 934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : DES-PT-10a-LTLCardinality-01
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 12 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:39:27] [INFO ] Invariant cache hit.
[2023-03-08 16:39:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 16:39:27] [INFO ] Invariant cache hit.
[2023-03-08 16:39:27] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 16:39:27] [INFO ] Invariant cache hit.
[2023-03-08 16:39:27] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 290 ms. Remains : 153/154 places, 97/98 transitions.
Running random walk in product with property : DES-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s7 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 204 ms.
Product exploration explored 100000 steps with 25000 reset in 217 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 16:39:28] [INFO ] Invariant cache hit.
[2023-03-08 16:39:28] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 16:39:28] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 16:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:29] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2023-03-08 16:39:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:39:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:39:29] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 16:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:29] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-08 16:39:29] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 8 ms.
[2023-03-08 16:39:29] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:29] [INFO ] Invariant cache hit.
[2023-03-08 16:39:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 16:39:29] [INFO ] Invariant cache hit.
[2023-03-08 16:39:29] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 16:39:29] [INFO ] Invariant cache hit.
[2023-03-08 16:39:29] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 16:39:30] [INFO ] Invariant cache hit.
[2023-03-08 16:39:30] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 16:39:30] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 16:39:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:31] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-08 16:39:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:39:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:39:31] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-08 16:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:31] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-08 16:39:31] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 5 ms.
[2023-03-08 16:39:31] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 206 ms.
Product exploration explored 100000 steps with 25000 reset in 218 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:39:32] [INFO ] Invariant cache hit.
[2023-03-08 16:39:32] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:32] [INFO ] Invariant cache hit.
[2023-03-08 16:39:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:39:32] [INFO ] Invariant cache hit.
[2023-03-08 16:39:32] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-08 16:39:32] [INFO ] Invariant cache hit.
[2023-03-08 16:39:32] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-01 finished in 5431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(!p1 U X(!p2))))))'
Found a Lengthening insensitive property : DES-PT-10a-LTLCardinality-11
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) p2), p2, p2]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 10 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 16:39:32] [INFO ] Invariant cache hit.
[2023-03-08 16:39:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:39:32] [INFO ] Invariant cache hit.
[2023-03-08 16:39:33] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-08 16:39:33] [INFO ] Invariant cache hit.
[2023-03-08 16:39:33] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 288 ms. Remains : 153/154 places, 97/98 transitions.
Running random walk in product with property : DES-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s151 1)), p1:(OR (EQ s33 0) (EQ s20 1)), p2:(OR (EQ s105 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33346 reset in 259 ms.
Product exploration explored 100000 steps with 33364 reset in 287 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 944 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 53 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 49 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 47 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:39:35] [INFO ] Invariant cache hit.
[2023-03-08 16:39:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:35] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-08 16:39:35] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-08 16:39:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 16:39:35] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-08 16:39:35] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Applied a total of 8 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1248772 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :{}
Probabilistic random walk after 1248772 steps, saw 174585 distinct states, run finished after 3005 ms. (steps per millisecond=415 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:39:38] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 16:39:38] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-08 16:39:38] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:39:38] [INFO ] After 77ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:39] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-08 16:39:39] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 16:39:39] [INFO ] Invariant cache hit.
[2023-03-08 16:39:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:39:39] [INFO ] Invariant cache hit.
[2023-03-08 16:39:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:39:39] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-08 16:39:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:39:39] [INFO ] Invariant cache hit.
[2023-03-08 16:39:39] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 153/153 places, 95/95 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 95
Applied a total of 1 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:39:39] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 16:39:39] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 16:39:39] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-08 16:39:39] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-08 16:39:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-08 16:39:39] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-08 16:39:39] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 20 factoid took 1001 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:39:41] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 16:39:41] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:39:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 16:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:41] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-08 16:39:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:39:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 16:39:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 16:39:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:41] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-08 16:39:41] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 16:39:41] [INFO ] Added : 75 causal constraints over 15 iterations in 207 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:41] [INFO ] Invariant cache hit.
[2023-03-08 16:39:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 16:39:41] [INFO ] Invariant cache hit.
[2023-03-08 16:39:42] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 16:39:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:39:42] [INFO ] Invariant cache hit.
[2023-03-08 16:39:42] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 734 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 51 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 47 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 55 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:39:43] [INFO ] Invariant cache hit.
[2023-03-08 16:39:43] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 16:39:43] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-08 16:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-08 16:39:43] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-08 16:39:43] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Applied a total of 8 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1234689 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :{}
Probabilistic random walk after 1234689 steps, saw 172747 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:39:46] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 16:39:46] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:39:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-08 16:39:47] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:39:47] [INFO ] After 69ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:47] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-08 16:39:47] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 16:39:47] [INFO ] Invariant cache hit.
[2023-03-08 16:39:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:39:47] [INFO ] Invariant cache hit.
[2023-03-08 16:39:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:39:47] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-08 16:39:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:39:47] [INFO ] Invariant cache hit.
[2023-03-08 16:39:47] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 153/153 places, 95/95 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 95
Applied a total of 1 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:39:47] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 16:39:47] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:39:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 16:39:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 16:39:47] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:39:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-08 16:39:47] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2023-03-08 16:39:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-08 16:39:48] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-08 16:39:48] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 18 factoid took 811 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:39:49] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 16:39:49] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:39:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 16:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:49] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-08 16:39:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:39:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 16:39:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-08 16:39:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:39:49] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-08 16:39:49] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 16:39:49] [INFO ] Added : 75 causal constraints over 15 iterations in 185 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 25020 reset in 268 ms.
Product exploration explored 100000 steps with 24964 reset in 284 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:39:50] [INFO ] Invariant cache hit.
[2023-03-08 16:39:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 16:39:50] [INFO ] Invariant cache hit.
[2023-03-08 16:39:50] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 16:39:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:39:50] [INFO ] Invariant cache hit.
[2023-03-08 16:39:50] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-11 finished in 18229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-08 16:39:51] [INFO ] Flatten gal took : 14 ms
[2023-03-08 16:39:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 16:39:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 98 transitions and 485 arcs took 2 ms.
Total runtime 77839 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2490/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2490/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2490/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2490/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-10a-LTLCardinality-01
Could not compute solution for formula : DES-PT-10a-LTLCardinality-11
Could not compute solution for formula : DES-PT-10a-LTLCardinality-13
Could not compute solution for formula : DES-PT-10a-LTLCardinality-14

BK_STOP 1678293592261

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DES-PT-10a-LTLCardinality-01
ltl formula formula --ltl=/tmp/2490/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 154 places, 98 transitions and 485 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2490/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2490/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2490/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2490/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DES-PT-10a-LTLCardinality-11
ltl formula formula --ltl=/tmp/2490/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 154 places, 98 transitions and 485 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2490/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2490/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2490/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2490/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DES-PT-10a-LTLCardinality-13
ltl formula formula --ltl=/tmp/2490/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 154 places, 98 transitions and 485 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2490/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2490/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2490/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2490/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DES-PT-10a-LTLCardinality-14
ltl formula formula --ltl=/tmp/2490/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 154 places, 98 transitions and 485 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2490/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2490/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2490/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2490/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="DES-PT-10a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481200411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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