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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 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.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 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 83K 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-40a-LTLCardinality-00
FORMULA_NAME DES-PT-40a-LTLCardinality-01
FORMULA_NAME DES-PT-40a-LTLCardinality-02
FORMULA_NAME DES-PT-40a-LTLCardinality-03
FORMULA_NAME DES-PT-40a-LTLCardinality-04
FORMULA_NAME DES-PT-40a-LTLCardinality-05
FORMULA_NAME DES-PT-40a-LTLCardinality-06
FORMULA_NAME DES-PT-40a-LTLCardinality-07
FORMULA_NAME DES-PT-40a-LTLCardinality-08
FORMULA_NAME DES-PT-40a-LTLCardinality-09
FORMULA_NAME DES-PT-40a-LTLCardinality-10
FORMULA_NAME DES-PT-40a-LTLCardinality-11
FORMULA_NAME DES-PT-40a-LTLCardinality-12
FORMULA_NAME DES-PT-40a-LTLCardinality-13
FORMULA_NAME DES-PT-40a-LTLCardinality-14
FORMULA_NAME DES-PT-40a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678252888930

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:21:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 05:21:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:21:30] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-08 05:21:30] [INFO ] Transformed 274 places.
[2023-03-08 05:21:30] [INFO ] Transformed 231 transitions.
[2023-03-08 05:21:30] [INFO ] Found NUPN structural information;
[2023-03-08 05:21:30] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-40a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Applied a total of 0 rules in 29 ms. Remains 274 /274 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 05:21:30] [INFO ] Computed 59 place invariants in 21 ms
[2023-03-08 05:21:30] [INFO ] Implicit Places using invariants in 377 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/274 places, 217/217 transitions.
Applied a total of 0 rules in 14 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 444 ms. Remains : 273/274 places, 217/217 transitions.
Support contains 42 out of 273 places after structural reductions.
[2023-03-08 05:21:31] [INFO ] Flatten gal took : 45 ms
[2023-03-08 05:21:31] [INFO ] Flatten gal took : 22 ms
[2023-03-08 05:21:31] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 36 out of 273 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 208 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 19) seen :9
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 05:21:32] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 05:21:32] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 05:21:32] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:21:32] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 05:21:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:21:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 195 ms returned sat
[2023-03-08 05:21:43] [INFO ] After 10502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 05:21:43] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 6 ms to minimize.
[2023-03-08 05:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-08 05:21:43] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-08 05:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 05:21:44] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2023-03-08 05:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 05:21:44] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-08 05:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 05:21:45] [INFO ] After 12114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4012 ms.
[2023-03-08 05:21:49] [INFO ] After 16611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 4 properties in 455 ms.
Support contains 13 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 272 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 272 transition count 215
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 8 place count 272 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 214
Applied a total of 9 rules in 51 ms. Remains 271 /273 variables (removed 2) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 271/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1038523 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1038523 steps, saw 138501 distinct states, run finished after 3002 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 214 rows 271 cols
[2023-03-08 05:21:52] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 05:21:52] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-08 05:21:52] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 05:21:52] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:21:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:21:53] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-08 05:21:53] [INFO ] After 626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:21:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:21:54] [INFO ] After 244ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 05:21:54] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-03-08 05:21:54] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-08 05:21:54] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-08 05:21:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2023-03-08 05:21:54] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-08 05:21:54] [INFO ] After 1653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 226 ms.
Support contains 7 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 271/271 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:21:54] [INFO ] Invariant cache hit.
[2023-03-08 05:21:55] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 05:21:55] [INFO ] Invariant cache hit.
[2023-03-08 05:21:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:21:55] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-08 05:21:55] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 05:21:55] [INFO ] Invariant cache hit.
[2023-03-08 05:21:55] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 05:21:55] [INFO ] Invariant cache hit.
[2023-03-08 05:21:55] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:21:55] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 05:21:55] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:21:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 05:21:55] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 41 ms returned sat
[2023-03-08 05:21:55] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:21:55] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2023-03-08 05:21:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-08 05:21:56] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-08 05:21:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:21:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 307 ms
[2023-03-08 05:21:56] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-08 05:21:56] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 176 stabilizing places and 171 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' '!(F((G(p0)||G(F(p1)))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 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 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 16 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:21:56] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 05:21:56] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 05:21:56] [INFO ] Invariant cache hit.
[2023-03-08 05:21:56] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-08 05:21:57] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 05:21:57] [INFO ] Invariant cache hit.
[2023-03-08 05:21:57] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 594 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (NEQ s148 0) (NEQ s18 1)) (EQ s30 0) (EQ s121 1)), p1:(AND (NEQ s235 0) (NEQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2276 reset in 362 ms.
Product exploration explored 100000 steps with 2277 reset in 269 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 531 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 235 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:21:58] [INFO ] Invariant cache hit.
[2023-03-08 05:21:58] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:21:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:21:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-08 05:21:58] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:21:58] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 05:21:58] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 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 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 15 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 164 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 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1837107 steps, run timeout after 3001 ms. (steps per millisecond=612 ) properties seen :{}
Probabilistic random walk after 1837107 steps, saw 254268 distinct states, run finished after 3001 ms. (steps per millisecond=612 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 05:22:02] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 05:22:02] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 77 ms returned sat
[2023-03-08 05:22:02] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:02] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2023-03-08 05:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 05:22:02] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 05:22:02] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 05:22:02] [INFO ] Invariant cache hit.
[2023-03-08 05:22:02] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 05:22:02] [INFO ] Invariant cache hit.
[2023-03-08 05:22:02] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-08 05:22:02] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:22:02] [INFO ] Invariant cache hit.
[2023-03-08 05:22:02] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 271/271 places, 213/213 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 271 transition count 213
Applied a total of 1 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 05:22:03] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:22:03] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 77 ms returned sat
[2023-03-08 05:22:03] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:03] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 05:22:03] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:22:03] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:22:04] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 05:22:04] [INFO ] Invariant cache hit.
[2023-03-08 05:22:04] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-08 05:22:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:22:04] [INFO ] Invariant cache hit.
[2023-03-08 05:22:04] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 519 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:22:04] [INFO ] Invariant cache hit.
[2023-03-08 05:22:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:22:04] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-08 05:22:05] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:05] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 05:22:05] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 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 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 15 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 161 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1692510 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :{}
Probabilistic random walk after 1692510 steps, saw 236028 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 05:22:08] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 05:22:08] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-08 05:22:08] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2023-03-08 05:22:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 05:22:08] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 05:22:08] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 05:22:08] [INFO ] Invariant cache hit.
[2023-03-08 05:22:08] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 05:22:08] [INFO ] Invariant cache hit.
[2023-03-08 05:22:09] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-08 05:22:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:22:09] [INFO ] Invariant cache hit.
[2023-03-08 05:22:09] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 271/271 places, 213/213 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 271 transition count 213
Applied a total of 1 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 05:22:09] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:22:09] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 05:22:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 82 ms returned sat
[2023-03-08 05:22:09] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:09] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 05:22:09] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2282 reset in 193 ms.
Product exploration explored 100000 steps with 2282 reset in 244 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:22:10] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 05:22:10] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 05:22:10] [INFO ] Invariant cache hit.
[2023-03-08 05:22:10] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-08 05:22:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:10] [INFO ] Invariant cache hit.
[2023-03-08 05:22:10] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 271/271 places, 215/215 transitions.
Treatment of property DES-PT-40a-LTLCardinality-02 finished in 14428 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)||G(p1))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 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 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 13 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
[2023-03-08 05:22:10] [INFO ] Invariant cache hit.
[2023-03-08 05:22:11] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 05:22:11] [INFO ] Invariant cache hit.
[2023-03-08 05:22:11] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-08 05:22:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:11] [INFO ] Invariant cache hit.
[2023-03-08 05:22:11] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 516 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s104 0) (EQ s86 1)), p1:(AND (NEQ s80 0) (NEQ s138 1))], nbAcceptance=2, 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 2255 reset in 209 ms.
Product exploration explored 100000 steps with 2284 reset in 265 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 429 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 991865 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991865 steps, saw 141755 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 05:22:15] [INFO ] Invariant cache hit.
[2023-03-08 05:22:15] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:22:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:15] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 05:22:16] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 05:22:16] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-08 05:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 05:22:16] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 05:22:16] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 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 271 transition count 213
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 271 transition count 213
Applied a total of 3 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 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 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1200032 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :{}
Probabilistic random walk after 1200032 steps, saw 168326 distinct states, run finished after 3001 ms. (steps per millisecond=399 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 05:22:19] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:22:19] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:22:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 103 ms returned sat
[2023-03-08 05:22:19] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:22:19] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-08 05:22:19] [INFO ] After 456ms 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 45 ms.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 05:22:20] [INFO ] Invariant cache hit.
[2023-03-08 05:22:20] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 05:22:20] [INFO ] Invariant cache hit.
[2023-03-08 05:22:20] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-08 05:22:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:20] [INFO ] Invariant cache hit.
[2023-03-08 05:22:20] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 05:22:20] [INFO ] Invariant cache hit.
[2023-03-08 05:22:20] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:22:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 71 ms returned sat
[2023-03-08 05:22:21] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:22:21] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-08 05:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 05:22:21] [INFO ] After 418ms 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 05:22:21] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 340 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 2 out of 271 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:22:21] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:22:21] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 05:22:21] [INFO ] Invariant cache hit.
[2023-03-08 05:22:22] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-08 05:22:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:22] [INFO ] Invariant cache hit.
[2023-03-08 05:22:22] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 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 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 233 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1778991 steps, run timeout after 3001 ms. (steps per millisecond=592 ) properties seen :{}
Probabilistic random walk after 1778991 steps, saw 241544 distinct states, run finished after 3001 ms. (steps per millisecond=592 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:22:25] [INFO ] Invariant cache hit.
[2023-03-08 05:22:25] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:22:25] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-08 05:22:25] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:25] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 05:22:25] [INFO ] After 258ms 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 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 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 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 164 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 30 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1764924 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :{}
Probabilistic random walk after 1764924 steps, saw 245391 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 05:22:28] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:22:28] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 102 ms returned sat
[2023-03-08 05:22:29] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:29] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 05:22:29] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 05:22:29] [INFO ] Invariant cache hit.
[2023-03-08 05:22:29] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 05:22:29] [INFO ] Invariant cache hit.
[2023-03-08 05:22:29] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-08 05:22:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:22:29] [INFO ] Invariant cache hit.
[2023-03-08 05:22:29] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 271/271 places, 213/213 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 271 transition count 213
Applied a total of 1 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 05:22:29] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 05:22:29] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 05:22:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 104 ms returned sat
[2023-03-08 05:22:30] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:30] [INFO ] After 211ms 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 05:22:30] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 119 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 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2283 reset in 241 ms.
Product exploration explored 100000 steps with 2258 reset in 220 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:22:30] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:22:30] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 05:22:30] [INFO ] Invariant cache hit.
[2023-03-08 05:22:31] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-08 05:22:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:31] [INFO ] Invariant cache hit.
[2023-03-08 05:22:31] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 271/271 places, 215/215 transitions.
Treatment of property DES-PT-40a-LTLCardinality-03 finished in 20423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1) U X(!p2)))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 4 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:22:31] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:22:31] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 05:22:31] [INFO ] Invariant cache hit.
[2023-03-08 05:22:31] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-08 05:22:31] [INFO ] Invariant cache hit.
[2023-03-08 05:22:31] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 195 ms :[p2, p2, p2, (AND p1 p2), true, p1]
Running random walk in product with property : DES-PT-40a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s165 0) (EQ s39 1)), p0:(OR (EQ s54 0) (EQ s89 1)), p2:(OR (EQ s145 0) (EQ s119 1))], nbAcceptance=0, 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 23261 steps with 3775 reset in 109 ms.
FORMULA DES-PT-40a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-04 finished in 837 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 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 5 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:22:32] [INFO ] Invariant cache hit.
[2023-03-08 05:22:32] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 05:22:32] [INFO ] Invariant cache hit.
[2023-03-08 05:22:32] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-08 05:22:32] [INFO ] Invariant cache hit.
[2023-03-08 05:22:32] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s192 0) (EQ s153 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-40a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-05 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p1)&&p0)))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 9 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:22:32] [INFO ] Invariant cache hit.
[2023-03-08 05:22:32] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 05:22:32] [INFO ] Invariant cache hit.
[2023-03-08 05:22:33] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-08 05:22:33] [INFO ] Invariant cache hit.
[2023-03-08 05:22:33] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s49 0) (EQ s15 1)), p1:(AND (EQ s49 0) (EQ s15 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-06 finished in 665 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 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 12 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:22:33] [INFO ] Invariant cache hit.
[2023-03-08 05:22:33] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 05:22:33] [INFO ] Invariant cache hit.
[2023-03-08 05:22:33] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-08 05:22:33] [INFO ] Invariant cache hit.
[2023-03-08 05:22:33] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s231 0) (EQ s191 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]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-07 finished in 570 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)&&(p0||X((G(p2)||p1))))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 7 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:22:34] [INFO ] Invariant cache hit.
[2023-03-08 05:22:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 05:22:34] [INFO ] Invariant cache hit.
[2023-03-08 05:22:34] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-08 05:22:34] [INFO ] Invariant cache hit.
[2023-03-08 05:22:34] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s119 1), p1:(OR (EQ s139 0) (EQ s185 1)), p2:(AND (OR (EQ s197 0) (EQ s251 1)) (EQ s10 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]]
Product exploration explored 100000 steps with 23861 reset in 309 ms.
Product exploration explored 100000 steps with 23759 reset in 287 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-08 05:22:35] [INFO ] Invariant cache hit.
[2023-03-08 05:22:36] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:22:36] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:22:36] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-08 05:22:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:22:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 05:22:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 126 ms returned sat
[2023-03-08 05:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:22:37] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-08 05:22:37] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-08 05:22:38] [INFO ] Added : 147 causal constraints over 30 iterations in 868 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:22:38] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:22:38] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 05:22:38] [INFO ] Invariant cache hit.
[2023-03-08 05:22:38] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-08 05:22:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:38] [INFO ] Invariant cache hit.
[2023-03-08 05:22:38] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 516 ms. Remains : 271/272 places, 215/216 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-08 05:22:39] [INFO ] Invariant cache hit.
[2023-03-08 05:22:39] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:39] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:22:39] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-08 05:22:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:22:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 05:22:39] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 109 ms returned sat
[2023-03-08 05:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:22:40] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2023-03-08 05:22:40] [INFO ] Computed and/alt/rep : 208/325/208 causal constraints (skipped 4 transitions) in 12 ms.
[2023-03-08 05:22:41] [INFO ] Added : 161 causal constraints over 33 iterations in 799 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22755 reset in 199 ms.
Product exploration explored 100000 steps with 22699 reset in 211 ms.
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-08 05:22:41] [INFO ] Invariant cache hit.
[2023-03-08 05:22:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 05:22:42] [INFO ] Invariant cache hit.
[2023-03-08 05:22:42] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-08 05:22:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:22:42] [INFO ] Invariant cache hit.
[2023-03-08 05:22:42] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 271/271 places, 215/215 transitions.
Treatment of property DES-PT-40a-LTLCardinality-10 finished in 8423 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)))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 15 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:22:42] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:22:42] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 05:22:42] [INFO ] Invariant cache hit.
[2023-03-08 05:22:42] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 05:22:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:42] [INFO ] Invariant cache hit.
[2023-03-08 05:22:42] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (NEQ s267 0) (NEQ s221 1)), p1:(OR (EQ s271 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 405 ms.
Product exploration explored 100000 steps with 50000 reset in 413 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-12 finished in 1590 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(p0))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 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 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 15 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:22:44] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:22:44] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 05:22:44] [INFO ] Invariant cache hit.
[2023-03-08 05:22:44] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-08 05:22:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:44] [INFO ] Invariant cache hit.
[2023-03-08 05:22:44] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 527 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-13 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}]], initial=1, aps=[p0:(OR (EQ s8 0) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2286 reset in 178 ms.
Product exploration explored 100000 steps with 2282 reset in 200 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 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 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 238 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1782271 steps, run timeout after 3001 ms. (steps per millisecond=593 ) properties seen :{}
Probabilistic random walk after 1782271 steps, saw 241981 distinct states, run finished after 3001 ms. (steps per millisecond=593 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:22:48] [INFO ] Invariant cache hit.
[2023-03-08 05:22:48] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:22:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:48] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 99 ms returned sat
[2023-03-08 05:22:48] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:22:48] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2023-03-08 05:22:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-08 05:22:48] [INFO ] After 242ms 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 05:22:48] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1710 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=285 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-13 finished in 4740 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)&&X(G(p1)))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 05:22:48] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 05:22:48] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-08 05:22:48] [INFO ] Invariant cache hit.
[2023-03-08 05:22:49] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-08 05:22:49] [INFO ] Invariant cache hit.
[2023-03-08 05:22:50] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1266 ms. Remains : 273/273 places, 217/217 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (NEQ s80 0) (NEQ s261 1)), p0:(AND (EQ s265 0) (EQ s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 6 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-15 finished in 1452 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)||G(F(p1)))))'
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)||G(p1))))'
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)&&(p0||X((G(p2)||p1))))))'
[2023-03-08 05:22:50] [INFO ] Flatten gal took : 19 ms
[2023-03-08 05:22:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 05:22:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 217 transitions and 1049 arcs took 3 ms.
Total runtime 80259 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA DES-PT-40a-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678252972076

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-40a-LTLCardinality-02
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-40a-LTLCardinality-02
lola: result : false
lola: markings : 27436
lola: fired transitions : 31997
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 6 DES-PT-40a-LTLCardinality-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for DES-PT-40a-LTLCardinality-10
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 9 (type EXCL) for 6 DES-PT-40a-LTLCardinality-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for DES-PT-40a-LTLCardinality-10
lola: result : true
lola: markings : 86313
lola: fired transitions : 242607
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-40a-LTLCardinality-03
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DES-PT-40a-LTLCardinality-03
lola: result : false
lola: markings : 3203
lola: fired transitions : 3428
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40a-LTLCardinality-02: LTL false LTL model checker
DES-PT-40a-LTLCardinality-03: LTL false LTL model checker
DES-PT-40a-LTLCardinality-10: CONJ true CONJ


Time elapsed: 1 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-40a, 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 r103-tall-167814478300459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;