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.r137-smll-167819418500451.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 DoubleExponent-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678856454248

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=DoubleExponent-PT-002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:00:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:00:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:00:57] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-15 05:00:57] [INFO ] Transformed 110 places.
[2023-03-15 05:00:57] [INFO ] Transformed 98 transitions.
[2023-03-15 05:00:57] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-002-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 24 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 108 cols
[2023-03-15 05:00:57] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-15 05:00:57] [INFO ] Implicit Places using invariants in 274 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 98/98 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 362 ms. Remains : 107/110 places, 98/98 transitions.
Support contains 29 out of 107 places after structural reductions.
[2023-03-15 05:00:58] [INFO ] Flatten gal took : 44 ms
[2023-03-15 05:00:58] [INFO ] Flatten gal took : 19 ms
[2023-03-15 05:00:58] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 28 out of 107 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 270 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 98 rows 107 cols
[2023-03-15 05:01:02] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-15 05:01:02] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-15 05:01:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-15 05:01:02] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 05:01:02] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :6
[2023-03-15 05:01:03] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 8 ms to minimize.
[2023-03-15 05:01:03] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2023-03-15 05:01:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2023-03-15 05:01:03] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2023-03-15 05:01:03] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2023-03-15 05:01:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-03-15 05:01:03] [INFO ] After 641ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :6
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-15 05:01:03] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :6
Fused 14 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 11 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 173 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 14 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 18 rules applied. Total rules applied 33 place count 92 transition count 80
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 88 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 37 place count 88 transition count 77
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 43 place count 85 transition count 77
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 75 place count 69 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 67 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 67 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 66 transition count 60
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 89 place count 66 transition count 52
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 97 place count 58 transition count 52
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 104 place count 58 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 57 transition count 51
Applied a total of 105 rules in 52 ms. Remains 57 /107 variables (removed 50) and now considering 51/98 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 57/107 places, 51/98 transitions.
Incomplete random walk after 10000 steps, including 1159 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 769 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 780 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 781 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 51 rows 57 cols
[2023-03-15 05:01:04] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 05:01:04] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 05:01:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2023-03-15 05:01:04] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 05:01:04] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 05:01:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:01:04] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 05:01:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-15 05:01:04] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2023-03-15 05:01:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2023-03-15 05:01:04] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-15 05:01:04] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 51/51 transitions.
Graph (complete) has 153 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 56 transition count 46
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 51 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 51 transition count 45
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 13 place count 50 transition count 45
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 15 place count 49 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 49 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 48 transition count 43
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 48 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 47 transition count 42
Applied a total of 19 rules in 20 ms. Remains 47 /57 variables (removed 10) and now considering 42/51 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 47/57 places, 42/51 transitions.
Incomplete random walk after 10000 steps, including 1124 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 776 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 756 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Finished probabilistic random walk after 218 steps, run visited all 2 properties in 14 ms. (steps per millisecond=15 )
Probabilistic random walk after 218 steps, saw 120 distinct states, run finished after 14 ms. (steps per millisecond=15 ) properties seen :2
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-002-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 107 vertex of which 103 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
FORMULA DoubleExponent-PT-002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 173 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 104 transition count 74
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 81 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 79 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 51 place count 79 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 59 place count 75 transition count 68
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 97 place count 56 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 54 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 53 transition count 48
Applied a total of 102 rules in 20 ms. Remains 53 /107 variables (removed 54) and now considering 48/98 (removed 50) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-15 05:01:05] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 05:01:05] [INFO ] Implicit Places using invariants in 69 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/107 places, 48/98 transitions.
Graph (complete) has 145 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 3 place count 50 transition count 46
Applied a total of 3 rules in 7 ms. Remains 50 /52 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 50 cols
[2023-03-15 05:01:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:05] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-15 05:01:05] [INFO ] Invariant cache hit.
[2023-03-15 05:01:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:05] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/107 places, 46/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 282 ms. Remains : 50/107 places, 46/98 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s9 s6)], 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 19 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-00 finished in 557 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)||X(F(p1))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 98
Applied a total of 1 rules in 6 ms. Remains 106 /107 variables (removed 1) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:05] [INFO ] Computed 10 place invariants in 8 ms
[2023-03-15 05:01:05] [INFO ] Implicit Places using invariants in 94 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 13 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 104 cols
[2023-03-15 05:01:05] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-15 05:01:05] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 05:01:05] [INFO ] Invariant cache hit.
[2023-03-15 05:01:05] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/107 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 340 ms. Remains : 104/107 places, 97/98 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s43 s97), p0:(GT s11 s63)], 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]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-02 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 173 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 104 transition count 73
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 80 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 79 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 51 place count 79 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 59 place count 75 transition count 68
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 99 place count 55 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 53 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 52 transition count 47
Applied a total of 104 rules in 35 ms. Remains 52 /107 variables (removed 55) and now considering 47/98 (removed 51) transitions.
// Phase 1: matrix 47 rows 52 cols
[2023-03-15 05:01:06] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 05:01:06] [INFO ] Implicit Places using invariants in 62 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/107 places, 47/98 transitions.
Graph (complete) has 145 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 49 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 49 transition count 45
Applied a total of 3 rules in 6 ms. Remains 49 /51 variables (removed 2) and now considering 45/47 (removed 2) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-15 05:01:06] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-15 05:01:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-15 05:01:06] [INFO ] Invariant cache hit.
[2023-03-15 05:01:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:06] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/107 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 49/107 places, 45/98 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s23 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 104 steps with 12 reset in 2 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-03 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 98
Applied a total of 2 rules in 2 ms. Remains 105 /107 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2023-03-15 05:01:06] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 05:01:06] [INFO ] Implicit Places using invariants in 86 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 11 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-15 05:01:06] [INFO ] Invariant cache hit.
[2023-03-15 05:01:06] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/107 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 323 ms. Remains : 103/107 places, 97/98 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s77)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-09 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1) U p2)))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 98
Applied a total of 2 rules in 2 ms. Remains 105 /107 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2023-03-15 05:01:06] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 05:01:06] [INFO ] Implicit Places using invariants in 66 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-15 05:01:07] [INFO ] Invariant cache hit.
[2023-03-15 05:01:07] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/107 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 298 ms. Remains : 103/107 places, 97/98 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s75 s38), p2:(LEQ s93 s50)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLCardinality-10 finished in 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 173 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 104 transition count 74
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 81 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 80 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 49 place count 80 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 77 transition count 70
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 95 place count 57 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 55 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 54 transition count 49
Applied a total of 100 rules in 22 ms. Remains 54 /107 variables (removed 53) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 54 cols
[2023-03-15 05:01:08] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 05:01:08] [INFO ] Implicit Places using invariants in 60 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/107 places, 49/98 transitions.
Graph (complete) has 146 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 3 place count 51 transition count 47
Applied a total of 3 rules in 6 ms. Remains 51 /53 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 51 cols
[2023-03-15 05:01:08] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:08] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-15 05:01:08] [INFO ] Invariant cache hit.
[2023-03-15 05:01:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:01:08] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/107 places, 47/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 51/107 places, 47/98 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s39 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13918 reset in 294 ms.
Product exploration explored 100000 steps with 13823 reset in 214 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 143 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 798 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 160 steps, run visited all 1 properties in 15 ms. (steps per millisecond=10 )
Probabilistic random walk after 160 steps, saw 85 distinct states, run finished after 15 ms. (steps per millisecond=10 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-15 05:01:09] [INFO ] Invariant cache hit.
[2023-03-15 05:01:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 05:01:09] [INFO ] Invariant cache hit.
[2023-03-15 05:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:01:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-15 05:01:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:01:09] [INFO ] Invariant cache hit.
[2023-03-15 05:01:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 51/51 places, 47/47 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 143 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 160 steps, run visited all 1 properties in 7 ms. (steps per millisecond=22 )
Probabilistic random walk after 160 steps, saw 85 distinct states, run finished after 8 ms. (steps per millisecond=20 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13906 reset in 116 ms.
Product exploration explored 100000 steps with 13934 reset in 132 ms.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-15 05:01:10] [INFO ] Invariant cache hit.
[2023-03-15 05:01:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-15 05:01:10] [INFO ] Invariant cache hit.
[2023-03-15 05:01:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:01:10] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-15 05:01:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:01:10] [INFO ] Invariant cache hit.
[2023-03-15 05:01:10] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 51/51 places, 47/47 transitions.
Treatment of property DoubleExponent-PT-002-LTLCardinality-11 finished in 2942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 98
Applied a total of 2 rules in 2 ms. Remains 105 /107 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2023-03-15 05:01:10] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-15 05:01:11] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 05:01:11] [INFO ] Invariant cache hit.
[2023-03-15 05:01:11] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-15 05:01:11] [INFO ] Invariant cache hit.
[2023-03-15 05:01:11] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 105/107 places, 98/98 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s75 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 170 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLCardinality-13 finished in 777 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||X((X(X(G(p1))) U (p0&&X(X(G(p1))))))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 173 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 105 transition count 74
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 82 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 95 place count 58 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 56 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 55 transition count 49
Applied a total of 102 rules in 18 ms. Remains 55 /107 variables (removed 52) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-15 05:01:11] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:01:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-15 05:01:11] [INFO ] Invariant cache hit.
[2023-03-15 05:01:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:11] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-15 05:01:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:01:11] [INFO ] Invariant cache hit.
[2023-03-15 05:01:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/107 places, 49/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 55/107 places, 49/98 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=true, acceptance={1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=true, acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={1} source=5 dest: 4}]], initial=0, aps=[p0:(LEQ s9 s40), p1:(GT s27 s39)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 11453 reset in 117 ms.
Product exploration explored 100000 steps with 11571 reset in 241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 150 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 298 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter insensitive) to 6 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1145 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 726 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 05:01:13] [INFO ] Invariant cache hit.
[2023-03-15 05:01:13] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:01:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 05:01:13] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:01:13] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), true, (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 358 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-15 05:01:13] [INFO ] Invariant cache hit.
[2023-03-15 05:01:13] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 05:01:13] [INFO ] Invariant cache hit.
[2023-03-15 05:01:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:13] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-15 05:01:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:01:13] [INFO ] Invariant cache hit.
[2023-03-15 05:01:13] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 55/55 places, 49/49 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 150 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11481 reset in 187 ms.
Product exploration explored 100000 steps with 11428 reset in 172 ms.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 49/49 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 2 place count 55 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 53 transition count 47
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 6 place count 52 transition count 46
Applied a total of 6 rules in 7 ms. Remains 52 /55 variables (removed 3) and now considering 46/49 (removed 3) transitions.
// Phase 1: matrix 46 rows 52 cols
[2023-03-15 05:01:14] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:01:14] [INFO ] Implicit Places using invariants in 81 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/55 places, 46/49 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 50 transition count 45
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 50 cols
[2023-03-15 05:01:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 05:01:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-15 05:01:14] [INFO ] Invariant cache hit.
[2023-03-15 05:01:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:15] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/55 places, 45/49 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 50/55 places, 45/49 transitions.
Treatment of property DoubleExponent-PT-002-LTLCardinality-14 finished in 3386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 173 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 104 transition count 72
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 79 transition count 72
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 51 place count 79 transition count 67
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 61 place count 74 transition count 67
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 101 place count 54 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 52 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 51 transition count 46
Applied a total of 106 rules in 15 ms. Remains 51 /107 variables (removed 56) and now considering 46/98 (removed 52) transitions.
// Phase 1: matrix 46 rows 51 cols
[2023-03-15 05:01:15] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 05:01:15] [INFO ] Implicit Places using invariants in 87 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/107 places, 46/98 transitions.
Graph (complete) has 144 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 3 place count 48 transition count 44
Applied a total of 3 rules in 7 ms. Remains 48 /50 variables (removed 2) and now considering 44/46 (removed 2) transitions.
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 05:01:15] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-15 05:01:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-15 05:01:15] [INFO ] Invariant cache hit.
[2023-03-15 05:01:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/107 places, 44/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 264 ms. Remains : 48/107 places, 44/98 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14577 reset in 121 ms.
Product exploration explored 100000 steps with 14643 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 141 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-15 05:01:16] [INFO ] Invariant cache hit.
[2023-03-15 05:01:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-15 05:01:16] [INFO ] Invariant cache hit.
[2023-03-15 05:01:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:16] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-15 05:01:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:01:16] [INFO ] Invariant cache hit.
[2023-03-15 05:01:16] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 48/48 places, 44/44 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 141 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14538 reset in 116 ms.
Product exploration explored 100000 steps with 14568 reset in 129 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-15 05:01:17] [INFO ] Invariant cache hit.
[2023-03-15 05:01:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-15 05:01:17] [INFO ] Invariant cache hit.
[2023-03-15 05:01:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:17] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-15 05:01:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:01:17] [INFO ] Invariant cache hit.
[2023-03-15 05:01:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 48/48 places, 44/44 transitions.
Treatment of property DoubleExponent-PT-002-LTLCardinality-15 finished in 2405 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)))'
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||X((X(X(G(p1))) U (p0&&X(X(G(p1))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-15 05:01:18] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:01:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 05:01:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 98 transitions and 271 arcs took 2 ms.
Total runtime 20955 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1125/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1125/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1125/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-002-LTLCardinality-11
Could not compute solution for formula : DoubleExponent-PT-002-LTLCardinality-14
Could not compute solution for formula : DoubleExponent-PT-002-LTLCardinality-15

BK_STOP 1678856479379

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r137-smll-167819418500451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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