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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000100000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678649992040

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000100000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:39:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:39:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:39:53] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-12 19:39:53] [INFO ] Transformed 33 places.
[2023-03-12 19:39:53] [INFO ] Transformed 22 transitions.
[2023-03-12 19:39:53] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 192 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 19:39:53] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 19:39:54] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
[2023-03-12 19:39:54] [INFO ] Invariant cache hit.
[2023-03-12 19:39:54] [INFO ] Implicit Places using invariants in 36 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 412 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 24 out of 32 places after structural reductions.
[2023-03-12 19:39:54] [INFO ] Flatten gal took : 19 ms
[2023-03-12 19:39:54] [INFO ] Flatten gal took : 5 ms
[2023-03-12 19:39:54] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 23 out of 32 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:39:55] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 19:39:55] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 19:39:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-12 19:39:55] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-12 19:39:55] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :6
[2023-03-12 19:39:55] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :6
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-12 19:39:55] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :6
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10002 ms.
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 18
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 17
Applied a total of 7 rules in 10 ms. Remains 28 /32 variables (removed 4) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2023-03-12 19:40:05] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 19:40:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 28/32 places, 17/22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 366598 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 366598 steps, saw 181814 distinct states, run finished after 3002 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 19:40:08] [INFO ] Invariant cache hit.
[2023-03-12 19:40:08] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 19:40:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 19:40:09] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-12 19:40:09] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 19:40:09] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-12 19:40:10] [INFO ] After 1180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 12000 ms.
Support contains 6 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 28/28 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-12 19:40:22] [INFO ] Invariant cache hit.
[2023-03-12 19:40:22] [INFO ] Implicit Places using invariants in 51 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/28 places, 17/17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 19:40:22] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 19:40:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 19:40:22] [INFO ] Invariant cache hit.
[2023-03-12 19:40:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:40:22] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 23/28 places, 16/17 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 154 ms. Remains : 23/28 places, 16/17 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 458578 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458578 steps, saw 198354 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 19:40:25] [INFO ] Invariant cache hit.
[2023-03-12 19:40:25] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 19:40:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:40:25] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-12 19:40:25] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 19:40:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:40:25] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 19:40:25] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 19:40:25] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 12000 ms.
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 13 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 23/23 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-12 19:40:37] [INFO ] Invariant cache hit.
[2023-03-12 19:40:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 19:40:37] [INFO ] Invariant cache hit.
[2023-03-12 19:40:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:40:37] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-12 19:40:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 19:40:37] [INFO ] Invariant cache hit.
[2023-03-12 19:40:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-12 19:40:37] [INFO ] Invariant cache hit.
[2023-03-12 19:40:37] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 19:40:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:40:38] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 19:40:38] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 19:40:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:40:38] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 19:40:38] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-12 19:40:38] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&F(p2))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 5 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-12 19:40:38] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 19:40:38] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-12 19:40:38] [INFO ] Invariant cache hit.
[2023-03-12 19:40:38] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 14
Applied a total of 2 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-12 19:40:38] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 19:40:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 19:40:38] [INFO ] Invariant cache hit.
[2023-03-12 19:40:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:40:38] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s2), p0:(LEQ s13 s0), p2:(LEQ 2 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 598286 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598286 steps, saw 229364 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 19:40:42] [INFO ] Invariant cache hit.
[2023-03-12 19:40:42] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:40:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 19:40:42] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-12 19:40:42] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:40:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:40:42] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:40:42] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 19:40:42] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 14/14 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 20 transition count 13
Applied a total of 1 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-12 19:40:48] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 19:40:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 20/20 places, 13/14 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 528767 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 528767 steps, saw 281103 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 19:40:52] [INFO ] Invariant cache hit.
[2023-03-12 19:40:52] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:40:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:40:52] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-12 19:40:52] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:40:52] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:40:52] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 19:40:52] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-12 19:40:58] [INFO ] Invariant cache hit.
[2023-03-12 19:40:58] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 19:40:58] [INFO ] Invariant cache hit.
[2023-03-12 19:40:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:40:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-12 19:40:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:40:58] [INFO ] Invariant cache hit.
[2023-03-12 19:40:58] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-12 19:40:58] [INFO ] Invariant cache hit.
[2023-03-12 19:40:58] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:40:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:40:58] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-12 19:40:58] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:40:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:40:58] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:40:58] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 19:40:58] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-12 19:40:59] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 19:40:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-12 19:40:59] [INFO ] Invariant cache hit.
[2023-03-12 19:40:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 19:40:59] [INFO ] Invariant cache hit.
[2023-03-12 19:40:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:40:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-12 19:40:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:40:59] [INFO ] Invariant cache hit.
[2023-03-12 19:40:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 20/20 places, 14/14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 726667 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 726667 steps, saw 265413 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 19:41:02] [INFO ] Invariant cache hit.
[2023-03-12 19:41:02] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:41:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:41:02] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-12 19:41:02] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:41:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:02] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:41:02] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 19:41:02] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 14/14 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 20 transition count 13
Applied a total of 1 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-12 19:41:08] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 19:41:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 20/20 places, 13/14 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 545030 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 545030 steps, saw 290712 distinct states, run finished after 3003 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 19:41:12] [INFO ] Invariant cache hit.
[2023-03-12 19:41:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:41:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:41:12] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-12 19:41:12] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:41:12] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:41:12] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 19:41:12] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-12 19:41:18] [INFO ] Invariant cache hit.
[2023-03-12 19:41:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 19:41:18] [INFO ] Invariant cache hit.
[2023-03-12 19:41:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:41:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-12 19:41:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:41:18] [INFO ] Invariant cache hit.
[2023-03-12 19:41:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-12 19:41:18] [INFO ] Invariant cache hit.
[2023-03-12 19:41:18] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:41:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:41:18] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-12 19:41:18] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:41:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:41:18] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:41:18] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 19:41:18] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-12 19:41:19] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 19:41:19] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
[2023-03-12 19:41:19] [INFO ] Invariant cache hit.
[2023-03-12 19:41:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 19:41:19] [INFO ] Invariant cache hit.
[2023-03-12 19:41:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-12 19:41:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:41:19] [INFO ] Invariant cache hit.
[2023-03-12 19:41:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 20/20 places, 14/14 transitions.
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-00 finished in 41578 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(F(p0))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:41:19] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-12 19:41:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-12 19:41:19] [INFO ] Invariant cache hit.
[2023-03-12 19:41:20] [INFO ] Implicit Places using invariants in 60 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 79 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s14 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2482 reset in 144 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-03 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 19 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 18 transition count 12
Applied a total of 23 rules in 4 ms. Remains 18 /32 variables (removed 14) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-12 19:41:20] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 19:41:20] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2023-03-12 19:41:20] [INFO ] Invariant cache hit.
[2023-03-12 19:41:20] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 12/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 14 transition count 10
Applied a total of 4 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-12 19:41:20] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:41:20] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 19:41:20] [INFO ] Invariant cache hit.
[2023-03-12 19:41:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:20] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 10/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 295 ms. Remains : 14/32 places, 10/22 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-04 TRUE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-04 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 14
Applied a total of 17 rules in 7 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-12 19:41:20] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 19:41:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-12 19:41:20] [INFO ] Invariant cache hit.
[2023-03-12 19:41:20] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 14/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Applied a total of 4 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-12 19:41:20] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 19:41:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 19:41:20] [INFO ] Invariant cache hit.
[2023-03-12 19:41:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:20] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 17/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-05 finished in 194 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&&X(X(p1))))&&X(G(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:41:21] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-12 19:41:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-12 19:41:21] [INFO ] Invariant cache hit.
[2023-03-12 19:41:21] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s7 s0), p1:(GT 2 s9)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-06 finished in 232 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)&&F((G(F(!p0))||(!p1&&F(!p0))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 25 transition count 16
Applied a total of 12 rules in 11 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 19:41:21] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 19:41:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-12 19:41:21] [INFO ] Invariant cache hit.
[2023-03-12 19:41:21] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 transition count 13
Applied a total of 6 rules in 4 ms. Remains 18 /21 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 18 cols
[2023-03-12 19:41:21] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 19:41:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 19:41:21] [INFO ] Invariant cache hit.
[2023-03-12 19:41:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:21] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/32 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 18/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s14), p1:(AND (GT 3 s0) (LEQ 1 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-09 finished in 368 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||G(p1))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 21 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 20 transition count 13
Applied a total of 20 rules in 8 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-12 19:41:21] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 19:41:21] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2023-03-12 19:41:21] [INFO ] Invariant cache hit.
[2023-03-12 19:41:21] [INFO ] Implicit Places using invariants in 25 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 13/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 16 transition count 11
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 16 cols
[2023-03-12 19:41:21] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 19:41:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-12 19:41:21] [INFO ] Invariant cache hit.
[2023-03-12 19:41:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:21] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 11/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 16/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 3 s0), p0:(LEQ 1 s1)], 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, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration explored 100000 steps with 0 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 549 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4173229 steps, run timeout after 3001 ms. (steps per millisecond=1390 ) properties seen :{}
Probabilistic random walk after 4173229 steps, saw 1169699 distinct states, run finished after 3001 ms. (steps per millisecond=1390 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:41:25] [INFO ] Invariant cache hit.
[2023-03-12 19:41:25] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-12 19:41:25] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-12 19:41:25] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:41:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 19:41:25] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-12 19:41:25] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:41:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:25] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:41:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 19:41:25] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 600000 steps, including 0 resets, run visited all 1 properties in 494 ms. (steps per millisecond=1214 )
Parikh walk visited 1 properties in 494 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 398 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-12 19:41:26] [INFO ] Invariant cache hit.
[2023-03-12 19:41:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-12 19:41:27] [INFO ] Invariant cache hit.
[2023-03-12 19:41:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 19:41:27] [INFO ] Invariant cache hit.
[2023-03-12 19:41:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-12 19:41:27] [INFO ] Invariant cache hit.
[2023-03-12 19:41:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 16/16 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4141641 steps, run timeout after 3011 ms. (steps per millisecond=1375 ) properties seen :{}
Probabilistic random walk after 4141641 steps, saw 1154922 distinct states, run finished after 3011 ms. (steps per millisecond=1375 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:41:30] [INFO ] Invariant cache hit.
[2023-03-12 19:41:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 19:41:30] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-12 19:41:30] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:41:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 19:41:30] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-12 19:41:30] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:41:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:30] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:41:30] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 19:41:30] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 600000 steps, including 0 resets, run visited all 1 properties in 476 ms. (steps per millisecond=1260 )
Parikh walk visited 1 properties in 475 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-12 19:41:31] [INFO ] Invariant cache hit.
[2023-03-12 19:41:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-12 19:41:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:41:31] [INFO ] Invariant cache hit.
[2023-03-12 19:41:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 16/16 places, 11/11 transitions.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-12 19:41:31] [INFO ] Invariant cache hit.
[2023-03-12 19:41:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-12 19:41:31] [INFO ] Invariant cache hit.
[2023-03-12 19:41:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 19:41:31] [INFO ] Invariant cache hit.
[2023-03-12 19:41:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-12 19:41:31] [INFO ] Invariant cache hit.
[2023-03-12 19:41:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 16/16 places, 11/11 transitions.
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-11 finished in 10418 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 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:41:32] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 19:41:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-12 19:41:32] [INFO ] Invariant cache hit.
[2023-03-12 19:41:32] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-12 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:(LEQ 1 s4)], 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 GPPP-PT-C0001N0000100000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-12 finished in 179 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)&&F(G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 19 transition count 13
Applied a total of 21 rules in 3 ms. Remains 19 /32 variables (removed 13) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 19 cols
[2023-03-12 19:41:32] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 19:41:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-12 19:41:32] [INFO ] Invariant cache hit.
[2023-03-12 19:41:32] [INFO ] Implicit Places using invariants in 26 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/32 places, 13/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 12
Applied a total of 2 rules in 1 ms. Remains 16 /17 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-12 19:41:32] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 19:41:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-12 19:41:32] [INFO ] Invariant cache hit.
[2023-03-12 19:41:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:41:32] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(AND (LEQ 1 s4) (LEQ 1 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-14 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&F(p2))))))'
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||G(p1))))'
[2023-03-12 19:41:32] [INFO ] Flatten gal took : 3 ms
[2023-03-12 19:41:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 19:41:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 22 transitions and 78 arcs took 0 ms.
Total runtime 99050 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1266/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1266/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : GPPP-PT-C0001N0000100000-LTLCardinality-00
Could not compute solution for formula : GPPP-PT-C0001N0000100000-LTLCardinality-11

BK_STOP 1678650093813

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

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is GPPP-PT-C0001N0000100000, 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 r169-tall-167838856400811"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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