fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r169-tall-167838855400131
Last Updated
May 14, 2023

About the Execution of LTSMin+red for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
574.247 54268.00 73136.00 1023.20 TFFTFTFTTTFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855400131.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 EnergyBus-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:49 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.8K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.2M 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 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 1678493590495

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=EnergyBus-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 00:13:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:13:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:13:12] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2023-03-11 00:13:12] [INFO ] Transformed 157 places.
[2023-03-11 00:13:12] [INFO ] Transformed 4430 transitions.
[2023-03-11 00:13:12] [INFO ] Found NUPN structural information;
[2023-03-11 00:13:12] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 446 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 4 formulas.
Deduced a syphon composed of 4 places in 22 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-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 135 transition count 1235
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 135 transition count 1235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 135 transition count 1234
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 135 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 134 transition count 1225
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 134 transition count 1225
Applied a total of 47 rules in 99 ms. Remains 134 /153 variables (removed 19) and now considering 1225/1913 (removed 688) transitions.
[2023-03-11 00:13:13] [INFO ] Flow matrix only has 459 transitions (discarded 766 similar events)
// Phase 1: matrix 459 rows 134 cols
[2023-03-11 00:13:13] [INFO ] Computed 23 place invariants in 27 ms
[2023-03-11 00:13:13] [INFO ] Implicit Places using invariants in 520 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 551 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/153 places, 1225/1913 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 658 ms. Remains : 133/153 places, 1225/1913 transitions.
Support contains 24 out of 133 places after structural reductions.
[2023-03-11 00:13:14] [INFO ] Flatten gal took : 267 ms
[2023-03-11 00:13:14] [INFO ] Flatten gal took : 142 ms
[2023-03-11 00:13:14] [INFO ] Input system was already deterministic with 1225 transitions.
Support contains 22 out of 133 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 00:13:15] [INFO ] Flow matrix only has 459 transitions (discarded 766 similar events)
// Phase 1: matrix 459 rows 133 cols
[2023-03-11 00:13:15] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-11 00:13:15] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:13:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 00:13:15] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:13:15] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 00:13:15] [INFO ] State equation strengthened by 297 read => feed constraints.
[2023-03-11 00:13:15] [INFO ] After 102ms SMT Verify possible using 297 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 00:13:15] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 4 ms to minimize.
[2023-03-11 00:13:15] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
[2023-03-11 00:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-03-11 00:13:15] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-11 00:13:16] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Graph (trivial) has 109 edges and 133 vertex of which 13 / 133 are part of one of the 5 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions removed 22 transitions
Ensure Unique test removed 625 transitions
Reduce isomorphic transitions removed 647 transitions.
Graph (complete) has 658 edges and 125 vertex of which 122 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 122 transition count 570
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 118 transition count 568
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 118 transition count 560
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 110 transition count 560
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 38 place count 102 transition count 518
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 102 transition count 518
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 77 place count 102 transition count 487
Performed 11 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 99 place count 91 transition count 464
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 113 place count 91 transition count 450
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 127 place count 84 transition count 470
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 135 place count 84 transition count 462
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 196 place count 84 transition count 401
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 4 rules applied. Total rules applied 200 place count 83 transition count 398
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 203 place count 80 transition count 398
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 203 place count 80 transition count 395
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 211 place count 75 transition count 395
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 212 place count 75 transition count 394
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 8 with 8 rules applied. Total rules applied 220 place count 71 transition count 390
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 228 place count 71 transition count 382
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 236 place count 63 transition count 382
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 237 place count 63 transition count 404
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 244 place count 62 transition count 398
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 250 place count 62 transition count 392
Applied a total of 250 rules in 304 ms. Remains 62 /133 variables (removed 71) and now considering 392/1225 (removed 833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 62/133 places, 392/1225 transitions.
Finished random walk after 7692 steps, including 2 resets, run visited all 2 properties in 101 ms. (steps per millisecond=76 )
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 2 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Graph (trivial) has 116 edges and 133 vertex of which 16 / 133 are part of one of the 6 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 646 transitions
Reduce isomorphic transitions removed 646 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 120 transition count 576
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 120 transition count 570
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 114 transition count 570
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 25 place count 106 transition count 528
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 106 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 63 place count 106 transition count 498
Performed 11 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 88 place count 92 transition count 463
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 72 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 96 place count 90 transition count 456
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 101 place count 89 transition count 452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 101 place count 89 transition count 451
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 88 transition count 451
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 111 place count 83 transition count 448
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 67 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 144 place count 82 transition count 416
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 149 place count 80 transition count 413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 152 place count 78 transition count 412
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 154 place count 78 transition count 410
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 156 place count 76 transition count 410
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 160 place count 74 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 166 place count 71 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 168 place count 71 transition count 406
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 184 place count 71 transition count 390
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 185 place count 71 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 186 place count 70 transition count 389
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 186 place count 70 transition count 383
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 12 with 14 rules applied. Total rules applied 200 place count 62 transition count 383
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 202 place count 62 transition count 381
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 206 place count 60 transition count 379
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 2 Pre rules applied. Total rules applied 206 place count 60 transition count 377
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 14 with 6 rules applied. Total rules applied 212 place count 56 transition count 377
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 218 place count 53 transition count 374
Graph (trivial) has 38 edges and 53 vertex of which 2 / 53 are part of one of the 1 SCC in 1 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 220 place count 51 transition count 374
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 14 with 156 rules applied. Total rules applied 376 place count 51 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 377 place count 50 transition count 217
Applied a total of 377 rules in 234 ms. Remains 50 /133 variables (removed 83) and now considering 217/1225 (removed 1008) transitions.
[2023-03-11 00:13:17] [INFO ] Flow matrix only has 128 transitions (discarded 89 similar events)
// Phase 1: matrix 128 rows 50 cols
[2023-03-11 00:13:17] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 00:13:18] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-11 00:13:18] [INFO ] Flow matrix only has 128 transitions (discarded 89 similar events)
[2023-03-11 00:13:18] [INFO ] Invariant cache hit.
[2023-03-11 00:13:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-11 00:13:18] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [7, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 335 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/133 places, 217/1225 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 573 ms. Remains : 48/133 places, 217/1225 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s45 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 20 steps with 0 reset in 3 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-01 finished in 1785 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(p0))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 1126
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 1126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 122 transition count 1124
Applied a total of 24 rules in 10 ms. Remains 122 /133 variables (removed 11) and now considering 1124/1225 (removed 101) transitions.
[2023-03-11 00:13:18] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 122 cols
[2023-03-11 00:13:18] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-11 00:13:19] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-11 00:13:19] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
[2023-03-11 00:13:19] [INFO ] Invariant cache hit.
[2023-03-11 00:13:19] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-11 00:13:19] [INFO ] Implicit Places using invariants and state equation in 699 ms returned [20, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1328 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/133 places, 1124/1225 transitions.
Applied a total of 0 rules in 9 ms. Remains 120 /120 variables (removed 0) and now considering 1124/1124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1348 ms. Remains : 120/133 places, 1124/1225 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s105 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4863 ms.
Product exploration explored 100000 steps with 50000 reset in 4774 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 : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EnergyBus-PT-none-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLCardinality-03 finished in 11196 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(G(p0))&&F(p1))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Graph (trivial) has 112 edges and 133 vertex of which 15 / 133 are part of one of the 6 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 643 transitions
Reduce isomorphic transitions removed 643 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 580
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 122 transition count 580
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 122 transition count 574
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 116 transition count 574
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 24 place count 109 transition count 533
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 109 transition count 533
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 109 transition count 503
Performed 12 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 85 place count 97 transition count 467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 97 transition count 465
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 99 place count 91 transition count 476
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 91 transition count 474
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 5 with 53 rules applied. Total rules applied 154 place count 91 transition count 421
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 1 rules applied. Total rules applied 155 place count 91 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 156 place count 90 transition count 420
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 168 place count 84 transition count 414
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 84 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 170 place count 83 transition count 413
Applied a total of 170 rules in 114 ms. Remains 83 /133 variables (removed 50) and now considering 413/1225 (removed 812) transitions.
[2023-03-11 00:13:29] [INFO ] Flow matrix only has 227 transitions (discarded 186 similar events)
// Phase 1: matrix 227 rows 83 cols
[2023-03-11 00:13:29] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-11 00:13:29] [INFO ] Implicit Places using invariants in 225 ms returned [3, 4, 66]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 228 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/133 places, 413/1225 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 80 transition count 411
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 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 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 409
Applied a total of 8 rules in 22 ms. Remains 76 /80 variables (removed 4) and now considering 409/413 (removed 4) transitions.
[2023-03-11 00:13:29] [INFO ] Flow matrix only has 223 transitions (discarded 186 similar events)
// Phase 1: matrix 223 rows 76 cols
[2023-03-11 00:13:29] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-11 00:13:30] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-11 00:13:30] [INFO ] Flow matrix only has 223 transitions (discarded 186 similar events)
[2023-03-11 00:13:30] [INFO ] Invariant cache hit.
[2023-03-11 00:13:30] [INFO ] State equation strengthened by 148 read => feed constraints.
[2023-03-11 00:13:30] [INFO ] Implicit Places using invariants and state equation in 357 ms returned [8, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 517 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/133 places, 409/1225 transitions.
Applied a total of 0 rules in 18 ms. Remains 74 /74 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 902 ms. Remains : 74/133 places, 409/1225 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 0) (EQ s15 1)), p1:(AND (EQ s21 0) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-06 finished in 1118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 125 transition count 1210
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 125 transition count 1210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 125 transition count 1208
Applied a total of 18 rules in 14 ms. Remains 125 /133 variables (removed 8) and now considering 1208/1225 (removed 17) transitions.
[2023-03-11 00:13:30] [INFO ] Flow matrix only has 442 transitions (discarded 766 similar events)
// Phase 1: matrix 442 rows 125 cols
[2023-03-11 00:13:30] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-11 00:13:31] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-11 00:13:31] [INFO ] Flow matrix only has 442 transitions (discarded 766 similar events)
[2023-03-11 00:13:31] [INFO ] Invariant cache hit.
[2023-03-11 00:13:31] [INFO ] State equation strengthened by 297 read => feed constraints.
[2023-03-11 00:13:31] [INFO ] Implicit Places using invariants and state equation in 678 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1005 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/133 places, 1208/1225 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 1208/1208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1024 ms. Remains : 123/133 places, 1208/1225 transitions.
Stuttering acceptance computed with spot in 111 ms :[(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-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (NEQ s76 0) (NEQ s67 1)), p0:(OR (EQ s50 0) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3685 ms.
Product exploration explored 100000 steps with 33333 reset in 3698 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 (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EnergyBus-PT-none-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLCardinality-07 finished in 8683 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) U X(p1)))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 124 transition count 1130
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 124 transition count 1130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 124 transition count 1128
Applied a total of 20 rules in 15 ms. Remains 124 /133 variables (removed 9) and now considering 1128/1225 (removed 97) transitions.
[2023-03-11 00:13:39] [INFO ] Flow matrix only has 422 transitions (discarded 706 similar events)
// Phase 1: matrix 422 rows 124 cols
[2023-03-11 00:13:39] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-11 00:13:39] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-11 00:13:39] [INFO ] Flow matrix only has 422 transitions (discarded 706 similar events)
[2023-03-11 00:13:39] [INFO ] Invariant cache hit.
[2023-03-11 00:13:39] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-11 00:13:40] [INFO ] Implicit Places using invariants and state equation in 656 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 997 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/133 places, 1128/1225 transitions.
Applied a total of 0 rules in 11 ms. Remains 122 /122 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1026 ms. Remains : 122/133 places, 1128/1225 transitions.
Stuttering acceptance computed with spot in 393 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s105 0) (EQ s59 1)), p1:(OR (EQ s36 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4774 ms.
Product exploration explored 100000 steps with 50000 reset in 4804 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 p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 143 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EnergyBus-PT-none-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLCardinality-08 finished in 11173 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(p0))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 123 transition count 1128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 123 transition count 1128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 123 transition count 1127
Applied a total of 21 rules in 10 ms. Remains 123 /133 variables (removed 10) and now considering 1127/1225 (removed 98) transitions.
[2023-03-11 00:13:50] [INFO ] Flow matrix only has 421 transitions (discarded 706 similar events)
// Phase 1: matrix 421 rows 123 cols
[2023-03-11 00:13:50] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-11 00:13:50] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-11 00:13:50] [INFO ] Flow matrix only has 421 transitions (discarded 706 similar events)
[2023-03-11 00:13:50] [INFO ] Invariant cache hit.
[2023-03-11 00:13:51] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-11 00:13:51] [INFO ] Implicit Places using invariants and state equation in 581 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 903 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/133 places, 1127/1225 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 1127/1127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 923 ms. Remains : 121/133 places, 1127/1225 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-10 finished in 1212 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((p0 U p1)))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 124 transition count 1130
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 124 transition count 1130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 124 transition count 1129
Applied a total of 19 rules in 12 ms. Remains 124 /133 variables (removed 9) and now considering 1129/1225 (removed 96) transitions.
[2023-03-11 00:13:51] [INFO ] Flow matrix only has 423 transitions (discarded 706 similar events)
// Phase 1: matrix 423 rows 124 cols
[2023-03-11 00:13:51] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-11 00:13:52] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-11 00:13:52] [INFO ] Flow matrix only has 423 transitions (discarded 706 similar events)
[2023-03-11 00:13:52] [INFO ] Invariant cache hit.
[2023-03-11 00:13:52] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-11 00:13:52] [INFO ] Implicit Places using invariants and state equation in 570 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 867 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/133 places, 1129/1225 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 1129/1129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 883 ms. Remains : 122/133 places, 1129/1225 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : EnergyBus-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s44 0) (EQ s25 1)), p0:(OR (EQ s45 0) (EQ s60 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 4914 ms.
Product exploration explored 100000 steps with 50000 reset in 4936 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) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EnergyBus-PT-none-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLCardinality-11 finished in 11072 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 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 1225/1225 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 1126
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 1126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 122 transition count 1124
Applied a total of 24 rules in 11 ms. Remains 122 /133 variables (removed 11) and now considering 1124/1225 (removed 101) transitions.
[2023-03-11 00:14:02] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 122 cols
[2023-03-11 00:14:02] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-11 00:14:03] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-11 00:14:03] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
[2023-03-11 00:14:03] [INFO ] Invariant cache hit.
[2023-03-11 00:14:03] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-11 00:14:03] [INFO ] Implicit Places using invariants and state equation in 578 ms returned [20, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 789 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/133 places, 1124/1225 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 LTL mode , in 2 iterations and 807 ms. Remains : 120/133 places, 1124/1225 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-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:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLCardinality-13 finished in 912 ms.
All properties solved by simple procedures.
Total runtime 51532 ms.
ITS solved all properties within timeout

BK_STOP 1678493644763

--------------------
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

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="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 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 r169-tall-167838855400131"
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 ;