About the Execution of ITS-Tools for EnergyBus-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2847.147 | 637339.00 | 691564.00 | 8993.70 | TTTTFFTTFTTFTFTT | normal |
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-165260110300449.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110300449
=====================================================================
--------------------
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-CTLCardinality-00
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-01
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-02
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-03
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-04
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-05
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-06
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-07
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-08
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-09
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-10
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-11
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-12
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-13
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-14
FORMULA_NAME EnergyBus-PT-none-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652685230089
Running Version 202205111006
[2022-05-16 07:13:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:13:52] [INFO ] Load time of PNML (sax parser for PT used): 524 ms
[2022-05-16 07:13:52] [INFO ] Transformed 157 places.
[2022-05-16 07:13:52] [INFO ] Transformed 4430 transitions.
[2022-05-16 07:13:52] [INFO ] Found NUPN structural information;
[2022-05-16 07:13:52] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 706 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 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.
Support contains 95 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 1684
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 1684
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 148 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 147 transition count 1675
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 147 transition count 1675
Applied a total of 20 rules in 79 ms. Remains 147 /153 variables (removed 6) and now considering 1675/1913 (removed 238) transitions.
[2022-05-16 07:13:52] [INFO ] Flow matrix only has 585 transitions (discarded 1090 similar events)
// Phase 1: matrix 585 rows 147 cols
[2022-05-16 07:13:52] [INFO ] Computed 23 place invariants in 24 ms
[2022-05-16 07:13:52] [INFO ] Implicit Places using invariants in 315 ms returned []
[2022-05-16 07:13:52] [INFO ] Flow matrix only has 585 transitions (discarded 1090 similar events)
// Phase 1: matrix 585 rows 147 cols
[2022-05-16 07:13:52] [INFO ] Computed 23 place invariants in 18 ms
[2022-05-16 07:13:53] [INFO ] State equation strengthened by 407 read => feed constraints.
[2022-05-16 07:13:53] [INFO ] Implicit Places using invariants and state equation in 580 ms returned [24, 114]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 934 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/153 places, 1675/1913 transitions.
Applied a total of 0 rules in 17 ms. Remains 145 /145 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/153 places, 1675/1913 transitions.
Support contains 95 out of 145 places after structural reductions.
[2022-05-16 07:13:54] [INFO ] Flatten gal took : 324 ms
[2022-05-16 07:13:54] [INFO ] Flatten gal took : 193 ms
[2022-05-16 07:13:54] [INFO ] Input system was already deterministic with 1675 transitions.
Support contains 92 out of 145 places (down from 95) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 81) seen :40
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) seen :0
Running SMT prover for 40 properties.
[2022-05-16 07:13:55] [INFO ] Flow matrix only has 585 transitions (discarded 1090 similar events)
// Phase 1: matrix 585 rows 145 cols
[2022-05-16 07:13:55] [INFO ] Computed 21 place invariants in 12 ms
[2022-05-16 07:13:56] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:40
[2022-05-16 07:13:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2022-05-16 07:13:56] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 07:13:57] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :26 sat :14
[2022-05-16 07:13:57] [INFO ] State equation strengthened by 407 read => feed constraints.
[2022-05-16 07:13:57] [INFO ] After 485ms SMT Verify possible using 407 Read/Feed constraints in natural domain returned unsat :26 sat :14
[2022-05-16 07:13:57] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
[2022-05-16 07:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-16 07:13:57] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2022-05-16 07:13:58] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2022-05-16 07:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2022-05-16 07:13:58] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2022-05-16 07:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2022-05-16 07:13:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2022-05-16 07:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-05-16 07:13:58] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-16 07:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-16 07:13:59] [INFO ] After 2012ms SMT Verify possible using trap constraints in natural domain returned unsat :26 sat :14
Attempting to minimize the solution found.
Minimization took 451 ms.
[2022-05-16 07:13:59] [INFO ] After 3459ms SMT Verify possible using all constraints in natural domain returned unsat :26 sat :14
Fused 40 Parikh solutions to 12 different solutions.
Parikh walk visited 2 properties in 1031 ms.
Support contains 16 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Graph (trivial) has 115 edges and 145 vertex of which 17 / 145 are part of one of the 6 SCC in 6 ms
Free SCC test removed 11 places
Drop transitions removed 28 transitions
Ensure Unique test removed 898 transitions
Reduce isomorphic transitions removed 926 transitions.
Graph (complete) has 689 edges and 134 vertex of which 130 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.16 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 130 transition count 740
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 126 transition count 737
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 15 place count 126 transition count 729
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 118 transition count 729
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 43 place count 106 transition count 645
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 106 transition count 645
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 85 place count 106 transition count 615
Performed 9 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 103 place count 97 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 97 transition count 580
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
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 115 place count 92 transition count 584
Drop transitions removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 121 place count 92 transition count 578
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 136 place count 92 transition count 563
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 7 rules applied. Total rules applied 143 place count 90 transition count 558
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 148 place count 85 transition count 558
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 148 place count 85 transition count 556
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 154 place count 81 transition count 556
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 21 edges and 81 vertex of which 2 / 81 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 156 place count 80 transition count 555
Drop transitions removed 2 transitions
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 233 transitions.
Iterating post reduction 8 with 233 rules applied. Total rules applied 389 place count 80 transition count 322
Ensure Unique test removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 390 place count 79 transition count 322
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 10 with 8 rules applied. Total rules applied 398 place count 75 transition count 318
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 406 place count 75 transition count 310
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 415 place count 67 transition count 309
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 416 place count 67 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 417 place count 67 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 418 place count 66 transition count 318
Applied a total of 418 rules in 274 ms. Remains 66 /145 variables (removed 79) and now considering 318/1675 (removed 1357) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/145 places, 318/1675 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-16 07:14:01] [INFO ] Flow matrix only has 179 transitions (discarded 139 similar events)
// Phase 1: matrix 179 rows 66 cols
[2022-05-16 07:14:01] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 07:14:01] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-16 07:14:01] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 07:14:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-16 07:14:01] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 07:14:01] [INFO ] State equation strengthened by 135 read => feed constraints.
[2022-05-16 07:14:01] [INFO ] After 36ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-16 07:14:01] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-16 07:14:01] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 318/318 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 66 transition count 317
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 317
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 62 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 62 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 61 transition count 266
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 61 transition count 260
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 37 place count 61 transition count 239
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 61 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 59 transition count 237
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 59 transition count 231
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 59 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 58 transition count 252
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 58 transition count 252
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 58 transition count 251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 57 transition count 250
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 57 transition count 247
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 62 place count 57 transition count 241
Applied a total of 62 rules in 101 ms. Remains 57 /66 variables (removed 9) and now considering 241/318 (removed 77) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/66 places, 241/318 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Finished probabilistic random walk after 29495 steps, run visited all 3 properties in 142 ms. (steps per millisecond=207 )
Probabilistic random walk after 29495 steps, saw 7649 distinct states, run finished after 142 ms. (steps per millisecond=207 ) properties seen :3
Successfully simplified 26 atomic propositions for a total of 16 simplifications.
FORMULA EnergyBus-PT-none-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 07:14:02] [INFO ] Flatten gal took : 140 ms
[2022-05-16 07:14:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA EnergyBus-PT-none-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 07:14:02] [INFO ] Flatten gal took : 154 ms
[2022-05-16 07:14:02] [INFO ] Input system was already deterministic with 1675 transitions.
Support contains 47 out of 145 places (down from 66) after GAL structural reductions.
Computed a total of 4 stabilizing places and 130 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Graph (trivial) has 130 edges and 145 vertex of which 14 / 145 are part of one of the 5 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 915 transitions
Reduce isomorphic transitions removed 915 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 133 transition count 758
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 133 transition count 751
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 126 transition count 751
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 38 place count 106 transition count 532
Iterating global reduction 2 with 20 rules applied. Total rules applied 58 place count 106 transition count 532
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 88 place count 106 transition count 502
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 106 transition count 501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 105 transition count 501
Performed 8 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 109 place count 94 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 80 edges and 94 vertex of which 6 / 94 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 90 transition count 466
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 124 place count 89 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 132 place count 84 transition count 453
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 70 edges and 84 vertex of which 2 / 84 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 33 rules applied. Total rules applied 165 place count 83 transition count 421
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 170 place count 81 transition count 418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 173 place count 79 transition count 417
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 175 place count 79 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 177 place count 77 transition count 415
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 181 place count 75 transition count 413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 183 place count 74 transition count 412
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 200 place count 74 transition count 395
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 3 rules applied. Total rules applied 203 place count 74 transition count 392
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 206 place count 71 transition count 392
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 206 place count 71 transition count 387
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 11 rules applied. Total rules applied 217 place count 65 transition count 387
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 218 place count 65 transition count 386
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 220 place count 64 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 220 place count 64 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 223 place count 62 transition count 384
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 229 place count 59 transition count 381
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 230 place count 59 transition count 380
Applied a total of 230 rules in 161 ms. Remains 59 /145 variables (removed 86) and now considering 380/1675 (removed 1295) transitions.
[2022-05-16 07:14:02] [INFO ] Flow matrix only has 203 transitions (discarded 177 similar events)
// Phase 1: matrix 203 rows 59 cols
[2022-05-16 07:14:02] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 07:14:02] [INFO ] Implicit Places using invariants in 123 ms returned [19, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 127 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/145 places, 380/1675 transitions.
Graph (trivial) has 45 edges and 57 vertex of which 5 / 57 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 221
Applied a total of 2 rules in 18 ms. Remains 53 /57 variables (removed 4) and now considering 221/380 (removed 159) transitions.
[2022-05-16 07:14:03] [INFO ] Flow matrix only has 131 transitions (discarded 90 similar events)
// Phase 1: matrix 131 rows 53 cols
[2022-05-16 07:14:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 07:14:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-16 07:14:03] [INFO ] Flow matrix only has 131 transitions (discarded 90 similar events)
// Phase 1: matrix 131 rows 53 cols
[2022-05-16 07:14:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 07:14:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 07:14:03] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/145 places, 221/1675 transitions.
Finished structural reductions, in 2 iterations. Remains : 53/145 places, 221/1675 transitions.
[2022-05-16 07:14:03] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:14:03] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:14:03] [INFO ] Input system was already deterministic with 221 transitions.
[2022-05-16 07:14:03] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:14:03] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:14:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11310921091661405847.gal : 7 ms
[2022-05-16 07:14:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality10764143912005218878.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/CTLCardinality11310921091661405847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10764143912005218878.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.40926e+06,0.120697,9036,2,833,5,14451,5,0,434,10738,0
Converting to forward existential form...Done !
original formula: EF(((p99==1) * EF((p70==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p99==1)),TRUE) * (p70==1))] != FALSE
(forward)formula 0,1,0.153469,9412,1,0,8,14451,9,2,953,10738,4
FORMULA EnergyBus-PT-none-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 122 transition count 1255
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 122 transition count 1255
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 122 transition count 1252
Applied a total of 49 rules in 14 ms. Remains 122 /145 variables (removed 23) and now considering 1252/1675 (removed 423) transitions.
[2022-05-16 07:14:03] [INFO ] Flow matrix only has 450 transitions (discarded 802 similar events)
// Phase 1: matrix 450 rows 122 cols
[2022-05-16 07:14:03] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:14:03] [INFO ] Implicit Places using invariants in 227 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/145 places, 1252/1675 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/145 places, 1252/1675 transitions.
[2022-05-16 07:14:03] [INFO ] Flatten gal took : 94 ms
[2022-05-16 07:14:03] [INFO ] Flatten gal took : 111 ms
[2022-05-16 07:14:04] [INFO ] Input system was already deterministic with 1252 transitions.
[2022-05-16 07:14:04] [INFO ] Flatten gal took : 103 ms
[2022-05-16 07:14:04] [INFO ] Flatten gal took : 105 ms
[2022-05-16 07:14:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality17232203833699790497.gal : 17 ms
[2022-05-16 07:14:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9118419772180850877.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/CTLCardinality17232203833699790497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9118419772180850877.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,20.8362,534268,2,26918,5,846668,6,0,1732,765074,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:14:34] [INFO ] Flatten gal took : 96 ms
[2022-05-16 07:14:34] [INFO ] Applying decomposition
[2022-05-16 07:14:34] [INFO ] Flatten gal took : 92 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/graph5727902783698597595.txt' '-o' '/tmp/graph5727902783698597595.bin' '-w' '/tmp/graph5727902783698597595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5727902783698597595.bin' '-l' '-1' '-v' '-w' '/tmp/graph5727902783698597595.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:14:35] [INFO ] Decomposing Gal with order
[2022-05-16 07:14:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:14:35] [INFO ] Removed a total of 5939 redundant transitions.
[2022-05-16 07:14:36] [INFO ] Flatten gal took : 641 ms
[2022-05-16 07:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 50 ms.
[2022-05-16 07:14:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9963349682543905286.gal : 10 ms
[2022-05-16 07:14:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12700051300656370557.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/CTLCardinality9963349682543905286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12700051300656370557.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,1.84079,80956,1460,161,71023,1386,914,658080,129,13766,0
Converting to forward existential form...Done !
original formula: EF(!(A(EX(EF(((u3.p10==0)||(i12.u23.p94==1)))) U AX(!(AG((i1.u7.p81==1)))))))
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!(!(!(E(TRUE U !((i1.u7.p81==1)))))))))) * !(EX(E(TRUE U ((u3.p10==0)||(i12.u...298
Reverse transition relation is NOT exact ! Due to transitions t19, t70, t72, t75, t95, t108, t117, t1206, t1223, t1224, t1227, t1232, t1236, t1237, u15.t48...539
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
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,4.47996,128920,1,0,131268,3449,6515,969321,621,15716,399402
FORMULA EnergyBus-PT-none-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 122 transition count 1129
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 122 transition count 1129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 122 transition count 1126
Applied a total of 49 rules in 32 ms. Remains 122 /145 variables (removed 23) and now considering 1126/1675 (removed 549) transitions.
[2022-05-16 07:14:40] [INFO ] Flow matrix only has 420 transitions (discarded 706 similar events)
// Phase 1: matrix 420 rows 122 cols
[2022-05-16 07:14:40] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:14:41] [INFO ] Implicit Places using invariants in 277 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/145 places, 1126/1675 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1126/1126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/145 places, 1126/1675 transitions.
[2022-05-16 07:14:41] [INFO ] Flatten gal took : 217 ms
[2022-05-16 07:14:41] [INFO ] Flatten gal took : 103 ms
[2022-05-16 07:14:41] [INFO ] Input system was already deterministic with 1126 transitions.
[2022-05-16 07:14:41] [INFO ] Flatten gal took : 87 ms
[2022-05-16 07:14:41] [INFO ] Flatten gal took : 139 ms
[2022-05-16 07:14:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9499976141232340141.gal : 10 ms
[2022-05-16 07:14:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality550386611271104545.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/CTLCardinality9499976141232340141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality550386611271104545.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.49232e+11,21.2477,534852,2,29721,5,897575,6,0,1606,818755,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:15:12] [INFO ] Flatten gal took : 93 ms
[2022-05-16 07:15:12] [INFO ] Applying decomposition
[2022-05-16 07:15:12] [INFO ] Flatten gal took : 86 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/graph3199377555165851440.txt' '-o' '/tmp/graph3199377555165851440.bin' '-w' '/tmp/graph3199377555165851440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3199377555165851440.bin' '-l' '-1' '-v' '-w' '/tmp/graph3199377555165851440.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:15:12] [INFO ] Decomposing Gal with order
[2022-05-16 07:15:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:15:12] [INFO ] Removed a total of 4976 redundant transitions.
[2022-05-16 07:15:12] [INFO ] Flatten gal took : 151 ms
[2022-05-16 07:15:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 17 ms.
[2022-05-16 07:15:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14917588960843800339.gal : 4 ms
[2022-05-16 07:15:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13596256816000846431.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/CTLCardinality14917588960843800339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13596256816000846431.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.49232e+11,1.79369,72432,1929,273,92541,5106,1065,463893,165,31131,0
Converting to forward existential form...Done !
original formula: EF(EG((AF(AX((i2.u6.p79==1))) * AX(AG(((u13.p50==0)||(i2.u6.p97==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!(!(EX(!((i2.u6.p79==1))))))) * !(EX(!(!(E(TRUE U !(((u13.p50==0)||(i2.u6.p97==1))))...171
Reverse transition relation is NOT exact ! Due to transitions t19, t71, t72, t74, t110, t119, t1080, t1097, t1098, t1099, t1101, t1110, t1111, u12.t50, u12...532
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
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
(forward)formula 0,0,6.78718,234232,1,0,252561,8549,6580,1.91874e+06,774,44617,603649
FORMULA EnergyBus-PT-none-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 121 transition count 1127
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 121 transition count 1127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 121 transition count 1124
Applied a total of 51 rules in 18 ms. Remains 121 /145 variables (removed 24) and now considering 1124/1675 (removed 551) transitions.
[2022-05-16 07:15:19] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 121 cols
[2022-05-16 07:15:19] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:15:20] [INFO ] Implicit Places using invariants in 781 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 789 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/145 places, 1124/1675 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 1124/1124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 120/145 places, 1124/1675 transitions.
[2022-05-16 07:15:20] [INFO ] Flatten gal took : 83 ms
[2022-05-16 07:15:20] [INFO ] Flatten gal took : 115 ms
[2022-05-16 07:15:20] [INFO ] Input system was already deterministic with 1124 transitions.
[2022-05-16 07:15:20] [INFO ] Flatten gal took : 83 ms
[2022-05-16 07:15:20] [INFO ] Flatten gal took : 83 ms
[2022-05-16 07:15:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8451948484033691991.gal : 8 ms
[2022-05-16 07:15:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality2014138601257788961.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/CTLCardinality8451948484033691991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2014138601257788961.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.24568e+11,19.2972,529240,2,27943,5,859964,6,0,1600,784786,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:15:51] [INFO ] Flatten gal took : 127 ms
[2022-05-16 07:15:51] [INFO ] Applying decomposition
[2022-05-16 07:15:51] [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/graph15118085581700424032.txt' '-o' '/tmp/graph15118085581700424032.bin' '-w' '/tmp/graph15118085581700424032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15118085581700424032.bin' '-l' '-1' '-v' '-w' '/tmp/graph15118085581700424032.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:15:51] [INFO ] Decomposing Gal with order
[2022-05-16 07:15:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:15:51] [INFO ] Removed a total of 4798 redundant transitions.
[2022-05-16 07:15:51] [INFO ] Flatten gal took : 157 ms
[2022-05-16 07:15:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 16 ms.
[2022-05-16 07:15:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15212975126025945850.gal : 5 ms
[2022-05-16 07:15:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality754483257744295783.ctl : 1033 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/CTLCardinality15212975126025945850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality754483257744295783.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,2.24568e+11,1.29689,50252,2284,222,90846,1922,862,137776,168,8700,0
Converting to forward existential form...Done !
original formula: AX(EG(EX(AG((i7.u17.p156!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX(!(E(TRUE U !((i7.u17.p156!=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t69, t70, t72, t75, t108, t117, t1078, t1095, t1096, t1097, t1099, t1108, t1109, u29.t5,...595
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 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
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 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,0,3.51353,113672,1,0,222453,6277,5210,324094,1020,24749,743084
FORMULA EnergyBus-PT-none-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 124 transition count 1132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 124 transition count 1132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 124 transition count 1130
Applied a total of 44 rules in 25 ms. Remains 124 /145 variables (removed 21) and now considering 1130/1675 (removed 545) transitions.
[2022-05-16 07:15:56] [INFO ] Flow matrix only has 424 transitions (discarded 706 similar events)
// Phase 1: matrix 424 rows 124 cols
[2022-05-16 07:15:56] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:15:56] [INFO ] Implicit Places using invariants in 245 ms returned []
[2022-05-16 07:15:56] [INFO ] Flow matrix only has 424 transitions (discarded 706 similar events)
// Phase 1: matrix 424 rows 124 cols
[2022-05-16 07:15:56] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:15:56] [INFO ] State equation strengthened by 279 read => feed constraints.
[2022-05-16 07:15:57] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2022-05-16 07:15:57] [INFO ] Flow matrix only has 424 transitions (discarded 706 similar events)
// Phase 1: matrix 424 rows 124 cols
[2022-05-16 07:15:57] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:15:57] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/145 places, 1130/1675 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/145 places, 1130/1675 transitions.
[2022-05-16 07:15:57] [INFO ] Flatten gal took : 82 ms
[2022-05-16 07:15:57] [INFO ] Flatten gal took : 116 ms
[2022-05-16 07:15:58] [INFO ] Input system was already deterministic with 1130 transitions.
[2022-05-16 07:15:58] [INFO ] Flatten gal took : 82 ms
[2022-05-16 07:15:58] [INFO ] Flatten gal took : 80 ms
[2022-05-16 07:15:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality3244274872940204800.gal : 57 ms
[2022-05-16 07:15:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3418645184554962412.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/CTLCardinality3244274872940204800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3418645184554962412.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,3.06823e+11,21.5796,544868,2,38700,5,959702,6,0,1620,948786,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:16:28] [INFO ] Flatten gal took : 87 ms
[2022-05-16 07:16:28] [INFO ] Applying decomposition
[2022-05-16 07:16:28] [INFO ] Flatten gal took : 82 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/graph11747706155279271172.txt' '-o' '/tmp/graph11747706155279271172.bin' '-w' '/tmp/graph11747706155279271172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11747706155279271172.bin' '-l' '-1' '-v' '-w' '/tmp/graph11747706155279271172.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:16:28] [INFO ] Decomposing Gal with order
[2022-05-16 07:16:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:16:28] [INFO ] Removed a total of 4794 redundant transitions.
[2022-05-16 07:16:28] [INFO ] Flatten gal took : 123 ms
[2022-05-16 07:16:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 14 ms.
[2022-05-16 07:16:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7847818498475679070.gal : 3 ms
[2022-05-16 07:16:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2489315935829205891.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/CTLCardinality7847818498475679070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2489315935829205891.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.06823e+11,2.54438,101140,2083,258,116785,2980,882,757237,180,16349,0
Converting to forward existential form...Done !
original formula: AX((EF(EX(((i3.u7.p14==0)||(u14.p56==1)))) * ((AF((((i3.u11.p18==0)||(i3.u11.p18==1))&&(u16.p70==1))) + (u15.p63==0)) + (i3.u5.p103==1)))...156
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EX(((i3.u7.p14==0)||(u14.p56==1))))))] = FALSE * [FwdG(((EY(Init) * !((i3.u5.p103==1)))...239
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
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
Reverse transition relation is NOT exact ! Due to transitions t19, t73, t74, t76, t79, t114, t123, t1084, t1101, t1102, t1103, t1114, t1115, u18.t72, u12.t...537
(forward)formula 0,1,5.76068,182512,1,0,194253,4799,5891,1.49681e+06,969,18150,538388
FORMULA EnergyBus-PT-none-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 126 transition count 1199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 126 transition count 1199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 126 transition count 1198
Applied a total of 39 rules in 14 ms. Remains 126 /145 variables (removed 19) and now considering 1198/1675 (removed 477) transitions.
[2022-05-16 07:16:34] [INFO ] Flow matrix only has 444 transitions (discarded 754 similar events)
// Phase 1: matrix 444 rows 126 cols
[2022-05-16 07:16:34] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:16:34] [INFO ] Implicit Places using invariants in 202 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/145 places, 1198/1675 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 1198/1198 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/145 places, 1198/1675 transitions.
[2022-05-16 07:16:35] [INFO ] Flatten gal took : 87 ms
[2022-05-16 07:16:35] [INFO ] Flatten gal took : 91 ms
[2022-05-16 07:16:35] [INFO ] Input system was already deterministic with 1198 transitions.
[2022-05-16 07:16:35] [INFO ] Flatten gal took : 91 ms
[2022-05-16 07:16:35] [INFO ] Flatten gal took : 89 ms
[2022-05-16 07:16:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality13969267083678381453.gal : 9 ms
[2022-05-16 07:16:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13266811323886013236.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/CTLCardinality13969267083678381453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13266811323886013236.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,3.46276e+11,25.7412,640608,2,32635,5,1.14102e+06,6,0,1694,985713,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:17:05] [INFO ] Flatten gal took : 128 ms
[2022-05-16 07:17:05] [INFO ] Applying decomposition
[2022-05-16 07:17:05] [INFO ] Flatten gal took : 87 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/graph9122247039019487084.txt' '-o' '/tmp/graph9122247039019487084.bin' '-w' '/tmp/graph9122247039019487084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9122247039019487084.bin' '-l' '-1' '-v' '-w' '/tmp/graph9122247039019487084.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:17:06] [INFO ] Decomposing Gal with order
[2022-05-16 07:17:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:17:06] [INFO ] Removed a total of 5697 redundant transitions.
[2022-05-16 07:17:06] [INFO ] Flatten gal took : 151 ms
[2022-05-16 07:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 32 ms.
[2022-05-16 07:17:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality13629124714738803406.gal : 16 ms
[2022-05-16 07:17:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality13796865721946435346.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/CTLCardinality13629124714738803406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13796865721946435346.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,3.46276e+11,1.58486,57272,1893,150,74590,1233,981,321939,152,6142,0
Converting to forward existential form...Done !
original formula: EG(E(((EG(EF(((i2.u6.p86==0)||(u20.p84==1)))) * ((i2.u32.p150==0)||(i12.u33.p153==1))) * (((!(((i0.i0.u2.p6==1)&&((u20.p84==0)||(i4.u7.p2...361
=> equivalent forward existential formula: [FwdG(Init,E(((EG(E(TRUE U ((i2.u6.p86==0)||(u20.p84==1)))) * ((i2.u32.p150==0)||(i12.u33.p153==1))) * (((!(((i0...416
Reverse transition relation is NOT exact ! Due to transitions t21, t78, t80, t83, t105, t118, t127, t1152, t1169, t1170, t1171, t1173, t1182, t1183, u11.t5...568
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
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
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Graph (trivial) has 130 edges and 145 vertex of which 16 / 145 are part of one of the 6 SCC in 3 ms
Free SCC test removed 10 places
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 916 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 132 transition count 757
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 132 transition count 751
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 16 place count 126 transition count 751
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 35 place count 107 transition count 534
Iterating global reduction 2 with 19 rules applied. Total rules applied 54 place count 107 transition count 534
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 84 place count 107 transition count 504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 107 transition count 503
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 106 transition count 503
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 103 place count 96 transition count 484
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 83 edges and 96 vertex of which 6 / 96 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 14 rules applied. Total rules applied 117 place count 92 transition count 471
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 127 place count 92 transition count 461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 127 place count 92 transition count 460
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 91 transition count 460
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 137 place count 86 transition count 457
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 72 edges and 86 vertex of which 2 / 86 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 33 rules applied. Total rules applied 170 place count 85 transition count 425
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 175 place count 83 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 178 place count 81 transition count 421
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 180 place count 81 transition count 419
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 182 place count 79 transition count 419
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 186 place count 77 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 188 place count 76 transition count 416
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 207 place count 76 transition count 397
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 9 with 4 rules applied. Total rules applied 211 place count 76 transition count 393
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 215 place count 72 transition count 393
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 215 place count 72 transition count 388
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 11 with 12 rules applied. Total rules applied 227 place count 65 transition count 388
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 228 place count 65 transition count 387
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 3 rules applied. Total rules applied 231 place count 64 transition count 385
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 233 place count 63 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 233 place count 63 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 236 place count 61 transition count 383
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 14 with 8 rules applied. Total rules applied 244 place count 57 transition count 379
Applied a total of 244 rules in 182 ms. Remains 57 /145 variables (removed 88) and now considering 379/1675 (removed 1296) transitions.
[2022-05-16 07:17:36] [INFO ] Flow matrix only has 202 transitions (discarded 177 similar events)
// Phase 1: matrix 202 rows 57 cols
[2022-05-16 07:17:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:17:36] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-16 07:17:36] [INFO ] Flow matrix only has 202 transitions (discarded 177 similar events)
// Phase 1: matrix 202 rows 57 cols
[2022-05-16 07:17:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:17:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 07:17:36] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-05-16 07:17:37] [INFO ] Redundant transitions in 333 ms returned []
[2022-05-16 07:17:37] [INFO ] Flow matrix only has 202 transitions (discarded 177 similar events)
// Phase 1: matrix 202 rows 57 cols
[2022-05-16 07:17:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:17:37] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/145 places, 379/1675 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/145 places, 379/1675 transitions.
[2022-05-16 07:17:37] [INFO ] Flatten gal took : 29 ms
[2022-05-16 07:17:37] [INFO ] Flatten gal took : 14 ms
[2022-05-16 07:17:37] [INFO ] Input system was already deterministic with 379 transitions.
[2022-05-16 07:17:37] [INFO ] Flatten gal took : 13 ms
[2022-05-16 07:17:37] [INFO ] Flatten gal took : 12 ms
[2022-05-16 07:17:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10843235864139053591.gal : 14 ms
[2022-05-16 07:17:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15366647447175853641.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/CTLCardinality10843235864139053591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15366647447175853641.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,6.4247e+06,0.391183,15164,2,1179,5,23428,5,0,608,19203,0
Converting to forward existential form...Done !
original formula: !(E(EF((p84==1)) U (EG((p40==1)) + (p56==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,E(TRUE U (p84==1))),(p40==1))] = FALSE * [(FwdU(Init,E(TRUE U (p84==1))) * (p56==1))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t37, t44, t45, t48, t69, t70, t71, t73, t74, t214, t269, t324, Intersection with reachable a...225
(forward)formula 0,0,7.19796,213164,1,0,617,666153,781,442,6720,841361,903
FORMULA EnergyBus-PT-none-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Graph (trivial) has 129 edges and 145 vertex of which 17 / 145 are part of one of the 6 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 919 transitions
Reduce isomorphic transitions removed 919 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 133 transition count 755
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3 place count 133 transition count 750
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 13 place count 128 transition count 750
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 31 place count 110 transition count 535
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 110 transition count 535
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 79 place count 110 transition count 505
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 79 place count 110 transition count 504
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 109 transition count 504
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 93 place count 103 transition count 486
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 105 place count 103 transition count 474
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 4 with 45 rules applied. Total rules applied 150 place count 103 transition count 429
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 2 rules applied. Total rules applied 152 place count 103 transition count 427
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 154 place count 101 transition count 427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 154 place count 101 transition count 426
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 156 place count 100 transition count 426
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 6 with 18 rules applied. Total rules applied 174 place count 91 transition count 417
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 91 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 177 place count 90 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 179 place count 89 transition count 414
Applied a total of 179 rules in 108 ms. Remains 89 /145 variables (removed 56) and now considering 414/1675 (removed 1261) transitions.
[2022-05-16 07:17:45] [INFO ] Flow matrix only has 230 transitions (discarded 184 similar events)
// Phase 1: matrix 230 rows 89 cols
[2022-05-16 07:17:45] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 07:17:45] [INFO ] Implicit Places using invariants in 344 ms returned [4, 5, 6, 72]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 346 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 85/145 places, 414/1675 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 84 transition count 412
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 83 transition count 412
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 2 with 10 rules applied. Total rules applied 14 place count 78 transition count 407
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 78 transition count 405
Applied a total of 16 rules in 68 ms. Remains 78 /85 variables (removed 7) and now considering 405/414 (removed 9) transitions.
[2022-05-16 07:17:45] [INFO ] Flow matrix only has 221 transitions (discarded 184 similar events)
// Phase 1: matrix 221 rows 78 cols
[2022-05-16 07:17:45] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 07:17:45] [INFO ] Implicit Places using invariants in 306 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 308 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 77/145 places, 405/1675 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 403
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 75 transition count 403
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 72 transition count 400
Applied a total of 10 rules in 19 ms. Remains 72 /77 variables (removed 5) and now considering 400/405 (removed 5) transitions.
[2022-05-16 07:17:45] [INFO ] Flow matrix only has 216 transitions (discarded 184 similar events)
// Phase 1: matrix 216 rows 72 cols
[2022-05-16 07:17:45] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-16 07:17:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-05-16 07:17:46] [INFO ] Flow matrix only has 216 transitions (discarded 184 similar events)
// Phase 1: matrix 216 rows 72 cols
[2022-05-16 07:17:46] [INFO ] Computed 15 place invariants in 4 ms
[2022-05-16 07:17:46] [INFO ] State equation strengthened by 139 read => feed constraints.
[2022-05-16 07:17:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 72/145 places, 400/1675 transitions.
Finished structural reductions, in 3 iterations. Remains : 72/145 places, 400/1675 transitions.
[2022-05-16 07:17:46] [INFO ] Flatten gal took : 42 ms
[2022-05-16 07:17:46] [INFO ] Flatten gal took : 20 ms
[2022-05-16 07:17:46] [INFO ] Input system was already deterministic with 400 transitions.
[2022-05-16 07:17:46] [INFO ] Flatten gal took : 21 ms
[2022-05-16 07:17:46] [INFO ] Flatten gal took : 21 ms
[2022-05-16 07:17:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality5776970185493453092.gal : 2 ms
[2022-05-16 07:17:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12873916205430858541.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/CTLCardinality5776970185493453092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12873916205430858541.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.74285e+07,0.304055,14664,2,1250,5,21418,6,0,678,18156,0
Converting to forward existential form...Done !
original formula: EF((EF(AG(((p59!=0)&&(p43!=1)))) + (p46==1)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !(E(TRUE U !(((p59!=0)&&(p43!=1))))))] != FALSE + [(FwdU(Init,TRUE) * (p46==1))]...165
Reverse transition relation is NOT exact ! Due to transitions t54, t61, t62, t64, t84, t85, t86, t88, t89, t116, t153, t190, Intersection with reachable a...225
(forward)formula 0,1,1.42014,47784,1,0,564,189763,815,365,9248,117065,803
FORMULA EnergyBus-PT-none-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Graph (trivial) has 134 edges and 145 vertex of which 17 / 145 are part of one of the 6 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 919 transitions
Reduce isomorphic transitions removed 919 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 131 transition count 754
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 131 transition count 747
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 124 transition count 747
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 37 place count 105 transition count 530
Iterating global reduction 2 with 19 rules applied. Total rules applied 56 place count 105 transition count 530
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 86 place count 105 transition count 500
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 place count 105 transition count 499
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 104 transition count 499
Performed 8 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 107 place count 93 transition count 467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 83 edges and 93 vertex of which 6 / 93 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 89 transition count 464
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 122 place count 88 transition count 454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 122 place count 88 transition count 453
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 124 place count 87 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 132 place count 82 transition count 450
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 72 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 33 rules applied. Total rules applied 165 place count 81 transition count 418
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 170 place count 79 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 173 place count 77 transition count 414
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 175 place count 77 transition count 412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 177 place count 75 transition count 412
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 181 place count 73 transition count 410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 183 place count 72 transition count 409
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 200 place count 72 transition count 392
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 9 with 4 rules applied. Total rules applied 204 place count 72 transition count 388
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 208 place count 68 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 208 place count 68 transition count 382
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 222 place count 60 transition count 382
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 2 rules applied. Total rules applied 224 place count 60 transition count 380
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 228 place count 58 transition count 378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 2 Pre rules applied. Total rules applied 228 place count 58 transition count 376
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 234 place count 54 transition count 376
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 240 place count 51 transition count 373
Graph (trivial) has 41 edges and 51 vertex of which 2 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 242 place count 49 transition count 373
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 13 with 156 rules applied. Total rules applied 398 place count 49 transition count 217
Applied a total of 398 rules in 72 ms. Remains 49 /145 variables (removed 96) and now considering 217/1675 (removed 1458) transitions.
[2022-05-16 07:17:47] [INFO ] Flow matrix only has 127 transitions (discarded 90 similar events)
// Phase 1: matrix 127 rows 49 cols
[2022-05-16 07:17:47] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 07:17:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-16 07:17:47] [INFO ] Flow matrix only has 127 transitions (discarded 90 similar events)
// Phase 1: matrix 127 rows 49 cols
[2022-05-16 07:17:47] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 07:17:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 07:17:48] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-16 07:17:48] [INFO ] Redundant transitions in 74 ms returned [40]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2022-05-16 07:17:48] [INFO ] Flow matrix only has 126 transitions (discarded 90 similar events)
// Phase 1: matrix 126 rows 49 cols
[2022-05-16 07:17:48] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 07:17:48] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/145 places, 216/1675 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 215
Applied a total of 3 rules in 4 ms. Remains 47 /49 variables (removed 2) and now considering 215/216 (removed 1) transitions.
[2022-05-16 07:17:48] [INFO ] Flow matrix only has 125 transitions (discarded 90 similar events)
// Phase 1: matrix 125 rows 47 cols
[2022-05-16 07:17:48] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 07:17:48] [INFO ] Implicit Places using invariants in 115 ms returned []
[2022-05-16 07:17:48] [INFO ] Flow matrix only has 125 transitions (discarded 90 similar events)
// Phase 1: matrix 125 rows 47 cols
[2022-05-16 07:17:48] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 07:17:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 07:17:48] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/145 places, 215/1675 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/145 places, 215/1675 transitions.
[2022-05-16 07:17:48] [INFO ] Flatten gal took : 4 ms
[2022-05-16 07:17:48] [INFO ] Flatten gal took : 4 ms
[2022-05-16 07:17:48] [INFO ] Input system was already deterministic with 215 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1723 steps, run visited all 1 properties in 8 ms. (steps per millisecond=215 )
Probabilistic random walk after 1723 steps, saw 454 distinct states, run finished after 9 ms. (steps per millisecond=191 ) properties seen :1
FORMULA EnergyBus-PT-none-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 122 transition count 1207
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 122 transition count 1207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 122 transition count 1204
Applied a total of 49 rules in 11 ms. Remains 122 /145 variables (removed 23) and now considering 1204/1675 (removed 471) transitions.
[2022-05-16 07:17:48] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
// Phase 1: matrix 438 rows 122 cols
[2022-05-16 07:17:48] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 07:17:48] [INFO ] Implicit Places using invariants in 235 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/145 places, 1204/1675 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/145 places, 1204/1675 transitions.
[2022-05-16 07:17:49] [INFO ] Flatten gal took : 105 ms
[2022-05-16 07:17:49] [INFO ] Flatten gal took : 124 ms
[2022-05-16 07:17:49] [INFO ] Input system was already deterministic with 1204 transitions.
[2022-05-16 07:17:49] [INFO ] Flatten gal took : 90 ms
[2022-05-16 07:17:49] [INFO ] Flatten gal took : 90 ms
[2022-05-16 07:17:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11023231781881080627.gal : 8 ms
[2022-05-16 07:17:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality6602471026038329236.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/CTLCardinality11023231781881080627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6602471026038329236.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,19.4504,526460,2,27187,5,859918,6,0,1684,778705,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:18:19] [INFO ] Flatten gal took : 92 ms
[2022-05-16 07:18:19] [INFO ] Applying decomposition
[2022-05-16 07:18:19] [INFO ] Flatten gal took : 116 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/graph12252284972269225677.txt' '-o' '/tmp/graph12252284972269225677.bin' '-w' '/tmp/graph12252284972269225677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12252284972269225677.bin' '-l' '-1' '-v' '-w' '/tmp/graph12252284972269225677.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:18:19] [INFO ] Decomposing Gal with order
[2022-05-16 07:18:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:18:20] [INFO ] Removed a total of 5782 redundant transitions.
[2022-05-16 07:18:20] [INFO ] Flatten gal took : 169 ms
[2022-05-16 07:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 34 ms.
[2022-05-16 07:18:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8657088887578693536.gal : 2 ms
[2022-05-16 07:18:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality8474915276092959564.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/CTLCardinality8657088887578693536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8474915276092959564.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,2.34532e+11,5.29187,163896,1737,194,117489,3140,914,1.58059e+06,165,17006,0
Converting to forward existential form...Done !
original formula: AX(EF(((((i10.u20.p98!=0)&&(i10.u20.p98!=1))||((i10.u20.p83!=0)&&(i3.u19.p95!=1)))||((i3.u6.p16!=0)&&(i3.u6.p16!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((i10.u20.p98!=0)&&(i10.u20.p98!=1))||((i10.u20.p83!=0)&&(i3.u19.p95!=1)))||((i3.u6.p1...190
Reverse transition relation is NOT exact ! Due to transitions t19, t50, t69, t70, t72, t75, t108, t117, t1158, t1175, t1176, t1177, t1179, t1188, t1189, u1...523
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 121 transition count 1127
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 121 transition count 1127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 121 transition count 1124
Applied a total of 51 rules in 15 ms. Remains 121 /145 variables (removed 24) and now considering 1124/1675 (removed 551) transitions.
[2022-05-16 07:18:50] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 121 cols
[2022-05-16 07:18:50] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:18:50] [INFO ] Implicit Places using invariants in 244 ms returned []
[2022-05-16 07:18:50] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 121 cols
[2022-05-16 07:18:50] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-16 07:18:50] [INFO ] State equation strengthened by 279 read => feed constraints.
[2022-05-16 07:18:51] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2022-05-16 07:18:51] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 121 cols
[2022-05-16 07:18:51] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:18:51] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/145 places, 1124/1675 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/145 places, 1124/1675 transitions.
[2022-05-16 07:18:51] [INFO ] Flatten gal took : 82 ms
[2022-05-16 07:18:51] [INFO ] Flatten gal took : 107 ms
[2022-05-16 07:18:51] [INFO ] Input system was already deterministic with 1124 transitions.
[2022-05-16 07:18:52] [INFO ] Flatten gal took : 86 ms
[2022-05-16 07:18:52] [INFO ] Flatten gal took : 85 ms
[2022-05-16 07:18:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8163517200347277635.gal : 8 ms
[2022-05-16 07:18:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality9933833960888630132.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/CTLCardinality8163517200347277635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9933833960888630132.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.24568e+11,21.9878,535188,2,29831,5,860045,6,0,1602,808045,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 07:19:22] [INFO ] Flatten gal took : 131 ms
[2022-05-16 07:19:22] [INFO ] Applying decomposition
[2022-05-16 07:19:22] [INFO ] Flatten gal took : 83 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/graph6120198914600453307.txt' '-o' '/tmp/graph6120198914600453307.bin' '-w' '/tmp/graph6120198914600453307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6120198914600453307.bin' '-l' '-1' '-v' '-w' '/tmp/graph6120198914600453307.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:19:22] [INFO ] Decomposing Gal with order
[2022-05-16 07:19:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:19:22] [INFO ] Removed a total of 4814 redundant transitions.
[2022-05-16 07:19:22] [INFO ] Flatten gal took : 152 ms
[2022-05-16 07:19:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 13 ms.
[2022-05-16 07:19:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6861493256761703494.gal : 1 ms
[2022-05-16 07:19:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15098006087306447950.ctl : 27 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/CTLCardinality6861493256761703494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15098006087306447950.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.24568e+11,3.48395,122916,1790,236,92947,1335,825,1.17e+06,138,11224,0
Converting to forward existential form...Done !
original formula: E(AX(!(((i2.i0.u24.p117==0)||(i3.u14.p57==1)))) U !(EF(AG((i1.u22.p14==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((i2.i0.u24.p117==0)||(i3.u14.p57==1))))))) * !(E(TRUE U !(E(TRUE U !((i1.u22.p14==1)))))))...165
Reverse transition relation is NOT exact ! Due to transitions t50, t70, t72, t75, t108, t117, t1078, t1095, t1096, t1097, t1099, t1108, t1109, u12.t48, u12...570
(forward)formula 0,0,5.54275,131216,1,0,126655,4216,5017,1.17e+06,684,23852,303437
FORMULA EnergyBus-PT-none-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Graph (trivial) has 123 edges and 145 vertex of which 16 / 145 are part of one of the 6 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 916 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 132 transition count 757
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 132 transition count 750
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 125 transition count 750
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 35 place count 108 transition count 583
Iterating global reduction 2 with 17 rules applied. Total rules applied 52 place count 108 transition count 583
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 82 place count 108 transition count 553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 82 place count 108 transition count 552
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 107 transition count 552
Performed 8 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 103 place count 96 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 75 edges and 96 vertex of which 6 / 96 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 107 place count 92 transition count 517
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 118 place count 91 transition count 507
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 126 place count 86 transition count 504
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 63 edges and 86 vertex of which 2 / 86 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 32 rules applied. Total rules applied 158 place count 85 transition count 473
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 162 place count 84 transition count 470
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 180 place count 84 transition count 452
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 183 place count 84 transition count 449
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 187 place count 81 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 188 place count 80 transition count 448
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 188 place count 80 transition count 444
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 9 rules applied. Total rules applied 197 place count 75 transition count 444
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 199 place count 74 transition count 443
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 3 rules applied. Total rules applied 202 place count 73 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 203 place count 72 transition count 441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 203 place count 72 transition count 440
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 205 place count 71 transition count 440
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 211 place count 68 transition count 437
Applied a total of 211 rules in 99 ms. Remains 68 /145 variables (removed 77) and now considering 437/1675 (removed 1238) transitions.
[2022-05-16 07:19:28] [INFO ] Flow matrix only has 236 transitions (discarded 201 similar events)
// Phase 1: matrix 236 rows 68 cols
[2022-05-16 07:19:28] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:19:28] [INFO ] Implicit Places using invariants in 178 ms returned [19, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 180 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/145 places, 437/1675 transitions.
Graph (trivial) has 38 edges and 66 vertex of which 4 / 66 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 181 transitions
Reduce isomorphic transitions removed 181 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 255
Applied a total of 2 rules in 12 ms. Remains 63 /66 variables (removed 3) and now considering 255/437 (removed 182) transitions.
[2022-05-16 07:19:28] [INFO ] Flow matrix only has 153 transitions (discarded 102 similar events)
// Phase 1: matrix 153 rows 63 cols
[2022-05-16 07:19:28] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:19:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-16 07:19:28] [INFO ] Flow matrix only has 153 transitions (discarded 102 similar events)
// Phase 1: matrix 153 rows 63 cols
[2022-05-16 07:19:28] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:19:28] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 07:19:28] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 63/145 places, 255/1675 transitions.
Finished structural reductions, in 2 iterations. Remains : 63/145 places, 255/1675 transitions.
[2022-05-16 07:19:28] [INFO ] Flatten gal took : 6 ms
[2022-05-16 07:19:28] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:19:28] [INFO ] Input system was already deterministic with 255 transitions.
[2022-05-16 07:19:28] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:19:28] [INFO ] Flatten gal took : 6 ms
[2022-05-16 07:19:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6797886003731652568.gal : 1 ms
[2022-05-16 07:19:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14782160672399745948.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/CTLCardinality6797886003731652568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14782160672399745948.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.17029e+07,0.161777,10296,2,1071,5,18335,5,0,508,15082,0
Converting to forward existential form...Done !
original formula: AG(((EF((p132==0)) + AG(((p99==0)||((p106==0)&&(p123==1))))) + ((p49==1)||(((p91==0)&&(p75==1))&&((p106==0)&&(p88==1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((p49==1)||(((p91==0)&&(p75==1))&&((p106==0)&&(p88==1)))))) * !(E(TRUE U (p132==0))...213
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t37, t46, t49, t51, t56, t59, t60, t61, t63, t64, t162, t193, t224, Intersect...245
(forward)formula 0,1,0.739994,29736,1,0,388,138616,530,234,4586,86444,519
FORMULA EnergyBus-PT-none-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 1675/1675 transitions.
Graph (trivial) has 126 edges and 145 vertex of which 16 / 145 are part of one of the 6 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 916 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 134 transition count 758
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3 place count 134 transition count 753
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 13 place count 129 transition count 753
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 32 place count 110 transition count 536
Iterating global reduction 2 with 19 rules applied. Total rules applied 51 place count 110 transition count 536
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 81 place count 110 transition count 506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 110 transition count 505
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 109 transition count 505
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 95 place count 103 transition count 487
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 107 place count 103 transition count 475
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 4 with 47 rules applied. Total rules applied 154 place count 103 transition count 428
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 2 rules applied. Total rules applied 156 place count 103 transition count 426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 158 place count 101 transition count 426
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 158 place count 101 transition count 425
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 100 transition count 425
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 6 with 18 rules applied. Total rules applied 178 place count 91 transition count 416
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 91 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 181 place count 90 transition count 414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 183 place count 89 transition count 413
Applied a total of 183 rules in 118 ms. Remains 89 /145 variables (removed 56) and now considering 413/1675 (removed 1262) transitions.
[2022-05-16 07:19:29] [INFO ] Flow matrix only has 229 transitions (discarded 184 similar events)
// Phase 1: matrix 229 rows 89 cols
[2022-05-16 07:19:29] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-16 07:19:30] [INFO ] Implicit Places using invariants in 252 ms returned [4, 5, 6, 72]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 273 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 85/145 places, 413/1675 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 412
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 84 transition count 411
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 83 transition count 411
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 2 with 10 rules applied. Total rules applied 14 place count 78 transition count 406
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 78 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 78 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 77 transition count 403
Applied a total of 18 rules in 44 ms. Remains 77 /85 variables (removed 8) and now considering 403/413 (removed 10) transitions.
[2022-05-16 07:19:30] [INFO ] Flow matrix only has 219 transitions (discarded 184 similar events)
// Phase 1: matrix 219 rows 77 cols
[2022-05-16 07:19:30] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-16 07:19:30] [INFO ] Implicit Places using invariants in 85 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 76/145 places, 403/1675 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 402
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 72 transition count 399
Applied a total of 8 rules in 22 ms. Remains 72 /76 variables (removed 4) and now considering 399/403 (removed 4) transitions.
[2022-05-16 07:19:30] [INFO ] Flow matrix only has 215 transitions (discarded 184 similar events)
// Phase 1: matrix 215 rows 72 cols
[2022-05-16 07:19:30] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-16 07:19:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2022-05-16 07:19:30] [INFO ] Flow matrix only has 215 transitions (discarded 184 similar events)
// Phase 1: matrix 215 rows 72 cols
[2022-05-16 07:19:30] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 07:19:30] [INFO ] State equation strengthened by 139 read => feed constraints.
[2022-05-16 07:19:30] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 72/145 places, 399/1675 transitions.
Finished structural reductions, in 3 iterations. Remains : 72/145 places, 399/1675 transitions.
[2022-05-16 07:19:30] [INFO ] Flatten gal took : 19 ms
[2022-05-16 07:19:30] [INFO ] Flatten gal took : 21 ms
[2022-05-16 07:19:30] [INFO ] Input system was already deterministic with 399 transitions.
[2022-05-16 07:19:30] [INFO ] Flatten gal took : 21 ms
[2022-05-16 07:19:30] [INFO ] Flatten gal took : 21 ms
[2022-05-16 07:19:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality662263473475176373.gal : 2 ms
[2022-05-16 07:19:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality9874307892333068316.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/CTLCardinality662263473475176373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9874307892333068316.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.66872e+07,0.299865,14724,2,1240,5,20876,6,0,677,17795,0
Converting to forward existential form...Done !
original formula: AG(((AF((p59==0)) + (p47==0)) + ((p69==0)&&(p142==1))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !(((p69==0)&&(p142==1)))) * !((p47==0))),!((p59==0)))] = FALSE
(forward)formula 0,1,0.593777,21384,1,0,13,68224,23,6,6458,30470,8
FORMULA EnergyBus-PT-none-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2022-05-16 07:19:31] [INFO ] Flatten gal took : 134 ms
[2022-05-16 07:19:31] [INFO ] Flatten gal took : 132 ms
[2022-05-16 07:19:31] [INFO ] Applying decomposition
[2022-05-16 07:19:31] [INFO ] Flatten gal took : 156 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/graph12809050828463925099.txt' '-o' '/tmp/graph12809050828463925099.bin' '-w' '/tmp/graph12809050828463925099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12809050828463925099.bin' '-l' '-1' '-v' '-w' '/tmp/graph12809050828463925099.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:19:32] [INFO ] Decomposing Gal with order
[2022-05-16 07:19:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:19:32] [INFO ] Removed a total of 7560 redundant transitions.
[2022-05-16 07:19:32] [INFO ] Flatten gal took : 188 ms
[2022-05-16 07:19:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 20 ms.
[2022-05-16 07:19:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11882426069209089987.gal : 3 ms
[2022-05-16 07:19:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17435092336194669315.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/CTLCardinality11882426069209089987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17435092336194669315.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 2 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.16998e+12,12.7373,180092,2179,306,175012,4412,937,1.02596e+06,188,34715,0
Converting to forward existential form...Done !
original formula: EG(E(((EG(EF(((i10.u20.p86==0)||(i9.u19.p84==1)))) * ((i9.u29.p150==0)||(i12.u31.p153==1))) * (((!(((i11.i0.u1.p6==1)&&((i9.u19.p84==0)||...368
=> equivalent forward existential formula: [FwdG(Init,E(((EG(E(TRUE U ((i10.u20.p86==0)||(i9.u19.p84==1)))) * ((i9.u29.p150==0)||(i12.u31.p153==1))) * (((!...423
Reverse transition relation is NOT exact ! Due to transitions t16, t31, t82, t105, t133, t138, t141, t147, t156, t173, t174, t203, t204, t233, t234, t461, ...1032
Using saturation style SCC detection
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 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
Fast SCC detection found an SCC at level 15
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 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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,262.922,2216484,1,0,2.99274e+06,15577,2424,1.55169e+07,443,139094,1178388
FORMULA EnergyBus-PT-none-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(EF(((((i9.u19.p98!=0)&&(i9.u19.p98!=1))||((i9.u19.p83!=0)&&(u18.p95!=1)))||((i10.u5.p16!=0)&&(i10.u5.p16!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((i9.u19.p98!=0)&&(i9.u19.p98!=1))||((i9.u19.p83!=0)&&(u18.p95!=1)))||((i10.u5.p16!=0)...186
(forward)formula 1,1,294.522,2216484,1,0,2.99274e+06,15577,3653,1.55169e+07,586,139094,2308381
FORMULA EnergyBus-PT-none-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 635680 ms.
BK_STOP 1652685867428
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-165260110300449"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;