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-165260110300450.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110300450
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME EnergyBus-PT-none-CTLFireability-01
FORMULA_NAME EnergyBus-PT-none-CTLFireability-02
FORMULA_NAME EnergyBus-PT-none-CTLFireability-03
FORMULA_NAME EnergyBus-PT-none-CTLFireability-04
FORMULA_NAME EnergyBus-PT-none-CTLFireability-05
FORMULA_NAME EnergyBus-PT-none-CTLFireability-06
FORMULA_NAME EnergyBus-PT-none-CTLFireability-07
FORMULA_NAME EnergyBus-PT-none-CTLFireability-08
FORMULA_NAME EnergyBus-PT-none-CTLFireability-09
FORMULA_NAME EnergyBus-PT-none-CTLFireability-10
FORMULA_NAME EnergyBus-PT-none-CTLFireability-11
FORMULA_NAME EnergyBus-PT-none-CTLFireability-12
FORMULA_NAME EnergyBus-PT-none-CTLFireability-13
FORMULA_NAME EnergyBus-PT-none-CTLFireability-14
FORMULA_NAME EnergyBus-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652685530681

Running Version 202205111006
[2022-05-16 07:18:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:18:52] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2022-05-16 07:18:52] [INFO ] Transformed 157 places.
[2022-05-16 07:18:52] [INFO ] Transformed 4430 transitions.
[2022-05-16 07:18:52] [INFO ] Found NUPN structural information;
[2022-05-16 07:18:52] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 481 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 4 places in 23 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-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 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 1876
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 133 transition count 1876
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 133 transition count 1873
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 133 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 132 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 132 transition count 1864
Applied a total of 53 rules in 70 ms. Remains 132 /153 variables (removed 21) and now considering 1864/1913 (removed 49) transitions.
[2022-05-16 07:18:52] [INFO ] Flow matrix only has 606 transitions (discarded 1258 similar events)
// Phase 1: matrix 606 rows 132 cols
[2022-05-16 07:18:52] [INFO ] Computed 23 place invariants in 25 ms
[2022-05-16 07:18:52] [INFO ] Implicit Places using invariants in 225 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 257 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/153 places, 1864/1913 transitions.
Applied a total of 0 rules in 10 ms. Remains 131 /131 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 131/153 places, 1864/1913 transitions.
Support contains 42 out of 131 places after structural reductions.
[2022-05-16 07:18:53] [INFO ] Flatten gal took : 364 ms
[2022-05-16 07:18:53] [INFO ] Flatten gal took : 222 ms
[2022-05-16 07:18:54] [INFO ] Input system was already deterministic with 1864 transitions.
Support contains 39 out of 131 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 756 ms. (steps per millisecond=13 ) properties (out of 42) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Interrupted probabilistic random walk after 126139 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126139 steps, saw 70216 distinct states, run finished after 3008 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 39 properties.
[2022-05-16 07:18:58] [INFO ] Flow matrix only has 606 transitions (discarded 1258 similar events)
// Phase 1: matrix 606 rows 131 cols
[2022-05-16 07:18:58] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-16 07:18:59] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-16 07:18:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 07:19:00] [INFO ] After 1867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2022-05-16 07:19:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-16 07:19:00] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 07:19:04] [INFO ] After 3318ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :38
[2022-05-16 07:19:04] [INFO ] State equation strengthened by 461 read => feed constraints.
[2022-05-16 07:19:07] [INFO ] After 3144ms SMT Verify possible using 461 Read/Feed constraints in natural domain returned unsat :1 sat :38
[2022-05-16 07:19:08] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 13 ms to minimize.
[2022-05-16 07:19:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 224 ms
[2022-05-16 07:19:08] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-05-16 07:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-16 07:19:10] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
[2022-05-16 07:19:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-16 07:19:11] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 3 ms to minimize.
[2022-05-16 07:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2022-05-16 07:19:11] [INFO ] After 7567ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :36
Attempting to minimize the solution found.
Minimization took 2989 ms.
[2022-05-16 07:19:14] [INFO ] After 14178ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :36
Fused 39 Parikh solutions to 36 different solutions.
Parikh walk visited 0 properties in 1825 ms.
Support contains 37 out of 131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 52 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 13 ms
Free SCC test removed 6 places
Drop transitions removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 736 edges and 125 vertex of which 122 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.30 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 1835
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 118 transition count 1835
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 118 transition count 1831
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 114 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 113 transition count 1829
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 113 transition count 1829
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 104 transition count 1820
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 104 transition count 1818
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 99 transition count 1827
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 60 place count 99 transition count 1819
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 139 place count 99 transition count 1740
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 143 place count 97 transition count 1738
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 146 place count 95 transition count 1737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 147 place count 94 transition count 1737
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 147 place count 94 transition count 1735
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 151 place count 92 transition count 1735
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 153 place count 92 transition count 1733
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 156 place count 90 transition count 1732
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 157 place count 90 transition count 1731
Applied a total of 157 rules in 1520 ms. Remains 90 /131 variables (removed 41) and now considering 1731/1864 (removed 133) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/131 places, 1731/1864 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 36) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2022-05-16 07:19:18] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
// Phase 1: matrix 525 rows 90 cols
[2022-05-16 07:19:18] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-16 07:19:19] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:19:19] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:19:21] [INFO ] After 1736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2022-05-16 07:19:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:19:21] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 07:19:23] [INFO ] After 2568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2022-05-16 07:19:23] [INFO ] State equation strengthened by 456 read => feed constraints.
[2022-05-16 07:19:26] [INFO ] After 2555ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2022-05-16 07:19:26] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2022-05-16 07:19:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-16 07:19:26] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2022-05-16 07:19:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-16 07:19:29] [INFO ] After 5789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 2550 ms.
[2022-05-16 07:19:32] [INFO ] After 11092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 7 ms.
Support contains 33 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 1731/1731 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 1730
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 1728
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 1728
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 88 transition count 1727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 1727
Applied a total of 6 rules in 553 ms. Remains 87 /90 variables (removed 3) and now considering 1727/1731 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/90 places, 1727/1731 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2022-05-16 07:19:33] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 87 cols
[2022-05-16 07:19:33] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 07:19:33] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:19:33] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:19:35] [INFO ] After 1562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2022-05-16 07:19:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:19:35] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 07:19:37] [INFO ] After 2200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2022-05-16 07:19:37] [INFO ] State equation strengthened by 456 read => feed constraints.
[2022-05-16 07:19:40] [INFO ] After 2480ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2022-05-16 07:19:41] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-16 07:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-16 07:19:42] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2022-05-16 07:19:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-16 07:19:43] [INFO ] After 5899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 2532 ms.
[2022-05-16 07:19:46] [INFO ] After 10810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 8 ms.
Support contains 32 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1727/1727 transitions.
Applied a total of 0 rules in 252 ms. Remains 87 /87 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 1727/1727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 148459 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148459 steps, saw 71973 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 27 properties.
[2022-05-16 07:19:50] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 87 cols
[2022-05-16 07:19:50] [INFO ] Computed 19 place invariants in 10 ms
[2022-05-16 07:19:50] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:19:50] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 07:19:52] [INFO ] After 1457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2022-05-16 07:19:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:19:52] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:19:54] [INFO ] After 2263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2022-05-16 07:19:54] [INFO ] State equation strengthened by 456 read => feed constraints.
[2022-05-16 07:19:56] [INFO ] After 2404ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2022-05-16 07:19:57] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2022-05-16 07:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-16 07:19:59] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2022-05-16 07:19:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-16 07:20:00] [INFO ] After 5988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 2620 ms.
[2022-05-16 07:20:03] [INFO ] After 11012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 4 ms.
Support contains 32 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1727/1727 transitions.
Applied a total of 0 rules in 255 ms. Remains 87 /87 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 1727/1727 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1727/1727 transitions.
Applied a total of 0 rules in 242 ms. Remains 87 /87 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
[2022-05-16 07:20:03] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 87 cols
[2022-05-16 07:20:03] [INFO ] Computed 19 place invariants in 8 ms
[2022-05-16 07:20:03] [INFO ] Implicit Places using invariants in 77 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 86/87 places, 1727/1727 transitions.
Applied a total of 0 rules in 241 ms. Remains 86 /86 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 86/87 places, 1727/1727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 164087 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164087 steps, saw 79256 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 27 properties.
[2022-05-16 07:20:07] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 86 cols
[2022-05-16 07:20:07] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-16 07:20:07] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 07:20:07] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:20:09] [INFO ] After 1314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2022-05-16 07:20:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 07:20:09] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 07:20:11] [INFO ] After 2269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2022-05-16 07:20:11] [INFO ] State equation strengthened by 448 read => feed constraints.
[2022-05-16 07:20:13] [INFO ] After 2138ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2022-05-16 07:20:14] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-05-16 07:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-16 07:20:16] [INFO ] After 4646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1982 ms.
[2022-05-16 07:20:18] [INFO ] After 9050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 7 ms.
Support contains 32 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 1727/1727 transitions.
Applied a total of 0 rules in 241 ms. Remains 86 /86 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 1727/1727 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 1727/1727 transitions.
Applied a total of 0 rules in 241 ms. Remains 86 /86 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
[2022-05-16 07:20:18] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 86 cols
[2022-05-16 07:20:18] [INFO ] Computed 18 place invariants in 9 ms
[2022-05-16 07:20:18] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-16 07:20:18] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 86 cols
[2022-05-16 07:20:18] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-16 07:20:18] [INFO ] State equation strengthened by 448 read => feed constraints.
[2022-05-16 07:20:19] [INFO ] Implicit Places using invariants and state equation in 433 ms returned [13, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 508 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 84/86 places, 1727/1727 transitions.
Applied a total of 0 rules in 257 ms. Remains 84 /84 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 84/86 places, 1727/1727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 137900 steps, run timeout after 3005 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137900 steps, saw 66842 distinct states, run finished after 3008 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 27 properties.
[2022-05-16 07:20:23] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 84 cols
[2022-05-16 07:20:23] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-16 07:20:23] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-16 07:20:23] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 7 ms returned sat
[2022-05-16 07:20:25] [INFO ] After 1474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2022-05-16 07:20:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-16 07:20:25] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 07:20:27] [INFO ] After 2221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2022-05-16 07:20:27] [INFO ] State equation strengthened by 448 read => feed constraints.
[2022-05-16 07:20:29] [INFO ] After 2392ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2022-05-16 07:20:30] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-16 07:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-16 07:20:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2022-05-16 07:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-16 07:20:32] [INFO ] After 5382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 2311 ms.
[2022-05-16 07:20:35] [INFO ] After 10062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 4 ms.
Support contains 32 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 1727/1727 transitions.
Applied a total of 0 rules in 265 ms. Remains 84 /84 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 1727/1727 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 1727/1727 transitions.
Applied a total of 0 rules in 260 ms. Remains 84 /84 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
[2022-05-16 07:20:35] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 84 cols
[2022-05-16 07:20:35] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-16 07:20:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-05-16 07:20:35] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 84 cols
[2022-05-16 07:20:35] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 07:20:36] [INFO ] State equation strengthened by 448 read => feed constraints.
[2022-05-16 07:20:36] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2022-05-16 07:20:36] [INFO ] Redundant transitions in 534 ms returned []
[2022-05-16 07:20:36] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 84 cols
[2022-05-16 07:20:36] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 07:20:37] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 1727/1727 transitions.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2022-05-16 07:20:37] [INFO ] Flatten gal took : 181 ms
[2022-05-16 07:20:37] [INFO ] Flatten gal took : 193 ms
[2022-05-16 07:20:38] [INFO ] Input system was already deterministic with 1864 transitions.
Computed a total of 3 stabilizing places and 130 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 74 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 121 transition count 1844
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 117 transition count 1844
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 24 place count 110 transition count 1344
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 110 transition count 1344
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 2 with 12 rules applied. Total rules applied 43 place count 104 transition count 1338
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 104 transition count 1326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 104 transition count 1325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 103 transition count 1325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 57 place count 103 transition count 1323
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 101 transition count 1323
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 69 place count 97 transition count 1319
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 72 place count 97 transition count 1316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 96 transition count 1316
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 5 with 4 rules applied. Total rules applied 77 place count 94 transition count 1314
Applied a total of 77 rules in 833 ms. Remains 94 /131 variables (removed 37) and now considering 1314/1864 (removed 550) transitions.
[2022-05-16 07:20:39] [INFO ] Flow matrix only has 365 transitions (discarded 949 similar events)
// Phase 1: matrix 365 rows 94 cols
[2022-05-16 07:20:39] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-16 07:20:39] [INFO ] Implicit Places using invariants in 134 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 93/131 places, 1314/1864 transitions.
Applied a total of 0 rules in 161 ms. Remains 93 /93 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 93/131 places, 1314/1864 transitions.
[2022-05-16 07:20:39] [INFO ] Flatten gal took : 78 ms
[2022-05-16 07:20:39] [INFO ] Flatten gal took : 85 ms
[2022-05-16 07:20:39] [INFO ] Input system was already deterministic with 1314 transitions.
[2022-05-16 07:20:39] [INFO ] Flatten gal took : 84 ms
[2022-05-16 07:20:39] [INFO ] Flatten gal took : 82 ms
[2022-05-16 07:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10144366562493300797.gal : 47 ms
[2022-05-16 07:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11590736335797723058.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10144366562493300797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11590736335797723058.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98601e+09,4.21636,133320,2,9342,5,167169,6,0,1679,147972,0


Converting to forward existential form...Done !
original formula: EF(((E(EG(AG(((((p16==1)&&(p19==1))&&((p41==1)&&(p58==1)))&&(((p97==1)&&(p108==1))&&((p114==1)&&(p139==1)))))) U EG(((((p16==1)&&(p19==1)...434
=> equivalent forward existential formula: (([FwdG(FwdU(FwdU(Init,TRUE),EG(!(E(TRUE U !(((((p16==1)&&(p19==1))&&((p41==1)&&(p58==1)))&&(((p97==1)&&(p108==1...557
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t26, t27, t37, t39, t53, t66, t72, t73, t75, t76, t82, t84, t86, t90, t92, t93, t94, ...299
Hit Full ! (commute/partial/dont) 85/5091/1229
Detected timeout of ITS tools.
[2022-05-16 07:21:10] [INFO ] Flatten gal took : 78 ms
[2022-05-16 07:21:10] [INFO ] Applying decomposition
[2022-05-16 07:21:10] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2712393237136792855.txt' '-o' '/tmp/graph2712393237136792855.bin' '-w' '/tmp/graph2712393237136792855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2712393237136792855.bin' '-l' '-1' '-v' '-w' '/tmp/graph2712393237136792855.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:21:10] [INFO ] Decomposing Gal with order
[2022-05-16 07:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:21:11] [INFO ] Removed a total of 6106 redundant transitions.
[2022-05-16 07:21:11] [INFO ] Flatten gal took : 323 ms
[2022-05-16 07:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 41 ms.
[2022-05-16 07:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15398164103744585470.gal : 4 ms
[2022-05-16 07:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14223808710720419555.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15398164103744585470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14223808710720419555.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98601e+09,0.656681,33780,880,152,35366,1518,762,216003,143,7343,0


Converting to forward existential form...Done !
original formula: EF(((E(EG(AG(((((i3.u2.p16==1)&&(i3.u2.p19==1))&&((i0.u11.p41==1)&&(i0.u11.p58==1)))&&(((i0.u17.p97==1)&&(i4.u18.p108==1))&&((i0.u11.p114...649
=> equivalent forward existential formula: (([FwdG(FwdU(FwdU(Init,TRUE),EG(!(E(TRUE U !(((((i3.u2.p16==1)&&(i3.u2.p19==1))&&((i0.u11.p41==1)&&(i0.u11.p58==...772
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t66, t72, t73, t82, t86, t1102, t1312, i1.t885, i1.u3.t886, i2.t97, i2.t96, i2.t94, ...362
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,1.0314,34836,1,0,40741,2671,5372,216003,660,8786,112738
FORMULA EnergyBus-PT-none-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1204
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1204
Applied a total of 16 rules in 25 ms. Remains 123 /131 variables (removed 8) and now considering 1204/1864 (removed 660) transitions.
[2022-05-16 07:21:12] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
// Phase 1: matrix 438 rows 123 cols
[2022-05-16 07:21:12] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 07:21:12] [INFO ] Implicit Places using invariants in 176 ms returned []
[2022-05-16 07:21:12] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
// Phase 1: matrix 438 rows 123 cols
[2022-05-16 07:21:12] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 07:21:12] [INFO ] State equation strengthened by 297 read => feed constraints.
[2022-05-16 07:21:13] [INFO ] Implicit Places using invariants and state equation in 663 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 853 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 1204/1864 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/131 places, 1204/1864 transitions.
[2022-05-16 07:21:13] [INFO ] Flatten gal took : 107 ms
[2022-05-16 07:21:13] [INFO ] Flatten gal took : 118 ms
[2022-05-16 07:21:13] [INFO ] Input system was already deterministic with 1204 transitions.
[2022-05-16 07:21:13] [INFO ] Flatten gal took : 114 ms
[2022-05-16 07:21:13] [INFO ] Flatten gal took : 117 ms
[2022-05-16 07:21:13] [INFO ] Time to serialize gal into /tmp/CTLFireability331476598674752579.gal : 10 ms
[2022-05-16 07:21:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2445911175441452638.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability331476598674752579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2445911175441452638.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34532e+11,20.5165,526008,2,27187,5,859918,6,0,1684,778705,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:21:44] [INFO ] Flatten gal took : 124 ms
[2022-05-16 07:21:44] [INFO ] Applying decomposition
[2022-05-16 07:21:44] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17196443501814473426.txt' '-o' '/tmp/graph17196443501814473426.bin' '-w' '/tmp/graph17196443501814473426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17196443501814473426.bin' '-l' '-1' '-v' '-w' '/tmp/graph17196443501814473426.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:21:44] [INFO ] Decomposing Gal with order
[2022-05-16 07:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:21:44] [INFO ] Removed a total of 5790 redundant transitions.
[2022-05-16 07:21:44] [INFO ] Flatten gal took : 150 ms
[2022-05-16 07:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 27 ms.
[2022-05-16 07:21:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15063585651642857497.gal : 3 ms
[2022-05-16 07:21:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7270626262732640239.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15063585651642857497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7270626262732640239.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34532e+11,1.70402,60108,1428,182,89703,844,1018,313589,131,5086,0


Converting to forward existential form...Done !
original formula: EX(EX(AG(((((i4.u6.p16==0)||(i5.u7.p19==0))||((i5.u13.p41==0)||(i5.u13.p58==0)))||(((i4.u22.p93==0)||(i0.u24.p108==0))||((i4.u6.p114==0)|...178
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !(((((i4.u6.p16==0)||(i5.u7.p19==0))||((i5.u13.p41==0)||(i5.u13.p58==0)))||(((i4.u22...235
Reverse transition relation is NOT exact ! Due to transitions t19, t50, t69, t70, t72, t75, t95, t108, t117, t1158, t1175, t1176, t1177, t1179, t1188, t118...536
(forward)formula 0,1,8.54627,205160,1,0,317117,2251,6889,1.04393e+06,625,9411,728934
FORMULA EnergyBus-PT-none-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 1716
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 1716
Applied a total of 8 rules in 18 ms. Remains 127 /131 variables (removed 4) and now considering 1716/1864 (removed 148) transitions.
[2022-05-16 07:21:53] [INFO ] Flow matrix only has 566 transitions (discarded 1150 similar events)
// Phase 1: matrix 566 rows 127 cols
[2022-05-16 07:21:53] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-16 07:21:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2022-05-16 07:21:53] [INFO ] Flow matrix only has 566 transitions (discarded 1150 similar events)
// Phase 1: matrix 566 rows 127 cols
[2022-05-16 07:21:53] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-16 07:21:53] [INFO ] State equation strengthened by 425 read => feed constraints.
[2022-05-16 07:21:53] [INFO ] Implicit Places using invariants and state equation in 533 ms returned [20, 99]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 613 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 1716/1864 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1716/1716 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/131 places, 1716/1864 transitions.
[2022-05-16 07:21:54] [INFO ] Flatten gal took : 143 ms
[2022-05-16 07:21:54] [INFO ] Flatten gal took : 154 ms
[2022-05-16 07:21:54] [INFO ] Input system was already deterministic with 1716 transitions.
[2022-05-16 07:21:54] [INFO ] Flatten gal took : 151 ms
[2022-05-16 07:21:54] [INFO ] Flatten gal took : 150 ms
[2022-05-16 07:21:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15368979871688583174.gal : 14 ms
[2022-05-16 07:21:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9472539182064565206.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15368979871688583174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9472539182064565206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.60305e+11,13.532,307272,2,21602,5,575366,6,0,2212,534500,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:22:25] [INFO ] Flatten gal took : 160 ms
[2022-05-16 07:22:25] [INFO ] Applying decomposition
[2022-05-16 07:22:25] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph911942027583840251.txt' '-o' '/tmp/graph911942027583840251.bin' '-w' '/tmp/graph911942027583840251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph911942027583840251.bin' '-l' '-1' '-v' '-w' '/tmp/graph911942027583840251.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:22:25] [INFO ] Decomposing Gal with order
[2022-05-16 07:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:22:25] [INFO ] Removed a total of 8326 redundant transitions.
[2022-05-16 07:22:25] [INFO ] Flatten gal took : 214 ms
[2022-05-16 07:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 32 ms.
[2022-05-16 07:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9243850701137163666.gal : 5 ms
[2022-05-16 07:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14283461653305735198.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9243850701137163666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14283461653305735198.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.60305e+11,3.32169,96956,1286,214,93130,4763,1296,759252,164,43165,0


Converting to forward existential form...Done !
original formula: E(E(E((AX(((((i2.u5.p16==1)&&(i2.u5.p19==1))&&((i2.u11.p41==1)&&(i2.u11.p58==1)))&&(((i2.u22.p88==1)&&(i12.u24.p110==1))&&((i2.u22.p114==...2140
=> equivalent forward existential formula: [(FwdU((FwdU(Init,E(E((!(EX(!(((((i2.u5.p16==1)&&(i2.u5.p19==1))&&((i2.u11.p41==1)&&(i2.u11.p58==1)))&&(((i2.u22...2570
Reverse transition relation is NOT exact ! Due to transitions t7, t13, t19, t108, t117, t118, t148, t149, t208, t209, t406, t407, t436, t437, t496, t497, t...806
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,22.7006,419320,1,0,344860,7736,9281,3.61164e+06,737,45146,918801
FORMULA EnergyBus-PT-none-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1204
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1204
Applied a total of 16 rules in 11 ms. Remains 123 /131 variables (removed 8) and now considering 1204/1864 (removed 660) transitions.
[2022-05-16 07:22:48] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
// Phase 1: matrix 438 rows 123 cols
[2022-05-16 07:22:48] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-16 07:22:48] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-05-16 07:22:48] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
// Phase 1: matrix 438 rows 123 cols
[2022-05-16 07:22:48] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-16 07:22:48] [INFO ] State equation strengthened by 297 read => feed constraints.
[2022-05-16 07:22:49] [INFO ] Implicit Places using invariants and state equation in 528 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 680 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 1204/1864 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/131 places, 1204/1864 transitions.
[2022-05-16 07:22:49] [INFO ] Flatten gal took : 94 ms
[2022-05-16 07:22:49] [INFO ] Flatten gal took : 97 ms
[2022-05-16 07:22:49] [INFO ] Input system was already deterministic with 1204 transitions.
[2022-05-16 07:22:49] [INFO ] Flatten gal took : 94 ms
[2022-05-16 07:22:49] [INFO ] Flatten gal took : 95 ms
[2022-05-16 07:22:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4181509657682844852.gal : 9 ms
[2022-05-16 07:22:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16837432768724950926.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4181509657682844852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16837432768724950926.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34532e+11,20.9053,526684,2,27187,5,859918,6,0,1684,778705,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:23:20] [INFO ] Flatten gal took : 118 ms
[2022-05-16 07:23:20] [INFO ] Applying decomposition
[2022-05-16 07:23:20] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph909714483799869095.txt' '-o' '/tmp/graph909714483799869095.bin' '-w' '/tmp/graph909714483799869095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph909714483799869095.bin' '-l' '-1' '-v' '-w' '/tmp/graph909714483799869095.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:23:20] [INFO ] Decomposing Gal with order
[2022-05-16 07:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:23:20] [INFO ] Removed a total of 5416 redundant transitions.
[2022-05-16 07:23:20] [INFO ] Flatten gal took : 158 ms
[2022-05-16 07:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 20 ms.
[2022-05-16 07:23:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10282289549001982118.gal : 3 ms
[2022-05-16 07:23:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11713684735043251368.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10282289549001982118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11713684735043251368.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34532e+11,4.98165,127136,2022,264,103940,2170,954,1.09058e+06,172,11041,0


Converting to forward existential form...Done !
original formula: AX(AF((EF(((((i3.u5.p16==1)&&(i3.u20.p19==1))&&((i3.u8.p60==1)&&(i3.u8.p77==1)))&&(((u17.p95==1)&&(i8.u18.p105==1))&&((i3.u5.p113==1)&&(i...326
=> equivalent forward existential formula: [FwdG(EY(Init),!((E(TRUE U ((((i3.u5.p16==1)&&(i3.u20.p19==1))&&((i3.u8.p60==1)&&(i3.u8.p77==1)))&&(((u17.p95==1...377
Reverse transition relation is NOT exact ! Due to transitions t19, t50, t69, t70, t72, t75, t95, t108, t117, t1158, t1175, t1176, t1177, t1179, t1188, t118...510
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,24.7811,509904,1,0,381056,4284,6238,4.53516e+06,911,17508,1116420
FORMULA EnergyBus-PT-none-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 85 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 121 transition count 1843
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 116 transition count 1843
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 27 place count 108 transition count 1215
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 108 transition count 1215
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 47 place count 102 transition count 1209
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 102 transition count 1195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 102 transition count 1194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 101 transition count 1194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 63 place count 101 transition count 1192
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 99 transition count 1192
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 77 place count 94 transition count 1187
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 94 transition count 1184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 93 transition count 1184
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 5 with 4 rules applied. Total rules applied 85 place count 91 transition count 1182
Applied a total of 85 rules in 514 ms. Remains 91 /131 variables (removed 40) and now considering 1182/1864 (removed 682) transitions.
[2022-05-16 07:23:46] [INFO ] Flow matrix only has 280 transitions (discarded 902 similar events)
// Phase 1: matrix 280 rows 91 cols
[2022-05-16 07:23:46] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-16 07:23:46] [INFO ] Implicit Places using invariants in 162 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/131 places, 1182/1864 transitions.
Applied a total of 0 rules in 129 ms. Remains 90 /90 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/131 places, 1182/1864 transitions.
[2022-05-16 07:23:46] [INFO ] Flatten gal took : 63 ms
[2022-05-16 07:23:46] [INFO ] Flatten gal took : 69 ms
[2022-05-16 07:23:46] [INFO ] Input system was already deterministic with 1182 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625010 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625010 steps, saw 242980 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 07:23:49] [INFO ] Flow matrix only has 280 transitions (discarded 902 similar events)
// Phase 1: matrix 280 rows 90 cols
[2022-05-16 07:23:49] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-16 07:23:49] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:23:49] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 07:23:49] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 07:23:50] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2022-05-16 07:23:50] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 07:23:50] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 07:23:50] [INFO ] State equation strengthened by 196 read => feed constraints.
[2022-05-16 07:23:50] [INFO ] After 72ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 07:23:50] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-16 07:23:50] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 315 ms.
Support contains 8 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 1182/1182 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 1171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 11 place count 90 transition count 1166
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 23 place count 83 transition count 1166
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 83 transition count 1165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 82 transition count 1164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 82 transition count 1163
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 3 with 3 rules applied. Total rules applied 29 place count 80 transition count 1163
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 37 place count 76 transition count 1175
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 76 transition count 1172
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 4 with 71 rules applied. Total rules applied 111 place count 76 transition count 1101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 111 place count 76 transition count 1100
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 75 transition count 1100
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 124 place count 75 transition count 1089
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 135 place count 64 transition count 1089
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 263 place count 64 transition count 961
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 64 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 265 place count 63 transition count 1023
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 269 place count 63 transition count 1023
Applied a total of 269 rules in 601 ms. Remains 63 /90 variables (removed 27) and now considering 1023/1182 (removed 159) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/90 places, 1023/1182 transitions.
Finished random walk after 755248 steps, including 2 resets, run visited all 1 properties in 7557 ms. (steps per millisecond=99 )
FORMULA EnergyBus-PT-none-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 85 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 121 transition count 1843
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 116 transition count 1843
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 28 place count 107 transition count 1103
Iterating global reduction 2 with 9 rules applied. Total rules applied 37 place count 107 transition count 1103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 49 place count 101 transition count 1097
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 62 place count 101 transition count 1084
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 101 transition count 1083
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 100 transition count 1083
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 64 place count 100 transition count 1081
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 98 transition count 1081
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 4 with 8 rules applied. Total rules applied 76 place count 94 transition count 1077
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 79 place count 94 transition count 1074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 93 transition count 1074
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 5 with 4 rules applied. Total rules applied 84 place count 91 transition count 1072
Applied a total of 84 rules in 386 ms. Remains 91 /131 variables (removed 40) and now considering 1072/1864 (removed 792) transitions.
[2022-05-16 07:23:59] [INFO ] Flow matrix only has 311 transitions (discarded 761 similar events)
// Phase 1: matrix 311 rows 91 cols
[2022-05-16 07:23:59] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 07:23:59] [INFO ] Implicit Places using invariants in 140 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/131 places, 1072/1864 transitions.
Applied a total of 0 rules in 110 ms. Remains 90 /90 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/131 places, 1072/1864 transitions.
[2022-05-16 07:23:59] [INFO ] Flatten gal took : 56 ms
[2022-05-16 07:23:59] [INFO ] Flatten gal took : 62 ms
[2022-05-16 07:23:59] [INFO ] Input system was already deterministic with 1072 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 698828 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 698828 steps, saw 263707 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 07:24:02] [INFO ] Flow matrix only has 311 transitions (discarded 761 similar events)
// Phase 1: matrix 311 rows 90 cols
[2022-05-16 07:24:02] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-16 07:24:02] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-16 07:24:02] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 07:24:02] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 07:24:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2022-05-16 07:24:02] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 07:24:03] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 07:24:03] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-16 07:24:03] [INFO ] After 81ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 07:24:03] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-16 07:24:03] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 120 ms.
Support contains 8 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 1072/1072 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 1061
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 11 place count 90 transition count 1056
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 23 place count 83 transition count 1056
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 83 transition count 1055
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 82 transition count 1054
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 82 transition count 1053
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 3 with 3 rules applied. Total rules applied 29 place count 80 transition count 1053
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 37 place count 76 transition count 1065
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 76 transition count 1062
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 112 place count 76 transition count 990
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 112 place count 76 transition count 989
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 75 transition count 989
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 124 place count 75 transition count 979
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 134 place count 65 transition count 979
Drop transitions removed 144 transitions
Redundant transition composition rules discarded 144 transitions
Iterating global reduction 5 with 144 rules applied. Total rules applied 278 place count 65 transition count 835
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 65 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 280 place count 64 transition count 897
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 286 place count 64 transition count 897
Applied a total of 286 rules in 459 ms. Remains 64 /90 variables (removed 26) and now considering 897/1072 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/90 places, 897/1072 transitions.
Finished random walk after 330513 steps, including 0 resets, run visited all 1 properties in 2970 ms. (steps per millisecond=111 )
FORMULA EnergyBus-PT-none-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 85 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 121 transition count 1843
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 116 transition count 1843
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 27 place count 108 transition count 1231
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 108 transition count 1231
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 47 place count 102 transition count 1225
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 60 place count 102 transition count 1212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 102 transition count 1211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 1211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 101 transition count 1209
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 99 transition count 1209
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 4 with 8 rules applied. Total rules applied 74 place count 95 transition count 1205
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 95 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 94 transition count 1202
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 5 with 4 rules applied. Total rules applied 82 place count 92 transition count 1200
Applied a total of 82 rules in 455 ms. Remains 92 /131 variables (removed 39) and now considering 1200/1864 (removed 664) transitions.
[2022-05-16 07:24:07] [INFO ] Flow matrix only has 339 transitions (discarded 861 similar events)
// Phase 1: matrix 339 rows 92 cols
[2022-05-16 07:24:07] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 07:24:07] [INFO ] Implicit Places using invariants in 149 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/131 places, 1200/1864 transitions.
Applied a total of 0 rules in 122 ms. Remains 91 /91 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 91/131 places, 1200/1864 transitions.
[2022-05-16 07:24:07] [INFO ] Flatten gal took : 63 ms
[2022-05-16 07:24:07] [INFO ] Flatten gal took : 69 ms
[2022-05-16 07:24:07] [INFO ] Input system was already deterministic with 1200 transitions.
Finished random walk after 4489 steps, including 1 resets, run visited all 1 properties in 44 ms. (steps per millisecond=102 )
FORMULA EnergyBus-PT-none-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 86 edges and 131 vertex of which 12 / 131 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 441 transitions
Reduce isomorphic transitions removed 441 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 4 rules applied. Total rules applied 5 place count 124 transition count 1419
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 120 transition count 1419
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 120 transition count 1414
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 115 transition count 1414
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 27 place count 107 transition count 942
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 107 transition count 942
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 2 with 12 rules applied. Total rules applied 47 place count 101 transition count 936
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 60 place count 101 transition count 923
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 101 transition count 922
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 100 transition count 922
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 100 transition count 920
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 98 transition count 920
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 76 place count 93 transition count 915
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 79 place count 93 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 92 transition count 912
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 5 with 4 rules applied. Total rules applied 84 place count 90 transition count 910
Applied a total of 84 rules in 277 ms. Remains 90 /131 variables (removed 41) and now considering 910/1864 (removed 954) transitions.
[2022-05-16 07:24:08] [INFO ] Flow matrix only has 278 transitions (discarded 632 similar events)
// Phase 1: matrix 278 rows 90 cols
[2022-05-16 07:24:08] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-16 07:24:08] [INFO ] Implicit Places using invariants in 129 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/131 places, 910/1864 transitions.
Applied a total of 0 rules in 93 ms. Remains 89 /89 variables (removed 0) and now considering 910/910 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 89/131 places, 910/1864 transitions.
[2022-05-16 07:24:08] [INFO ] Flatten gal took : 47 ms
[2022-05-16 07:24:08] [INFO ] Flatten gal took : 51 ms
[2022-05-16 07:24:08] [INFO ] Input system was already deterministic with 910 transitions.
[2022-05-16 07:24:08] [INFO ] Flatten gal took : 50 ms
[2022-05-16 07:24:08] [INFO ] Flatten gal took : 49 ms
[2022-05-16 07:24:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2867796710178221754.gal : 7 ms
[2022-05-16 07:24:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16282972221427126811.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2867796710178221754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16282972221427126811.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6166e+09,2.95076,84160,2,7519,5,139283,6,0,1260,125629,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((((p16==1)&&(p19==1))&&((p41==1)&&(p58==1)))&&(((p87==1)&&(p108==1))&&((p113==1)&&(p130==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((((p16==1)&&(p19==1))&&((p41==1)&&(p58==1)))&&(((p87==1)&&(p108==1))&&((p113==1)&&...181
Reverse transition relation is NOT exact ! Due to transitions t24, t25, t34, t35, t38, t50, t58, t64, t65, t67, t68, t74, t76, t81, t83, t84, t85, t87, t88...293
(forward)formula 0,1,10.812,275304,1,0,1295,819323,1837,770,21565,661086,1826
FORMULA EnergyBus-PT-none-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1126
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1126
Applied a total of 16 rules in 9 ms. Remains 123 /131 variables (removed 8) and now considering 1126/1864 (removed 738) transitions.
[2022-05-16 07:24:19] [INFO ] Flow matrix only has 420 transitions (discarded 706 similar events)
// Phase 1: matrix 420 rows 123 cols
[2022-05-16 07:24:19] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-16 07:24:19] [INFO ] Implicit Places using invariants in 223 ms returned []
[2022-05-16 07:24:19] [INFO ] Flow matrix only has 420 transitions (discarded 706 similar events)
// Phase 1: matrix 420 rows 123 cols
[2022-05-16 07:24:19] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 07:24:19] [INFO ] State equation strengthened by 277 read => feed constraints.
[2022-05-16 07:24:20] [INFO ] Implicit Places using invariants and state equation in 571 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 802 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 1126/1864 transitions.
Applied a total of 0 rules in 10 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/1864 transitions.
[2022-05-16 07:24:20] [INFO ] Flatten gal took : 91 ms
[2022-05-16 07:24:20] [INFO ] Flatten gal took : 96 ms
[2022-05-16 07:24:20] [INFO ] Input system was already deterministic with 1126 transitions.
[2022-05-16 07:24:20] [INFO ] Flatten gal took : 94 ms
[2022-05-16 07:24:21] [INFO ] Flatten gal took : 94 ms
[2022-05-16 07:24:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4989569437801475248.gal : 8 ms
[2022-05-16 07:24:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9260420108014997033.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4989569437801475248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9260420108014997033.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38319e+11,21.9957,516368,2,27994,5,859371,6,0,1606,780268,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:24:51] [INFO ] Flatten gal took : 95 ms
[2022-05-16 07:24:51] [INFO ] Applying decomposition
[2022-05-16 07:24:51] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8433019269723153038.txt' '-o' '/tmp/graph8433019269723153038.bin' '-w' '/tmp/graph8433019269723153038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8433019269723153038.bin' '-l' '-1' '-v' '-w' '/tmp/graph8433019269723153038.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:24:51] [INFO ] Decomposing Gal with order
[2022-05-16 07:24:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:24:51] [INFO ] Removed a total of 4907 redundant transitions.
[2022-05-16 07:24:51] [INFO ] Flatten gal took : 123 ms
[2022-05-16 07:24:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 19 ms.
[2022-05-16 07:24:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6142549708509602279.gal : 4 ms
[2022-05-16 07:24:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16235621376582164234.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6142549708509602279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16235621376582164234.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38319e+11,6.45379,187564,3318,358,179123,4255,1434,1.50276e+06,154,35051,0


Converting to forward existential form...Done !
original formula: AG(EX((i13.i1.u23.p106==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((i13.i1.u23.p106==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t52, t71, t72, t74, t77, t113, t119, t1080, t1089, t1097, t1098, t1101, t1106, t1110, t1...539
(forward)formula 0,1,13.2254,290372,1,0,264070,7683,8847,2.35933e+06,650,51694,923002
FORMULA EnergyBus-PT-none-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 73 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 121 transition count 1844
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 117 transition count 1844
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 23 place count 111 transition count 1456
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 111 transition count 1456
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 41 place count 105 transition count 1450
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 53 place count 105 transition count 1438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 105 transition count 1437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 104 transition count 1437
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 104 transition count 1435
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 102 transition count 1435
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 67 place count 98 transition count 1431
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 98 transition count 1428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 97 transition count 1428
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 5 with 4 rules applied. Total rules applied 75 place count 95 transition count 1426
Applied a total of 75 rules in 642 ms. Remains 95 /131 variables (removed 36) and now considering 1426/1864 (removed 438) transitions.
[2022-05-16 07:25:05] [INFO ] Flow matrix only has 389 transitions (discarded 1037 similar events)
// Phase 1: matrix 389 rows 95 cols
[2022-05-16 07:25:05] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-16 07:25:05] [INFO ] Implicit Places using invariants in 101 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 94/131 places, 1426/1864 transitions.
Applied a total of 0 rules in 172 ms. Remains 94 /94 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 94/131 places, 1426/1864 transitions.
[2022-05-16 07:25:06] [INFO ] Flatten gal took : 75 ms
[2022-05-16 07:25:06] [INFO ] Flatten gal took : 82 ms
[2022-05-16 07:25:06] [INFO ] Input system was already deterministic with 1426 transitions.
[2022-05-16 07:25:06] [INFO ] Flatten gal took : 84 ms
[2022-05-16 07:25:06] [INFO ] Flatten gal took : 85 ms
[2022-05-16 07:25:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17452817324156395016.gal : 10 ms
[2022-05-16 07:25:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14361439136470733467.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17452817324156395016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14361439136470733467.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07559e+09,3.49963,96080,2,8837,5,147452,6,0,1795,128756,0


Converting to forward existential form...Done !
original formula: E(AG(!(((((p16==1)&&(p19==1))&&((p60==1)&&(p77==1)))&&(((p97==1)&&(p103==1))&&((p114==1)&&(p146==1)))))) U (((((!(((((p16==1)&&(p19==1))&...422
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!(((((p16==1)&&(p19==1))&&((p60==1)&&(p77==1)))&&(((p97==1)&&(p103==1))&&((p114==1)&&(p...480
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t26, t27, t37, t53, t66, t72, t75, t76, t82, t83, t85, t90, t92, t93, t94, t96, t97, ...289
Detected timeout of ITS tools.
[2022-05-16 07:25:36] [INFO ] Flatten gal took : 86 ms
[2022-05-16 07:25:36] [INFO ] Applying decomposition
[2022-05-16 07:25:36] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph963783062929291301.txt' '-o' '/tmp/graph963783062929291301.bin' '-w' '/tmp/graph963783062929291301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph963783062929291301.bin' '-l' '-1' '-v' '-w' '/tmp/graph963783062929291301.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:25:36] [INFO ] Decomposing Gal with order
[2022-05-16 07:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:25:37] [INFO ] Removed a total of 7564 redundant transitions.
[2022-05-16 07:25:37] [INFO ] Flatten gal took : 183 ms
[2022-05-16 07:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 24 ms.
[2022-05-16 07:25:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15243116953033945550.gal : 3 ms
[2022-05-16 07:25:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9512144631789784449.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15243116953033945550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9512144631789784449.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07559e+09,0.404212,20276,803,141,24814,2922,865,69043,128,17828,0


Converting to forward existential form...Done !
original formula: E(AG(!(((((i2.u2.p16==1)&&(i3.u3.p19==1))&&((i3.u12.p60==1)&&(i3.u15.p77==1)))&&(((i3.u18.p97==1)&&(i3.u15.p103==1))&&((i2.u2.p114==1)&&(...632
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!(((((i2.u2.p16==1)&&(i3.u3.p19==1))&&((i3.u12.p60==1)&&(i3.u15.p77==1)))&&(((i3.u18.p9...690
Reverse transition relation is NOT exact ! Due to transitions t4, t66, t72, t75, t76, t82, t85, t973, i1.t97, i1.t96, i1.t94, i1.t93, i1.t92, i1.t90, i2.u2...358
(forward)formula 0,0,1.71265,52336,1,0,62667,5837,5987,287094,535,19706,173694
FORMULA EnergyBus-PT-none-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 75 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 121 transition count 1843
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 116 transition count 1843
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 27 place count 108 transition count 1215
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 108 transition count 1215
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 47 place count 102 transition count 1209
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 102 transition count 1197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 102 transition count 1196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 101 transition count 1196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 61 place count 101 transition count 1194
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 99 transition count 1194
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 73 place count 95 transition count 1190
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 95 transition count 1187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 94 transition count 1187
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 5 with 4 rules applied. Total rules applied 81 place count 92 transition count 1185
Applied a total of 81 rules in 450 ms. Remains 92 /131 variables (removed 39) and now considering 1185/1864 (removed 679) transitions.
[2022-05-16 07:25:39] [INFO ] Flow matrix only has 336 transitions (discarded 849 similar events)
// Phase 1: matrix 336 rows 92 cols
[2022-05-16 07:25:39] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-16 07:25:39] [INFO ] Implicit Places using invariants in 105 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/131 places, 1185/1864 transitions.
Applied a total of 0 rules in 120 ms. Remains 91 /91 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 91/131 places, 1185/1864 transitions.
[2022-05-16 07:25:39] [INFO ] Flatten gal took : 66 ms
[2022-05-16 07:25:39] [INFO ] Flatten gal took : 72 ms
[2022-05-16 07:25:39] [INFO ] Input system was already deterministic with 1185 transitions.
[2022-05-16 07:25:40] [INFO ] Flatten gal took : 71 ms
[2022-05-16 07:25:40] [INFO ] Flatten gal took : 71 ms
[2022-05-16 07:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14929302384418860725.gal : 8 ms
[2022-05-16 07:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2860315560965929026.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14929302384418860725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2860315560965929026.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84725e+09,3.02941,81816,2,8113,5,132226,6,0,1542,116324,0


Converting to forward existential form...Done !
original formula: (EG(((((p16==1)&&(p19==1))&&((p60==1)&&(p77==1)))&&(((p87==1)&&(p110==1))&&((p113==1)&&(p146==1))))) + EF(((((p16==1)&&(p19==1))&&((p41==...221
=> equivalent forward existential formula: ([FwdG(Init,((((p16==1)&&(p19==1))&&((p60==1)&&(p77==1)))&&(((p87==1)&&(p110==1))&&((p113==1)&&(p146==1)))))] !=...291
(forward)formula 0,1,8.41589,194720,1,0,10,539535,19,3,21917,237636,7
FORMULA EnergyBus-PT-none-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 75 edges and 131 vertex of which 12 / 131 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 441 transitions
Reduce isomorphic transitions removed 441 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 4 rules applied. Total rules applied 5 place count 124 transition count 1419
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 120 transition count 1419
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 120 transition count 1415
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 116 transition count 1415
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 25 place count 108 transition count 907
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 108 transition count 907
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 45 place count 102 transition count 901
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 58 place count 102 transition count 888
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 102 transition count 887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 101 transition count 887
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 60 place count 101 transition count 885
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 99 transition count 885
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 74 place count 94 transition count 880
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 94 transition count 877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 93 transition count 877
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 5 with 4 rules applied. Total rules applied 82 place count 91 transition count 875
Applied a total of 82 rules in 265 ms. Remains 91 /131 variables (removed 40) and now considering 875/1864 (removed 989) transitions.
[2022-05-16 07:25:48] [INFO ] Flow matrix only has 267 transitions (discarded 608 similar events)
// Phase 1: matrix 267 rows 91 cols
[2022-05-16 07:25:48] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:48] [INFO ] Implicit Places using invariants in 75 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/131 places, 875/1864 transitions.
Applied a total of 0 rules in 71 ms. Remains 90 /90 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/131 places, 875/1864 transitions.
[2022-05-16 07:25:49] [INFO ] Flatten gal took : 46 ms
[2022-05-16 07:25:49] [INFO ] Flatten gal took : 50 ms
[2022-05-16 07:25:49] [INFO ] Input system was already deterministic with 875 transitions.
[2022-05-16 07:25:49] [INFO ] Flatten gal took : 49 ms
[2022-05-16 07:25:49] [INFO ] Flatten gal took : 49 ms
[2022-05-16 07:25:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15811312118821381746.gal : 7 ms
[2022-05-16 07:25:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14647773851553312221.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15811312118821381746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14647773851553312221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65623e+09,3.42085,88948,2,7724,5,141338,6,0,1229,128350,0


Converting to forward existential form...Done !
original formula: AG(EF((((((p16==0)||(p19==0))||((p41==0)||(p58==0)))||(((p97==0)||(p108==0))||((p113==0)||(p139==0)))) + (!(A(((((p16==1)&&(p19==1))&&((p...354
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((p16==0)||(p19==0))||((p41==0)||(p58==0)))||(((p97==0)||(p108==0))||((p113==0...495
Reverse transition relation is NOT exact ! Due to transitions t24, t25, t36, t37, t39, t51, t59, t65, t66, t68, t69, t75, t77, t82, t84, t85, t86, t88, t89...293
(forward)formula 0,1,19.3751,440544,1,0,1260,1.00211e+06,1769,731,21497,726789,1753
FORMULA EnergyBus-PT-none-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 124 transition count 1238
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 124 transition count 1238
Applied a total of 14 rules in 16 ms. Remains 124 /131 variables (removed 7) and now considering 1238/1864 (removed 626) transitions.
[2022-05-16 07:26:08] [INFO ] Flow matrix only has 448 transitions (discarded 790 similar events)
// Phase 1: matrix 448 rows 124 cols
[2022-05-16 07:26:08] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-16 07:26:09] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-16 07:26:09] [INFO ] Flow matrix only has 448 transitions (discarded 790 similar events)
// Phase 1: matrix 448 rows 124 cols
[2022-05-16 07:26:09] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 07:26:09] [INFO ] State equation strengthened by 305 read => feed constraints.
[2022-05-16 07:26:09] [INFO ] Implicit Places using invariants and state equation in 469 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 622 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/131 places, 1238/1864 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/131 places, 1238/1864 transitions.
[2022-05-16 07:26:09] [INFO ] Flatten gal took : 96 ms
[2022-05-16 07:26:09] [INFO ] Flatten gal took : 105 ms
[2022-05-16 07:26:09] [INFO ] Input system was already deterministic with 1238 transitions.
[2022-05-16 07:26:10] [INFO ] Flatten gal took : 106 ms
[2022-05-16 07:26:10] [INFO ] Flatten gal took : 103 ms
[2022-05-16 07:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1637708349683557868.gal : 9 ms
[2022-05-16 07:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5970380436247070094.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1637708349683557868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5970380436247070094.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41575e+11,27.6483,587020,2,28634,5,1.01907e+06,6,0,1722,932112,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:26:40] [INFO ] Flatten gal took : 106 ms
[2022-05-16 07:26:40] [INFO ] Applying decomposition
[2022-05-16 07:26:40] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10396438984307862676.txt' '-o' '/tmp/graph10396438984307862676.bin' '-w' '/tmp/graph10396438984307862676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10396438984307862676.bin' '-l' '-1' '-v' '-w' '/tmp/graph10396438984307862676.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:26:40] [INFO ] Decomposing Gal with order
[2022-05-16 07:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:26:40] [INFO ] Removed a total of 6173 redundant transitions.
[2022-05-16 07:26:40] [INFO ] Flatten gal took : 137 ms
[2022-05-16 07:26:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 19 ms.
[2022-05-16 07:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2031201910312833127.gal : 3 ms
[2022-05-16 07:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11085791720916478305.ctl : 192 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2031201910312833127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11085791720916478305.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41575e+11,1.08528,36240,1366,222,55131,1880,943,121876,141,11935,0


Converting to forward existential form...Done !
original formula: EF(AG(((AX(((((i3.u6.p16==1)&&(i3.u7.p19==1))&&((i6.u13.p41==1)&&(i6.u13.p58==1)))&&(((i3.u7.p90==1)&&(i2.u5.p110==1))&&((i3.u6.p114==1)&...349
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EX(!(((((i3.u6.p16==1)&&(i3.u7.p19==1))&&((i6.u13.p41==1)&&(i6.u13.p58==1))...419
Reverse transition relation is NOT exact ! Due to transitions t12, t21, t52, t71, t72, t74, t77, t110, t119, t1209, t1210, t1213, t1218, t1222, t1223, u14....548
(forward)formula 0,0,2.60084,73312,1,0,117952,5858,6172,256588,641,21725,387445
FORMULA EnergyBus-PT-none-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1188
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1188
Applied a total of 16 rules in 9 ms. Remains 123 /131 variables (removed 8) and now considering 1188/1864 (removed 676) transitions.
[2022-05-16 07:26:43] [INFO ] Flow matrix only has 434 transitions (discarded 754 similar events)
// Phase 1: matrix 434 rows 123 cols
[2022-05-16 07:26:43] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 07:26:43] [INFO ] Implicit Places using invariants in 121 ms returned []
[2022-05-16 07:26:43] [INFO ] Flow matrix only has 434 transitions (discarded 754 similar events)
// Phase 1: matrix 434 rows 123 cols
[2022-05-16 07:26:43] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 07:26:44] [INFO ] State equation strengthened by 293 read => feed constraints.
[2022-05-16 07:26:44] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 695 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 1188/1864 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/131 places, 1188/1864 transitions.
[2022-05-16 07:26:44] [INFO ] Flatten gal took : 98 ms
[2022-05-16 07:26:44] [INFO ] Flatten gal took : 101 ms
[2022-05-16 07:26:44] [INFO ] Input system was already deterministic with 1188 transitions.
[2022-05-16 07:26:45] [INFO ] Flatten gal took : 103 ms
[2022-05-16 07:26:45] [INFO ] Flatten gal took : 104 ms
[2022-05-16 07:26:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3947579326011305424.gal : 10 ms
[2022-05-16 07:26:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13528828018205115189.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3947579326011305424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13528828018205115189.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34239e+11,22.6545,534108,2,27805,5,850734,6,0,1668,770645,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:27:15] [INFO ] Flatten gal took : 96 ms
[2022-05-16 07:27:15] [INFO ] Applying decomposition
[2022-05-16 07:27:15] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8946880989502994101.txt' '-o' '/tmp/graph8946880989502994101.bin' '-w' '/tmp/graph8946880989502994101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8946880989502994101.bin' '-l' '-1' '-v' '-w' '/tmp/graph8946880989502994101.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:27:15] [INFO ] Decomposing Gal with order
[2022-05-16 07:27:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:27:15] [INFO ] Removed a total of 5818 redundant transitions.
[2022-05-16 07:27:15] [INFO ] Flatten gal took : 142 ms
[2022-05-16 07:27:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 17 ms.
[2022-05-16 07:27:15] [INFO ] Time to serialize gal into /tmp/CTLFireability18388314442348401064.gal : 4 ms
[2022-05-16 07:27:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9502702309596017143.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18388314442348401064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9502702309596017143.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34239e+11,2.24923,58260,1809,234,84303,2981,1033,211437,165,20825,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(EF(((((i2.u5.p16==1)&&(i3.u6.p19==1))&&((i10.u9.p60==1)&&(i10.u9.p77==1)))&&(((i10.u17.p82==1)&&(i2.u5.p105==1))&&((i2.u5.p113==...183
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(E(TRUE U ((((i2.u5.p16==1)&&(i3.u6.p19==1))&&((i10.u9.p60==1)&&(i10.u9.p77==1)))&&(((i10....238
Reverse transition relation is NOT exact ! Due to transitions t19, t69, t70, t72, t75, t108, t117, t1142, t1159, t1160, t1163, t1168, t1172, t1173, u11.t48...524
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 77 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 121 transition count 1843
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 116 transition count 1843
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 25 place count 110 transition count 1471
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 110 transition count 1471
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 43 place count 104 transition count 1465
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 56 place count 104 transition count 1452
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 104 transition count 1451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 103 transition count 1451
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 58 place count 103 transition count 1449
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 101 transition count 1449
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 72 place count 96 transition count 1444
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 75 place count 96 transition count 1441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 95 transition count 1441
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 5 with 4 rules applied. Total rules applied 80 place count 93 transition count 1439
Applied a total of 80 rules in 712 ms. Remains 93 /131 variables (removed 38) and now considering 1439/1864 (removed 425) transitions.
[2022-05-16 07:27:46] [INFO ] Flow matrix only has 329 transitions (discarded 1110 similar events)
// Phase 1: matrix 329 rows 93 cols
[2022-05-16 07:27:46] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:27:46] [INFO ] Implicit Places using invariants in 163 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 175 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 92/131 places, 1439/1864 transitions.
Applied a total of 0 rules in 178 ms. Remains 92 /92 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 92/131 places, 1439/1864 transitions.
[2022-05-16 07:27:47] [INFO ] Flatten gal took : 78 ms
[2022-05-16 07:27:47] [INFO ] Flatten gal took : 86 ms
[2022-05-16 07:27:47] [INFO ] Input system was already deterministic with 1439 transitions.
[2022-05-16 07:27:47] [INFO ] Flatten gal took : 87 ms
[2022-05-16 07:27:47] [INFO ] Flatten gal took : 86 ms
[2022-05-16 07:27:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1253171857925946220.gal : 11 ms
[2022-05-16 07:27:47] [INFO ] Time to serialize properties into /tmp/CTLFireability11868412102490784499.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1253171857925946220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11868412102490784499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7998e+09,4.53867,123716,2,8720,5,165459,6,0,1800,149836,0


Converting to forward existential form...Done !
original formula: AG(A((AF(!(((((p16==1)&&(p19==1))&&((p41==1)&&(p58==1)))&&(((p81==1)&&(p103==1))&&((p114==1)&&(p130==1)))))) + AF(((((p16==1)&&(p19==1))&...333
=> equivalent forward existential formula: ([FwdG(((FwdU(FwdU(Init,TRUE),!(!(((((p16==1)&&(p19==1))&&((p41==1)&&(p58==1)))&&(((p88==1)&&(p110==1))&&((p114=...642
Hit Full ! (commute/partial/dont) 82/5617/1357
(forward)formula 0,0,11.6731,252080,1,0,8,606989,19,1,29124,265788,9
FORMULA EnergyBus-PT-none-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2022-05-16 07:27:59] [INFO ] Flatten gal took : 159 ms
[2022-05-16 07:27:59] [INFO ] Flatten gal took : 160 ms
[2022-05-16 07:27:59] [INFO ] Applying decomposition
[2022-05-16 07:28:00] [INFO ] Flatten gal took : 160 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph713737914863626738.txt' '-o' '/tmp/graph713737914863626738.bin' '-w' '/tmp/graph713737914863626738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph713737914863626738.bin' '-l' '-1' '-v' '-w' '/tmp/graph713737914863626738.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:28:00] [INFO ] Decomposing Gal with order
[2022-05-16 07:28:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:28:00] [INFO ] Removed a total of 8651 redundant transitions.
[2022-05-16 07:28:00] [INFO ] Flatten gal took : 223 ms
[2022-05-16 07:28:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 25 ms.
[2022-05-16 07:28:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4654122325294661639.gal : 5 ms
[2022-05-16 07:28:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6215785052301369885.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4654122325294661639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6215785052301369885.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12221e+11,1.06232,44532,2708,191,74768,2139,964,174692,149,20919,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(EF(((((i1.u5.p16==1)&&(i13.u24.p19==1))&&((i1.u13.p60==1)&&(i1.u13.p77==1)))&&(((i9.u21.p82==1)&&(i1.u6.p105==1))&&((i1.u5.p113=...184
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(E(TRUE U ((((i1.u5.p16==1)&&(i13.u24.p19==1))&&((i1.u13.p60==1)&&(i1.u13.p77==1)))&&(((i9...239
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t14, t23, t54, t99, t111, t121, t208, t209, t284, t285, t318, t319, t528, t529, t604...804
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,201.564,2221944,1,0,4.73654e+06,6267,2547,7.58729e+06,339,41822,4033712
FORMULA EnergyBus-PT-none-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Total runtime 750995 ms.

BK_STOP 1652686283168

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -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="CTLFireability"
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 CTLFireability"
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-165260110300450"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;