Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110300451.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is EnergyBus-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110300451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 6.6K Apr 29 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.2M May 10 09:33 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 EnergyBus-PT-none-LTLCardinality-00
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-01
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-02
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-03
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-04
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-05
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-06
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-07
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-08
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-09
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-10
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-11
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-12
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-13
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-14
FORMULA_NAME EnergyBus-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652685597782

Running Version 202205111006
[2022-05-16 07:19:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:19:59] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2022-05-16 07:19:59] [INFO ] Transformed 157 places.
[2022-05-16 07:19:59] [INFO ] Transformed 4430 transitions.
[2022-05-16 07:19:59] [INFO ] Found NUPN structural information;
[2022-05-16 07:19:59] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 475 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 21 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 133 transition count 1405
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 133 transition count 1405
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 133 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 132 transition count 1396
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 132 transition count 1396
Applied a total of 50 rules in 75 ms. Remains 132 /153 variables (removed 21) and now considering 1396/1913 (removed 517) transitions.
[2022-05-16 07:19:59] [INFO ] Flow matrix only has 498 transitions (discarded 898 similar events)
// Phase 1: matrix 498 rows 132 cols
[2022-05-16 07:19:59] [INFO ] Computed 23 place invariants in 24 ms
[2022-05-16 07:20:00] [INFO ] Implicit Places using invariants in 478 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 514 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/153 places, 1396/1913 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 131/153 places, 1396/1913 transitions.
Support contains 22 out of 131 places after structural reductions.
[2022-05-16 07:20:00] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-16 07:20:00] [INFO ] Flatten gal took : 299 ms
FORMULA EnergyBus-PT-none-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 07:20:00] [INFO ] Flatten gal took : 174 ms
[2022-05-16 07:20:01] [INFO ] Input system was already deterministic with 1396 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-16 07:20:01] [INFO ] Flow matrix only has 498 transitions (discarded 898 similar events)
// Phase 1: matrix 498 rows 131 cols
[2022-05-16 07:20:01] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-16 07:20:01] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 07:20:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 07:20:01] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 07:20:02] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-16 07:20:02] [INFO ] State equation strengthened by 341 read => feed constraints.
[2022-05-16 07:20:02] [INFO ] After 119ms SMT Verify possible using 341 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-16 07:20:02] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2022-05-16 07:20:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-16 07:20:02] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-16 07:20:02] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Graph (trivial) has 108 edges and 131 vertex of which 17 / 131 are part of one of the 6 SCC in 2 ms
Free SCC test removed 11 places
Drop transitions removed 28 transitions
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 766 transitions.
Graph (complete) has 649 edges and 120 vertex of which 116 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 116 transition count 621
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 112 transition count 620
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 112 transition count 613
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 105 transition count 613
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 103 transition count 610
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 103 transition count 610
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 61 place count 103 transition count 580
Performed 13 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 87 place count 90 transition count 543
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 90 transition count 541
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 101 place count 84 transition count 552
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 109 place count 84 transition count 544
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 5 with 51 rules applied. Total rules applied 160 place count 84 transition count 493
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 7 rules applied. Total rules applied 167 place count 82 transition count 488
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 172 place count 77 transition count 488
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 172 place count 77 transition count 486
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 178 place count 73 transition count 486
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 73 vertex of which 2 / 73 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 180 place count 72 transition count 485
Drop transitions removed 2 transitions
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 8 with 203 rules applied. Total rules applied 383 place count 72 transition count 282
Ensure Unique test removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 384 place count 71 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 390 place count 68 transition count 279
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 400 place count 68 transition count 269
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 410 place count 58 transition count 269
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 411 place count 58 transition count 279
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 418 place count 57 transition count 273
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 424 place count 57 transition count 267
Applied a total of 424 rules in 246 ms. Remains 57 /131 variables (removed 74) and now considering 267/1396 (removed 1129) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/131 places, 267/1396 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished Best-First random walk after 7461 steps, including 2 resets, run visited all 2 properties in 16 ms. (steps per millisecond=466 )
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 3 stabilizing places and 130 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U X(p1)))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1129
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 123 transition count 1126
Applied a total of 19 rules in 10 ms. Remains 123 /131 variables (removed 8) and now considering 1126/1396 (removed 270) transitions.
[2022-05-16 07:20:03] [INFO ] Flow matrix only has 420 transitions (discarded 706 similar events)
// Phase 1: matrix 420 rows 123 cols
[2022-05-16 07:20:03] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 07:20:03] [INFO ] Implicit Places using invariants in 227 ms returned []
[2022-05-16 07:20:03] [INFO ] Flow matrix only has 420 transitions (discarded 706 similar events)
// Phase 1: matrix 420 rows 123 cols
[2022-05-16 07:20:03] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 07:20:03] [INFO ] State equation strengthened by 277 read => feed constraints.
[2022-05-16 07:20:04] [INFO ] Implicit Places using invariants and state equation in 566 ms returned [20, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 801 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 1126/1396 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 1126/1126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/131 places, 1126/1396 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s19 0) (EQ s11 1)), p0:(EQ s100 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4886 ms.
Product exploration explored 100000 steps with 50000 reset in 4693 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA EnergyBus-PT-none-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLCardinality-01 finished in 10842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Graph (trivial) has 110 edges and 131 vertex of which 17 / 131 are part of one of the 6 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 759 transitions
Reduce isomorphic transitions removed 759 transitions.
Reduce places removed 1 places and 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 119 transition count 633
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 116 transition count 633
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 116 transition count 629
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 112 transition count 629
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 107 transition count 528
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 107 transition count 528
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 55 place count 107 transition count 498
Performed 13 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 84 place count 91 transition count 461
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 70 edges and 91 vertex of which 4 / 91 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 92 place count 89 transition count 454
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 97 place count 88 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 97 place count 88 transition count 449
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 99 place count 87 transition count 449
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 107 place count 82 transition count 446
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 32 rules applied. Total rules applied 139 place count 82 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 140 place count 81 transition count 414
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 7 with 3 rules applied. Total rules applied 143 place count 79 transition count 413
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 145 place count 79 transition count 411
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 147 place count 77 transition count 411
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 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 151 place count 75 transition count 409
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 157 place count 72 transition count 409
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 159 place count 72 transition count 407
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 175 place count 72 transition count 391
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 176 place count 72 transition count 390
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 178 place count 71 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 179 place count 70 transition count 389
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 5 Pre rules applied. Total rules applied 179 place count 70 transition count 384
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 11 rules applied. Total rules applied 190 place count 64 transition count 384
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 2 rules applied. Total rules applied 192 place count 63 transition count 383
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 194 place count 62 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 194 place count 62 transition count 381
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 197 place count 60 transition count 381
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 203 place count 57 transition count 378
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 204 place count 57 transition count 377
Applied a total of 204 rules in 140 ms. Remains 57 /131 variables (removed 74) and now considering 377/1396 (removed 1019) transitions.
[2022-05-16 07:20:14] [INFO ] Flow matrix only has 200 transitions (discarded 177 similar events)
// Phase 1: matrix 200 rows 57 cols
[2022-05-16 07:20:14] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 07:20:14] [INFO ] Implicit Places using invariants in 104 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/131 places, 377/1396 transitions.
Graph (trivial) has 38 edges and 56 vertex of which 3 / 56 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 221
Applied a total of 2 rules in 15 ms. Remains 54 /56 variables (removed 2) and now considering 221/377 (removed 156) transitions.
[2022-05-16 07:20:14] [INFO ] Flow matrix only has 131 transitions (discarded 90 similar events)
// Phase 1: matrix 131 rows 54 cols
[2022-05-16 07:20:14] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:20:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-16 07:20:14] [INFO ] Flow matrix only has 131 transitions (discarded 90 similar events)
// Phase 1: matrix 131 rows 54 cols
[2022-05-16 07:20:14] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:20:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 07:20:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [9, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 110 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/131 places, 221/1396 transitions.
Applied a total of 0 rules in 8 ms. Remains 52 /52 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 52/131 places, 221/1396 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s18 0) (NEQ s4 1))], 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 0 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-03 finished in 418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p0 U p1))||X(F(X(G(X(p0)))))))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 125 transition count 1132
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 125 transition count 1132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 125 transition count 1131
Applied a total of 13 rules in 16 ms. Remains 125 /131 variables (removed 6) and now considering 1131/1396 (removed 265) transitions.
[2022-05-16 07:20:14] [INFO ] Flow matrix only has 425 transitions (discarded 706 similar events)
// Phase 1: matrix 425 rows 125 cols
[2022-05-16 07:20:14] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 07:20:14] [INFO ] Implicit Places using invariants in 204 ms returned []
[2022-05-16 07:20:14] [INFO ] Flow matrix only has 425 transitions (discarded 706 similar events)
// Phase 1: matrix 425 rows 125 cols
[2022-05-16 07:20:14] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 07:20:14] [INFO ] State equation strengthened by 277 read => feed constraints.
[2022-05-16 07:20:15] [INFO ] Implicit Places using invariants and state equation in 575 ms returned [21, 97]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 793 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/131 places, 1131/1396 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 1131/1131 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/131 places, 1131/1396 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s60 0) (EQ s61 1)), p0:(OR (EQ s95 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-08 finished in 982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(X(p0))||F(G(p0))))))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Graph (trivial) has 112 edges and 131 vertex of which 17 / 131 are part of one of the 6 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 759 transitions
Reduce isomorphic transitions removed 759 transitions.
Reduce places removed 1 places and 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 119 transition count 633
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 116 transition count 633
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 116 transition count 630
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 113 transition count 630
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 19 place count 107 transition count 528
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 107 transition count 528
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 55 place count 107 transition count 498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 107 transition count 497
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 57 place count 106 transition count 497
Performed 12 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 92 transition count 461
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 63 edges and 92 vertex of which 4 / 92 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 91 place count 90 transition count 454
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 96 place count 89 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 96 place count 89 transition count 449
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 88 transition count 449
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 106 place count 83 transition count 446
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 58 edges and 83 vertex of which 2 / 83 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 33 rules applied. Total rules applied 139 place count 82 transition count 414
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 144 place count 80 transition count 411
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 7 with 3 rules applied. Total rules applied 147 place count 78 transition count 410
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 155 place count 74 transition count 406
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 71 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 163 place count 71 transition count 404
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 178 place count 71 transition count 389
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 179 place count 71 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 180 place count 70 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 180 place count 70 transition count 382
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 194 place count 62 transition count 382
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 2 rules applied. Total rules applied 196 place count 62 transition count 380
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 200 place count 60 transition count 378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 200 place count 60 transition count 376
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 206 place count 56 transition count 376
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 212 place count 53 transition count 373
Graph (trivial) has 29 edges and 53 vertex of which 2 / 53 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 214 place count 51 transition count 373
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 12 with 156 rules applied. Total rules applied 370 place count 51 transition count 217
Applied a total of 370 rules in 92 ms. Remains 51 /131 variables (removed 80) and now considering 217/1396 (removed 1179) transitions.
[2022-05-16 07:20:15] [INFO ] Flow matrix only has 127 transitions (discarded 90 similar events)
// Phase 1: matrix 127 rows 51 cols
[2022-05-16 07:20:15] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:20:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-16 07:20:15] [INFO ] Flow matrix only has 127 transitions (discarded 90 similar events)
// Phase 1: matrix 127 rows 51 cols
[2022-05-16 07:20:15] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:20:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 07:20:15] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [7, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 112 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/131 places, 217/1396 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/131 places, 217/1396 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-09 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:(EQ s36 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-09 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(X(X(G(p0))))))||F(p1)))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 124 transition count 1383
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 124 transition count 1383
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 124 transition count 1380
Applied a total of 17 rules in 10 ms. Remains 124 /131 variables (removed 7) and now considering 1380/1396 (removed 16) transitions.
[2022-05-16 07:20:15] [INFO ] Flow matrix only has 482 transitions (discarded 898 similar events)
// Phase 1: matrix 482 rows 124 cols
[2022-05-16 07:20:15] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 07:20:15] [INFO ] Implicit Places using invariants in 252 ms returned []
[2022-05-16 07:20:15] [INFO ] Flow matrix only has 482 transitions (discarded 898 similar events)
// Phase 1: matrix 482 rows 124 cols
[2022-05-16 07:20:15] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-16 07:20:16] [INFO ] State equation strengthened by 341 read => feed constraints.
[2022-05-16 07:20:16] [INFO ] Implicit Places using invariants and state equation in 820 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1080 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/131 places, 1380/1396 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 1380/1380 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/131 places, 1380/1396 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(EQ s7 1), p0:(AND (EQ s64 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5634 ms.
Product exploration explored 100000 steps with 50000 reset in 5583 ms.
Computed a total of 3 stabilizing places and 130 stable transitions
Computed a total of 3 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA EnergyBus-PT-none-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLCardinality-10 finished in 12688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(p0)))))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Graph (trivial) has 112 edges and 131 vertex of which 17 / 131 are part of one of the 6 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 759 transitions
Reduce isomorphic transitions removed 759 transitions.
Reduce places removed 1 places and 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 119 transition count 633
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 116 transition count 633
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 116 transition count 630
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 113 transition count 630
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 19 place count 107 transition count 528
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 107 transition count 528
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 55 place count 107 transition count 498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 107 transition count 497
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 106 transition count 497
Performed 12 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 92 transition count 461
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 63 edges and 92 vertex of which 4 / 92 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 91 place count 90 transition count 454
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 96 place count 89 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 96 place count 89 transition count 449
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 88 transition count 449
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 106 place count 83 transition count 446
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 58 edges and 83 vertex of which 2 / 83 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 33 rules applied. Total rules applied 139 place count 82 transition count 414
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 144 place count 80 transition count 411
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 7 with 3 rules applied. Total rules applied 147 place count 78 transition count 410
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 155 place count 74 transition count 406
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 71 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 163 place count 71 transition count 404
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 178 place count 71 transition count 389
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 179 place count 71 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 180 place count 70 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 180 place count 70 transition count 382
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 194 place count 62 transition count 382
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 2 rules applied. Total rules applied 196 place count 62 transition count 380
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 200 place count 60 transition count 378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 200 place count 60 transition count 376
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 206 place count 56 transition count 376
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 212 place count 53 transition count 373
Graph (trivial) has 29 edges and 53 vertex of which 2 / 53 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 214 place count 51 transition count 373
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 12 with 156 rules applied. Total rules applied 370 place count 51 transition count 217
Applied a total of 370 rules in 72 ms. Remains 51 /131 variables (removed 80) and now considering 217/1396 (removed 1179) transitions.
[2022-05-16 07:20:28] [INFO ] Flow matrix only has 127 transitions (discarded 90 similar events)
// Phase 1: matrix 127 rows 51 cols
[2022-05-16 07:20:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:20:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-16 07:20:28] [INFO ] Flow matrix only has 127 transitions (discarded 90 similar events)
// Phase 1: matrix 127 rows 51 cols
[2022-05-16 07:20:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:20:28] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 07:20:28] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [7, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 122 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/131 places, 217/1396 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/131 places, 217/1396 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-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:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-11 finished in 268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(X(p0)))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Graph (trivial) has 112 edges and 131 vertex of which 17 / 131 are part of one of the 6 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 759 transitions
Reduce isomorphic transitions removed 759 transitions.
Reduce places removed 1 places and 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 119 transition count 633
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 116 transition count 633
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 116 transition count 630
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 113 transition count 630
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 19 place count 107 transition count 528
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 107 transition count 528
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 55 place count 107 transition count 498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 107 transition count 497
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 106 transition count 497
Performed 12 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 84 place count 91 transition count 461
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 69 edges and 91 vertex of which 4 / 91 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 92 place count 89 transition count 454
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 97 place count 88 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 105 place count 83 transition count 447
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 65 edges and 83 vertex of which 2 / 83 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 33 rules applied. Total rules applied 138 place count 82 transition count 415
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 143 place count 80 transition count 412
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 7 with 3 rules applied. Total rules applied 146 place count 78 transition count 411
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 147 place count 78 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 148 place count 77 transition count 410
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 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 152 place count 75 transition count 408
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 158 place count 72 transition count 408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 160 place count 72 transition count 406
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 175 place count 72 transition count 391
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 176 place count 72 transition count 390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 177 place count 71 transition count 390
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 177 place count 71 transition count 384
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 191 place count 63 transition count 384
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 2 rules applied. Total rules applied 193 place count 63 transition count 382
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 197 place count 61 transition count 380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 2 Pre rules applied. Total rules applied 197 place count 61 transition count 378
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 203 place count 57 transition count 378
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 209 place count 54 transition count 375
Graph (trivial) has 36 edges and 54 vertex of which 2 / 54 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 211 place count 52 transition count 375
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 14 with 156 rules applied. Total rules applied 367 place count 52 transition count 219
Applied a total of 367 rules in 70 ms. Remains 52 /131 variables (removed 79) and now considering 219/1396 (removed 1177) transitions.
[2022-05-16 07:20:28] [INFO ] Flow matrix only has 129 transitions (discarded 90 similar events)
// Phase 1: matrix 129 rows 52 cols
[2022-05-16 07:20:28] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 07:20:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-16 07:20:28] [INFO ] Flow matrix only has 129 transitions (discarded 90 similar events)
// Phase 1: matrix 129 rows 52 cols
[2022-05-16 07:20:28] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 07:20:28] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 07:20:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [7, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 151 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/131 places, 219/1396 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/131 places, 219/1396 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-12 finished in 392 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)&&p1))||F(p2))))'
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 124 transition count 1131
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 124 transition count 1131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 124 transition count 1128
Applied a total of 17 rules in 10 ms. Remains 124 /131 variables (removed 7) and now considering 1128/1396 (removed 268) transitions.
[2022-05-16 07:20:29] [INFO ] Flow matrix only has 422 transitions (discarded 706 similar events)
// Phase 1: matrix 422 rows 124 cols
[2022-05-16 07:20:29] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-16 07:20:29] [INFO ] Implicit Places using invariants in 198 ms returned []
[2022-05-16 07:20:29] [INFO ] Flow matrix only has 422 transitions (discarded 706 similar events)
// Phase 1: matrix 422 rows 124 cols
[2022-05-16 07:20:29] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 07:20:29] [INFO ] State equation strengthened by 277 read => feed constraints.
[2022-05-16 07:20:29] [INFO ] Implicit Places using invariants and state equation in 512 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 718 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/131 places, 1128/1396 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/131 places, 1128/1396 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(OR (EQ s22 0) (EQ s44 1)), p0:(OR (EQ s51 0) (EQ s93 1)), p1:(OR (EQ s52 0) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4463 ms.
Product exploration explored 100000 steps with 50000 reset in 4446 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))
Knowledge based reduction with 6 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA EnergyBus-PT-none-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLCardinality-13 finished in 9898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1396/1396 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 122 transition count 1127
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 122 transition count 1127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 122 transition count 1124
Applied a total of 21 rules in 8 ms. Remains 122 /131 variables (removed 9) and now considering 1124/1396 (removed 272) transitions.
[2022-05-16 07:20:38] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 122 cols
[2022-05-16 07:20:38] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 07:20:39] [INFO ] Implicit Places using invariants in 194 ms returned []
[2022-05-16 07:20:39] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 122 cols
[2022-05-16 07:20:39] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 07:20:39] [INFO ] State equation strengthened by 277 read => feed constraints.
[2022-05-16 07:20:39] [INFO ] Implicit Places using invariants and state equation in 556 ms returned [20, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 759 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/131 places, 1124/1396 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 1124/1124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 120/131 places, 1124/1396 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-14 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:(NEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-14 finished in 855 ms.
All properties solved by simple procedures.
Total runtime 40921 ms.

BK_STOP 1652685639861

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="EnergyBus-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is EnergyBus-PT-none, 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 r078-tall-165260110300451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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