Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EnergyBus-PT-none-CTLFireability-00
FORMULA_NAME EnergyBus-PT-none-CTLFireability-01
FORMULA_NAME EnergyBus-PT-none-CTLFireability-02
FORMULA_NAME EnergyBus-PT-none-CTLFireability-03
FORMULA_NAME EnergyBus-PT-none-CTLFireability-04
FORMULA_NAME EnergyBus-PT-none-CTLFireability-05
FORMULA_NAME EnergyBus-PT-none-CTLFireability-06
FORMULA_NAME EnergyBus-PT-none-CTLFireability-07
FORMULA_NAME EnergyBus-PT-none-CTLFireability-08
FORMULA_NAME EnergyBus-PT-none-CTLFireability-09
FORMULA_NAME EnergyBus-PT-none-CTLFireability-10
FORMULA_NAME EnergyBus-PT-none-CTLFireability-11
FORMULA_NAME EnergyBus-PT-none-CTLFireability-12
FORMULA_NAME EnergyBus-PT-none-CTLFireability-13
FORMULA_NAME EnergyBus-PT-none-CTLFireability-14
FORMULA_NAME EnergyBus-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678492363114

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 23:52:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 23:52:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:52:44] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2023-03-10 23:52:44] [INFO ] Transformed 157 places.
[2023-03-10 23:52:45] [INFO ] Transformed 4430 transitions.
[2023-03-10 23:52:45] [INFO ] Found NUPN structural information;
[2023-03-10 23:52:45] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 4 places in 23 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 131 transition count 1872
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 131 transition count 1872
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 131 transition count 1869
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 131 transition count 1861
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 130 transition count 1860
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 130 transition count 1860
Applied a total of 57 rules in 80 ms. Remains 130 /153 variables (removed 23) and now considering 1860/1913 (removed 53) transitions.
[2023-03-10 23:52:45] [INFO ] Flow matrix only has 602 transitions (discarded 1258 similar events)
// Phase 1: matrix 602 rows 130 cols
[2023-03-10 23:52:45] [INFO ] Computed 23 place invariants in 24 ms
[2023-03-10 23:52:45] [INFO ] Implicit Places using invariants in 239 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 266 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/153 places, 1860/1913 transitions.
Applied a total of 0 rules in 12 ms. Remains 129 /129 variables (removed 0) and now considering 1860/1860 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 359 ms. Remains : 129/153 places, 1860/1913 transitions.
Support contains 37 out of 129 places after structural reductions.
[2023-03-10 23:52:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-10 23:52:46] [INFO ] Flatten gal took : 324 ms
[2023-03-10 23:52:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EnergyBus-PT-none-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 23:52:46] [INFO ] Flatten gal took : 195 ms
[2023-03-10 23:52:46] [INFO ] Input system was already deterministic with 1860 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 740 ms. (steps per millisecond=13 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Interrupted probabilistic random walk after 124602 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124602 steps, saw 70533 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 30 properties.
[2023-03-10 23:52:50] [INFO ] Flow matrix only has 602 transitions (discarded 1258 similar events)
// Phase 1: matrix 602 rows 129 cols
[2023-03-10 23:52:50] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-10 23:52:51] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-10 23:52:51] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-10 23:52:51] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-10 23:52:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-10 23:52:52] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-10 23:52:54] [INFO ] After 2514ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :26
[2023-03-10 23:52:54] [INFO ] State equation strengthened by 461 read => feed constraints.
[2023-03-10 23:52:57] [INFO ] After 2442ms SMT Verify possible using 461 Read/Feed constraints in natural domain returned unsat :4 sat :26
[2023-03-10 23:52:57] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 14 ms to minimize.
[2023-03-10 23:52:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-10 23:52:57] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2023-03-10 23:52:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-10 23:52:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-03-10 23:52:59] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 4 ms to minimize.
[2023-03-10 23:52:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 159 ms
[2023-03-10 23:53:00] [INFO ] After 5679ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :24
Attempting to minimize the solution found.
Minimization took 2250 ms.
[2023-03-10 23:53:02] [INFO ] After 10813ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :24
Fused 30 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 853 ms.
Support contains 33 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Graph (trivial) has 54 edges and 129 vertex of which 10 / 129 are part of one of the 4 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 731 edges and 123 vertex of which 120 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.18 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 120 transition count 1831
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 116 transition count 1831
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 116 transition count 1827
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 112 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 111 transition count 1763
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 111 transition count 1763
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 102 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 102 transition count 1752
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 97 transition count 1761
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 60 place count 97 transition count 1753
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 139 place count 97 transition count 1674
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 143 place count 95 transition count 1672
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 146 place count 93 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 147 place count 92 transition count 1671
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 147 place count 92 transition count 1669
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 151 place count 90 transition count 1669
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 153 place count 90 transition count 1667
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 156 place count 88 transition count 1666
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 157 place count 88 transition count 1665
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 158 place count 88 transition count 1727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 159 place count 87 transition count 1727
Applied a total of 159 rules in 1635 ms. Remains 87 /129 variables (removed 42) and now considering 1727/1860 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1636 ms. Remains : 87/129 places, 1727/1860 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) 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 24) seen :0
Interrupted probabilistic random walk after 155346 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155346 steps, saw 75182 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 24 properties.
[2023-03-10 23:53:08] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 87 cols
[2023-03-10 23:53:08] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-10 23:53:09] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-10 23:53:09] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 23:53:09] [INFO ] After 716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-10 23:53:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-10 23:53:10] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:53:12] [INFO ] After 2097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-10 23:53:12] [INFO ] State equation strengthened by 456 read => feed constraints.
[2023-03-10 23:53:14] [INFO ] After 2197ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-10 23:53:14] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-10 23:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-10 23:53:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-10 23:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-10 23:53:17] [INFO ] After 4857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 2443 ms.
[2023-03-10 23:53:19] [INFO ] After 9548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 10 ms.
Support contains 33 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1727/1727 transitions.
Applied a total of 0 rules in 226 ms. Remains 87 /87 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 87/87 places, 1727/1727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1727/1727 transitions.
Applied a total of 0 rules in 241 ms. Remains 87 /87 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
[2023-03-10 23:53:20] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
[2023-03-10 23:53:20] [INFO ] Invariant cache hit.
[2023-03-10 23:53:20] [INFO ] Implicit Places using invariants in 58 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 1727/1727 transitions.
Applied a total of 0 rules in 227 ms. Remains 86 /86 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 546 ms. Remains : 86/87 places, 1727/1727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 129858 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129858 steps, saw 63690 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 24 properties.
[2023-03-10 23:53:24] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 86 cols
[2023-03-10 23:53:24] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-10 23:53:24] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-10 23:53:24] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:53:24] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-10 23:53:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-10 23:53:25] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 23:53:27] [INFO ] After 2062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-10 23:53:27] [INFO ] State equation strengthened by 448 read => feed constraints.
[2023-03-10 23:53:29] [INFO ] After 2423ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-10 23:53:29] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-10 23:53:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-10 23:53:31] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2023-03-10 23:53:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-10 23:53:32] [INFO ] After 4972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 2120 ms.
[2023-03-10 23:53:34] [INFO ] After 9311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 8 ms.
Support contains 33 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1727/1727 transitions.
Applied a total of 0 rules in 226 ms. Remains 86 /86 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 86/86 places, 1727/1727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1727/1727 transitions.
Applied a total of 0 rules in 223 ms. Remains 86 /86 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
[2023-03-10 23:53:34] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
[2023-03-10 23:53:34] [INFO ] Invariant cache hit.
[2023-03-10 23:53:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-10 23:53:34] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
[2023-03-10 23:53:34] [INFO ] Invariant cache hit.
[2023-03-10 23:53:34] [INFO ] State equation strengthened by 448 read => feed constraints.
[2023-03-10 23:53:35] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [13, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 577 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/86 places, 1727/1727 transitions.
Applied a total of 0 rules in 224 ms. Remains 84 /84 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1025 ms. Remains : 84/86 places, 1727/1727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 93366 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93366 steps, saw 46206 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 22 properties.
[2023-03-10 23:53:39] [INFO ] Flow matrix only has 521 transitions (discarded 1206 similar events)
// Phase 1: matrix 521 rows 84 cols
[2023-03-10 23:53:39] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-10 23:53:39] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-10 23:53:39] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:53:39] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-10 23:53:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-10 23:53:39] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-10 23:53:41] [INFO ] After 1863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-10 23:53:41] [INFO ] State equation strengthened by 448 read => feed constraints.
[2023-03-10 23:53:43] [INFO ] After 1820ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-10 23:53:45] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-10 23:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-10 23:53:45] [INFO ] After 3980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1900 ms.
[2023-03-10 23:53:47] [INFO ] After 7898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 12 ms.
Support contains 32 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1727/1727 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 1726
Applied a total of 2 rules in 237 ms. Remains 83 /84 variables (removed 1) and now considering 1726/1727 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 83/84 places, 1726/1727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1043 ms. (steps per millisecond=9 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 75492 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75492 steps, saw 40002 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-10 23:53:52] [INFO ] Flow matrix only has 519 transitions (discarded 1207 similar events)
// Phase 1: matrix 519 rows 83 cols
[2023-03-10 23:53:52] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-10 23:53:52] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-10 23:53:52] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 23:53:52] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-10 23:53:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-10 23:53:52] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:53:54] [INFO ] After 1858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-10 23:53:54] [INFO ] State equation strengthened by 448 read => feed constraints.
[2023-03-10 23:53:56] [INFO ] After 1658ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-10 23:53:56] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2023-03-10 23:53:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2023-03-10 23:53:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-10 23:53:58] [INFO ] After 3888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1721 ms.
[2023-03-10 23:54:00] [INFO ] After 7609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 2 ms.
Support contains 31 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1726/1726 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 1725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 1725
Applied a total of 2 rules in 462 ms. Remains 82 /83 variables (removed 1) and now considering 1725/1726 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 82/83 places, 1725/1726 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 127910 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127910 steps, saw 67151 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-10 23:54:04] [INFO ] Flow matrix only has 518 transitions (discarded 1207 similar events)
// Phase 1: matrix 518 rows 82 cols
[2023-03-10 23:54:04] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 23:54:04] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-10 23:54:04] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:54:04] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-10 23:54:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-10 23:54:04] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 23:54:06] [INFO ] After 1665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-10 23:54:06] [INFO ] State equation strengthened by 448 read => feed constraints.
[2023-03-10 23:54:08] [INFO ] After 1845ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-10 23:54:08] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2023-03-10 23:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-10 23:54:09] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2023-03-10 23:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-10 23:54:10] [INFO ] After 4154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1857 ms.
[2023-03-10 23:54:12] [INFO ] After 7818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 3 ms.
Support contains 31 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1725/1725 transitions.
Applied a total of 0 rules in 246 ms. Remains 82 /82 variables (removed 0) and now considering 1725/1725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 82/82 places, 1725/1725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1725/1725 transitions.
Applied a total of 0 rules in 225 ms. Remains 82 /82 variables (removed 0) and now considering 1725/1725 (removed 0) transitions.
[2023-03-10 23:54:13] [INFO ] Flow matrix only has 518 transitions (discarded 1207 similar events)
[2023-03-10 23:54:13] [INFO ] Invariant cache hit.
[2023-03-10 23:54:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-10 23:54:13] [INFO ] Flow matrix only has 518 transitions (discarded 1207 similar events)
[2023-03-10 23:54:13] [INFO ] Invariant cache hit.
[2023-03-10 23:54:13] [INFO ] State equation strengthened by 448 read => feed constraints.
[2023-03-10 23:54:13] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2023-03-10 23:54:15] [INFO ] Redundant transitions in 1317 ms returned []
[2023-03-10 23:54:15] [INFO ] Flow matrix only has 518 transitions (discarded 1207 similar events)
[2023-03-10 23:54:15] [INFO ] Invariant cache hit.
[2023-03-10 23:54:15] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2698 ms. Remains : 82/82 places, 1725/1725 transitions.
Graph (trivial) has 12 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 4 transitions
Ensure Unique test removed 1206 transitions
Reduce isomorphic transitions removed 1210 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 81 transition count 513
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 79 transition count 513
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 79 transition count 512
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 79 transition count 512
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 79 transition count 511
Applied a total of 12 rules in 68 ms. Remains 79 /82 variables (removed 3) and now considering 511/1725 (removed 1214) transitions.
Running SMT prover for 21 properties.
// Phase 1: matrix 511 rows 79 cols
[2023-03-10 23:54:15] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-10 23:54:15] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-10 23:54:15] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:54:16] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-10 23:54:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-10 23:54:16] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 23:54:17] [INFO ] After 1217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-10 23:54:17] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 23:54:18] [INFO ] After 1173ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-10 23:54:20] [INFO ] After 2557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1383 ms.
[2023-03-10 23:54:21] [INFO ] After 5265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA EnergyBus-PT-none-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 23:54:21] [INFO ] Flatten gal took : 282 ms
[2023-03-10 23:54:22] [INFO ] Flatten gal took : 257 ms
[2023-03-10 23:54:22] [INFO ] Input system was already deterministic with 1860 transitions.
Support contains 32 out of 129 places (down from 33) after GAL structural reductions.
Computed a total of 3 stabilizing places and 130 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 122 transition count 1124
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 122 transition count 1124
Applied a total of 14 rules in 23 ms. Remains 122 /129 variables (removed 7) and now considering 1124/1860 (removed 736) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 122/129 places, 1124/1860 transitions.
[2023-03-10 23:54:22] [INFO ] Flatten gal took : 122 ms
[2023-03-10 23:54:22] [INFO ] Flatten gal took : 133 ms
[2023-03-10 23:54:22] [INFO ] Input system was already deterministic with 1124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 124 transition count 1348
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 124 transition count 1348
Applied a total of 10 rules in 26 ms. Remains 124 /129 variables (removed 5) and now considering 1348/1860 (removed 512) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 124/129 places, 1348/1860 transitions.
[2023-03-10 23:54:23] [INFO ] Flatten gal took : 114 ms
[2023-03-10 23:54:23] [INFO ] Flatten gal took : 162 ms
[2023-03-10 23:54:23] [INFO ] Input system was already deterministic with 1348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 124 transition count 1364
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 124 transition count 1364
Applied a total of 10 rules in 9 ms. Remains 124 /129 variables (removed 5) and now considering 1364/1860 (removed 496) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 124/129 places, 1364/1860 transitions.
[2023-03-10 23:54:23] [INFO ] Flatten gal took : 92 ms
[2023-03-10 23:54:23] [INFO ] Flatten gal took : 94 ms
[2023-03-10 23:54:23] [INFO ] Input system was already deterministic with 1364 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 126 transition count 1556
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 126 transition count 1556
Applied a total of 6 rules in 26 ms. Remains 126 /129 variables (removed 3) and now considering 1556/1860 (removed 304) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 126/129 places, 1556/1860 transitions.
[2023-03-10 23:54:24] [INFO ] Flatten gal took : 147 ms
[2023-03-10 23:54:24] [INFO ] Flatten gal took : 116 ms
[2023-03-10 23:54:24] [INFO ] Input system was already deterministic with 1556 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 1492
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 1492
Applied a total of 8 rules in 10 ms. Remains 125 /129 variables (removed 4) and now considering 1492/1860 (removed 368) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 125/129 places, 1492/1860 transitions.
[2023-03-10 23:54:24] [INFO ] Flatten gal took : 96 ms
[2023-03-10 23:54:24] [INFO ] Flatten gal took : 120 ms
[2023-03-10 23:54:24] [INFO ] Input system was already deterministic with 1492 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 122 transition count 1124
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 122 transition count 1124
Applied a total of 14 rules in 19 ms. Remains 122 /129 variables (removed 7) and now considering 1124/1860 (removed 736) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 122/129 places, 1124/1860 transitions.
[2023-03-10 23:54:24] [INFO ] Flatten gal took : 82 ms
[2023-03-10 23:54:25] [INFO ] Flatten gal took : 74 ms
[2023-03-10 23:54:25] [INFO ] Input system was already deterministic with 1124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Graph (trivial) has 79 edges and 129 vertex of which 10 / 129 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 123 transition count 1844
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 119 transition count 1844
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 119 transition count 1840
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 115 transition count 1840
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 23 place count 109 transition count 1232
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 109 transition count 1232
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 41 place count 103 transition count 1226
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 54 place count 103 transition count 1213
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 103 transition count 1212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 102 transition count 1212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 102 transition count 1210
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 100 transition count 1210
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 68 place count 96 transition count 1206
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 71 place count 96 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 95 transition count 1203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 93 transition count 1201
Applied a total of 76 rules in 1095 ms. Remains 93 /129 variables (removed 36) and now considering 1201/1860 (removed 659) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1096 ms. Remains : 93/129 places, 1201/1860 transitions.
[2023-03-10 23:54:26] [INFO ] Flatten gal took : 56 ms
[2023-03-10 23:54:26] [INFO ] Flatten gal took : 105 ms
[2023-03-10 23:54:26] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 124 transition count 1364
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 124 transition count 1364
Applied a total of 10 rules in 10 ms. Remains 124 /129 variables (removed 5) and now considering 1364/1860 (removed 496) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 124/129 places, 1364/1860 transitions.
[2023-03-10 23:54:26] [INFO ] Flatten gal took : 85 ms
[2023-03-10 23:54:26] [INFO ] Flatten gal took : 89 ms
[2023-03-10 23:54:26] [INFO ] Input system was already deterministic with 1364 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Graph (trivial) has 74 edges and 129 vertex of which 10 / 129 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 123 transition count 1844
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 119 transition count 1844
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 119 transition count 1839
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 114 transition count 1839
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 109 transition count 1343
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 109 transition count 1343
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 41 place count 103 transition count 1337
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 54 place count 103 transition count 1324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 103 transition count 1323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 102 transition count 1323
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 102 transition count 1321
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 100 transition count 1321
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 68 place count 96 transition count 1317
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 71 place count 96 transition count 1314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 95 transition count 1314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 93 transition count 1312
Applied a total of 76 rules in 652 ms. Remains 93 /129 variables (removed 36) and now considering 1312/1860 (removed 548) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 666 ms. Remains : 93/129 places, 1312/1860 transitions.
[2023-03-10 23:54:27] [INFO ] Flatten gal took : 61 ms
[2023-03-10 23:54:27] [INFO ] Flatten gal took : 67 ms
[2023-03-10 23:54:28] [INFO ] Input system was already deterministic with 1312 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 579221 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 579221 steps, saw 229175 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:54:31] [INFO ] Flow matrix only has 363 transitions (discarded 949 similar events)
// Phase 1: matrix 363 rows 93 cols
[2023-03-10 23:54:31] [INFO ] Computed 21 place invariants in 14 ms
[2023-03-10 23:54:31] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:54:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-10 23:54:31] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 23:54:31] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:54:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-03-10 23:54:31] [INFO ] After 89ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 23:54:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2023-03-10 23:54:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-10 23:54:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-10 23:54:31] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-10 23:54:31] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 247 ms.
Support contains 13 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 1312/1312 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 93 transition count 1301
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 11 place count 93 transition count 1297
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 87 transition count 1297
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 83 transition count 1309
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 83 transition count 1306
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 104 place count 83 transition count 1234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 104 place count 83 transition count 1232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 81 transition count 1232
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 81 transition count 1224
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 124 place count 73 transition count 1224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 73 transition count 1286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 72 transition count 1286
Applied a total of 126 rules in 665 ms. Remains 72 /93 variables (removed 21) and now considering 1286/1312 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 72/93 places, 1286/1312 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11618 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 877 ms. (steps per millisecond=1140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6888419 steps, run timeout after 36001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 6888419 steps, saw 1205625 distinct states, run finished after 36001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:55:21] [INFO ] Flow matrix only has 289 transitions (discarded 997 similar events)
// Phase 1: matrix 289 rows 72 cols
[2023-03-10 23:55:21] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-10 23:55:21] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:55:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-10 23:55:21] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 23:55:21] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:55:21] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-10 23:55:21] [INFO ] After 83ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 23:55:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-10 23:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-10 23:55:21] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-10 23:55:21] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1286/1286 transitions.
Applied a total of 0 rules in 148 ms. Remains 72 /72 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 72/72 places, 1286/1286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1286/1286 transitions.
Applied a total of 0 rules in 133 ms. Remains 72 /72 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
[2023-03-10 23:55:21] [INFO ] Flow matrix only has 289 transitions (discarded 997 similar events)
[2023-03-10 23:55:21] [INFO ] Invariant cache hit.
[2023-03-10 23:55:22] [INFO ] Implicit Places using invariants in 95 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/72 places, 1286/1286 transitions.
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 0 with 128 rules applied. Total rules applied 128 place count 71 transition count 1158
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 71 transition count 1157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 130 place count 70 transition count 1157
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 70 transition count 1157
Applied a total of 134 rules in 461 ms. Remains 70 /71 variables (removed 1) and now considering 1157/1286 (removed 129) transitions.
[2023-03-10 23:55:22] [INFO ] Flow matrix only has 256 transitions (discarded 901 similar events)
// Phase 1: matrix 256 rows 70 cols
[2023-03-10 23:55:22] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-10 23:55:22] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-10 23:55:22] [INFO ] Flow matrix only has 256 transitions (discarded 901 similar events)
[2023-03-10 23:55:22] [INFO ] Invariant cache hit.
[2023-03-10 23:55:22] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-10 23:55:23] [INFO ] Implicit Places using invariants and state equation in 323 ms returned [13, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 534 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 68/72 places, 1157/1286 transitions.
Applied a total of 0 rules in 111 ms. Remains 68 /68 variables (removed 0) and now considering 1157/1157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1338 ms. Remains : 68/72 places, 1157/1286 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10228 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7048695 steps, run timeout after 33001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 7048695 steps, saw 1236380 distinct states, run finished after 33002 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:56:07] [INFO ] Flow matrix only has 256 transitions (discarded 901 similar events)
// Phase 1: matrix 256 rows 68 cols
[2023-03-10 23:56:07] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-10 23:56:07] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:56:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-10 23:56:07] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-10 23:56:07] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:56:07] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-10 23:56:07] [INFO ] After 70ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 23:56:07] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-10 23:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-10 23:56:07] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-10 23:56:07] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1157/1157 transitions.
Applied a total of 0 rules in 109 ms. Remains 68 /68 variables (removed 0) and now considering 1157/1157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 68/68 places, 1157/1157 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1157/1157 transitions.
Applied a total of 0 rules in 108 ms. Remains 68 /68 variables (removed 0) and now considering 1157/1157 (removed 0) transitions.
[2023-03-10 23:56:07] [INFO ] Flow matrix only has 256 transitions (discarded 901 similar events)
[2023-03-10 23:56:07] [INFO ] Invariant cache hit.
[2023-03-10 23:56:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-10 23:56:07] [INFO ] Flow matrix only has 256 transitions (discarded 901 similar events)
[2023-03-10 23:56:07] [INFO ] Invariant cache hit.
[2023-03-10 23:56:08] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-10 23:56:08] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-10 23:56:08] [INFO ] Redundant transitions in 225 ms returned [37]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2023-03-10 23:56:08] [INFO ] Flow matrix only has 255 transitions (discarded 901 similar events)
// Phase 1: matrix 255 rows 68 cols
[2023-03-10 23:56:08] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 23:56:09] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/68 places, 1156/1157 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 1155
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 1154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 67 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 66 transition count 1151
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 66 transition count 1151
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 66 transition count 1150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 65 transition count 1150
Applied a total of 8 rules in 341 ms. Remains 65 /68 variables (removed 3) and now considering 1150/1156 (removed 6) transitions.
[2023-03-10 23:56:09] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
// Phase 1: matrix 249 rows 65 cols
[2023-03-10 23:56:09] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-10 23:56:09] [INFO ] Implicit Places using invariants in 84 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 64/68 places, 1150/1157 transitions.
Applied a total of 0 rules in 109 ms. Remains 64 /64 variables (removed 0) and now considering 1150/1150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1883 ms. Remains : 64/68 places, 1150/1157 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10567 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 760 ms. (steps per millisecond=1315 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7356985 steps, run timeout after 33001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 7356985 steps, saw 1226907 distinct states, run finished after 33001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:56:53] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
// Phase 1: matrix 249 rows 64 cols
[2023-03-10 23:56:53] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-10 23:56:54] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:56:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-10 23:56:54] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:56:54] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:56:54] [INFO ] State equation strengthened by 195 read => feed constraints.
[2023-03-10 23:56:54] [INFO ] After 70ms SMT Verify possible using 195 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 23:56:54] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-10 23:56:54] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1150/1150 transitions.
Applied a total of 0 rules in 110 ms. Remains 64 /64 variables (removed 0) and now considering 1150/1150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 64/64 places, 1150/1150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1150/1150 transitions.
Applied a total of 0 rules in 110 ms. Remains 64 /64 variables (removed 0) and now considering 1150/1150 (removed 0) transitions.
[2023-03-10 23:56:54] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
[2023-03-10 23:56:54] [INFO ] Invariant cache hit.
[2023-03-10 23:56:54] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-10 23:56:54] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
[2023-03-10 23:56:54] [INFO ] Invariant cache hit.
[2023-03-10 23:56:54] [INFO ] State equation strengthened by 195 read => feed constraints.
[2023-03-10 23:56:54] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-10 23:56:55] [INFO ] Redundant transitions in 231 ms returned []
[2023-03-10 23:56:55] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
[2023-03-10 23:56:55] [INFO ] Invariant cache hit.
[2023-03-10 23:56:55] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1327 ms. Remains : 64/64 places, 1150/1150 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10531 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7403264 steps, run timeout after 33001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 7403264 steps, saw 1232421 distinct states, run finished after 33001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:57:40] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
[2023-03-10 23:57:40] [INFO ] Invariant cache hit.
[2023-03-10 23:57:40] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:57:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-10 23:57:40] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 23:57:40] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:57:40] [INFO ] State equation strengthened by 195 read => feed constraints.
[2023-03-10 23:57:40] [INFO ] After 69ms SMT Verify possible using 195 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 23:57:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-10 23:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-10 23:57:40] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-10 23:57:40] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1150/1150 transitions.
Applied a total of 0 rules in 109 ms. Remains 64 /64 variables (removed 0) and now considering 1150/1150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 64/64 places, 1150/1150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1150/1150 transitions.
Applied a total of 0 rules in 109 ms. Remains 64 /64 variables (removed 0) and now considering 1150/1150 (removed 0) transitions.
[2023-03-10 23:57:40] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
[2023-03-10 23:57:40] [INFO ] Invariant cache hit.
[2023-03-10 23:57:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-10 23:57:40] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
[2023-03-10 23:57:40] [INFO ] Invariant cache hit.
[2023-03-10 23:57:40] [INFO ] State equation strengthened by 195 read => feed constraints.
[2023-03-10 23:57:41] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-10 23:57:41] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-10 23:57:41] [INFO ] Flow matrix only has 249 transitions (discarded 901 similar events)
[2023-03-10 23:57:41] [INFO ] Invariant cache hit.
[2023-03-10 23:57:41] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 64/64 places, 1150/1150 transitions.
Graph (trivial) has 21 edges and 64 vertex of which 2 / 64 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Ensure Unique test removed 898 transitions
Reduce isomorphic transitions removed 906 transitions.
Graph (complete) has 369 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 243
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 62 transition count 241
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 60 transition count 241
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 1 with 2 rules applied. Total rules applied 9 place count 59 transition count 240
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 59 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 58 transition count 230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 57 transition count 229
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 57 transition count 229
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 57 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 56 transition count 226
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 2 with 84 rules applied. Total rules applied 118 place count 56 transition count 142
Applied a total of 118 rules in 36 ms. Remains 56 /64 variables (removed 8) and now considering 142/1150 (removed 1008) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 142 rows 56 cols
[2023-03-10 23:57:41] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-10 23:57:41] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:57:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-10 23:57:41] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 23:57:41] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:57:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 23:57:41] [INFO ] After 16ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 23:57:41] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 23:57:41] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 1860/1860 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 123 transition count 1236
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 123 transition count 1236
Applied a total of 12 rules in 11 ms. Remains 123 /129 variables (removed 6) and now considering 1236/1860 (removed 624) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 123/129 places, 1236/1860 transitions.
[2023-03-10 23:57:42] [INFO ] Flatten gal took : 77 ms
[2023-03-10 23:57:42] [INFO ] Flatten gal took : 80 ms
[2023-03-10 23:57:42] [INFO ] Input system was already deterministic with 1236 transitions.
[2023-03-10 23:57:42] [INFO ] Flatten gal took : 129 ms
[2023-03-10 23:57:42] [INFO ] Flatten gal took : 129 ms
[2023-03-10 23:57:42] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-10 23:57:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 1860 transitions and 25934 arcs took 41 ms.
Total runtime 297969 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 129 NrTr: 1860 NrArc: 25934)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.108sec

net check time: 0m 0.002sec

init dd package: 0m 2.682sec


RS generation: 0m16.425sec


-> reachability set: #nodes 38828 (3.9e+04) #states 279,940,792,321 (11)



starting MCC model checker
--------------------------

checking: EX [EG [EX [AX [1<=0]]]]
normalized: EX [EG [EX [~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
...
EG iterations: 1
.-> the formula is FALSE

FORMULA EnergyBus-PT-none-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.539sec

checking: EG [EF [EX [[[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p49<=1 & 1<=p49] & [p61<=1 & 1<=p61]]] & [[[p74<=1 & 1<=p74] & [p87<=1 & 1<=p87]] & [[p97<=1 & 1<=p97] & [p111<=1 & 1<=p111]]]]]]]
normalized: EG [E [true U EX [[[[[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]] & [[p61<=1 & 1<=p61] & [p49<=1 & 1<=p49]]] & [[[p74<=1 & 1<=p74] & [p87<=1 & 1<=p87]] & [[p97<=1 & 1<=p97] & [p111<=1 & 1<=p111]]]]]]]

abstracting: (1<=p111)
states: 15,042,723,840 (10)
abstracting: (p111<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p87)
states: 17,139,686,400 (10)
abstracting: (p87<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p74)
states: 9,671,602,176 (9)
abstracting: (p74<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
..
EG iterations: 1
-> the formula is TRUE

FORMULA EnergyBus-PT-none-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.298sec

checking: E [~ [AG [~ [AX [[[[[1<=p47 & p47<=1] & [1<=p35 & p35<=1]] & [[1<=p13 & p13<=1] & [p15<=1 & 1<=p15]]] & [[[1<=p96 & p96<=1] & [1<=p123 & p123<=1]] & [[p89<=1 & 1<=p89] & [1<=p69 & p69<=1]]]]]]]] U AG [EX [EF [~ [[[[[p111<=1 & 1<=p111] & [1<=p96 & p96<=1]] & [[1<=p89 & p89<=1] & [1<=p71 & p71<=1]]] & [[[1<=p35 & p35<=1] & [1<=p47 & p47<=1]] & [[1<=p15 & p15<=1] & [1<=p13 & p13<=1]]]]]]]]]
normalized: E [E [true U ~ [EX [~ [[[[[1<=p69 & p69<=1] & [p89<=1 & 1<=p89]] & [[1<=p96 & p96<=1] & [1<=p123 & p123<=1]]] & [[[p15<=1 & 1<=p15] & [1<=p13 & p13<=1]] & [[1<=p47 & p47<=1] & [1<=p35 & p35<=1]]]]]]]] U ~ [E [true U ~ [EX [E [true U ~ [[[[[1<=p13 & p13<=1] & [1<=p15 & p15<=1]] & [[1<=p35 & p35<=1] & [1<=p47 & p47<=1]]] & [[[1<=p71 & p71<=1] & [1<=p89 & p89<=1]] & [[p111<=1 & 1<=p111] & [1<=p96 & p96<=1]]]]]]]]]]]

abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (1<=p111)
states: 15,042,723,840 (10)
abstracting: (p111<=1)
states: 279,940,792,321 (11)
abstracting: (p89<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p89)
states: 106,350,520,320 (11)
abstracting: (p71<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p71)
states: 9,671,602,176 (9)
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
.abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (p123<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p123)
states: 15,413,207,040 (10)
abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (1<=p89)
states: 106,350,520,320 (11)
abstracting: (p89<=1)
states: 279,940,792,321 (11)
abstracting: (p69<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p69)
states: 9,964,062,720 (9)
.-> the formula is TRUE

FORMULA EnergyBus-PT-none-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.655sec

checking: EF [[EF [[[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p49<=1 & 1<=p49] & [p61<=1 & 1<=p61]]] & [[[p79<=1 & 1<=p79] & [p87<=1 & 1<=p87]] & [[p97<=1 & 1<=p97] & [p114<=1 & 1<=p114]]]]] & [[[[p13<=0 & 0<=p13] | [p15<=0 & 0<=p15]] | [[p49<=0 & 0<=p49] | [p61<=0 & 0<=p61]]] | [[[p86<=0 & 0<=p86] | [p87<=0 & 0<=p87]] | [[p97<=0 & 0<=p97] | [p123<=0 & 0<=p123]]]]]]
normalized: E [true U [[[[[p123<=0 & 0<=p123] | [p97<=0 & 0<=p97]] | [[p87<=0 & 0<=p87] | [p86<=0 & 0<=p86]]] | [[[p61<=0 & 0<=p61] | [p49<=0 & 0<=p49]] | [[p15<=0 & 0<=p15] | [p13<=0 & 0<=p13]]]] & E [true U [[[[p114<=1 & 1<=p114] & [p97<=1 & 1<=p97]] & [[p87<=1 & 1<=p87] & [p79<=1 & 1<=p79]]] & [[[p61<=1 & 1<=p61] & [p49<=1 & 1<=p49]] & [[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]]]]]]]

abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p79)
states: 20,683,081,728 (10)
abstracting: (p79<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p87)
states: 17,139,686,400 (10)
abstracting: (p87<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p114)
states: 15,042,723,840 (10)
abstracting: (p114<=1)
states: 279,940,792,321 (11)
abstracting: (0<=p13)
states: 279,940,792,321 (11)
abstracting: (p13<=0)
states: 118,015,626,241 (11)
abstracting: (0<=p15)
states: 279,940,792,321 (11)
abstracting: (p15<=0)
states: 137,706,232,321 (11)
abstracting: (0<=p49)
states: 279,940,792,321 (11)
abstracting: (p49<=0)
states: 273,152,434,177 (11)
abstracting: (0<=p61)
states: 279,940,792,321 (11)
abstracting: (p61<=0)
states: 234,412,314,625 (11)
abstracting: (0<=p86)
states: 279,940,792,321 (11)
abstracting: (p86<=0)
states: 278,705,848,321 (11)
abstracting: (0<=p87)
states: 279,940,792,321 (11)
abstracting: (p87<=0)
states: 262,801,105,921 (11)
abstracting: (0<=p97)
states: 279,940,792,321 (11)
abstracting: (p97<=0)
states: 170,995,018,753 (11)
abstracting: (0<=p123)
states: 279,940,792,321 (11)
abstracting: (p123<=0)
states: 264,527,585,281 (11)
-> the formula is TRUE

FORMULA EnergyBus-PT-none-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.317sec

checking: AG [[[[[[0<=p118 & p118<=0] | [0<=p96 & p96<=0]] | [[0<=p93 & p93<=0] | [p69<=0 & 0<=p69]]] | [[[0<=p13 & p13<=0] | [0<=p15 & p15<=0]] | [[0<=p35 & p35<=0] | [0<=p47 & p47<=0]]]] & [[[[0<=p93 & p93<=0] | [0<=p72 & p72<=0]] | [[0<=p97 & p97<=0] | [p111<=0 & 0<=p111]]] | [[[0<=p61 & p61<=0] | [0<=p49 & p49<=0]] | [[0<=p13 & p13<=0] | [p15<=0 & 0<=p15]]]]]]
normalized: ~ [E [true U ~ [[[[[[p15<=0 & 0<=p15] | [0<=p13 & p13<=0]] | [[0<=p49 & p49<=0] | [0<=p61 & p61<=0]]] | [[[p111<=0 & 0<=p111] | [0<=p97 & p97<=0]] | [[0<=p72 & p72<=0] | [0<=p93 & p93<=0]]]] & [[[[0<=p47 & p47<=0] | [0<=p35 & p35<=0]] | [[0<=p15 & p15<=0] | [0<=p13 & p13<=0]]] | [[[p69<=0 & 0<=p69] | [0<=p93 & p93<=0]] | [[0<=p96 & p96<=0] | [0<=p118 & p118<=0]]]]]]]]

abstracting: (p118<=0)
states: 265,368,526,849 (11)
abstracting: (0<=p118)
states: 279,940,792,321 (11)
abstracting: (p96<=0)
states: 170,995,018,753 (11)
abstracting: (0<=p96)
states: 279,940,792,321 (11)
abstracting: (p93<=0)
states: 262,801,105,921 (11)
abstracting: (0<=p93)
states: 279,940,792,321 (11)
abstracting: (0<=p69)
states: 279,940,792,321 (11)
abstracting: (p69<=0)
states: 269,976,729,601 (11)
abstracting: (p13<=0)
states: 118,015,626,241 (11)
abstracting: (0<=p13)
states: 279,940,792,321 (11)
abstracting: (p15<=0)
states: 137,706,232,321 (11)
abstracting: (0<=p15)
states: 279,940,792,321 (11)
abstracting: (p35<=0)
states: 273,152,434,177 (11)
abstracting: (0<=p35)
states: 279,940,792,321 (11)
abstracting: (p47<=0)
states: 234,412,314,625 (11)
abstracting: (0<=p47)
states: 279,940,792,321 (11)
abstracting: (p93<=0)
states: 262,801,105,921 (11)
abstracting: (0<=p93)
states: 279,940,792,321 (11)
abstracting: (p72<=0)
states: 270,269,190,145 (11)
abstracting: (0<=p72)
states: 279,940,792,321 (11)
abstracting: (p97<=0)
states: 170,995,018,753 (11)
abstracting: (0<=p97)
states: 279,940,792,321 (11)
abstracting: (0<=p111)
states: 279,940,792,321 (11)
abstracting: (p111<=0)
states: 264,898,068,481 (11)
abstracting: (p61<=0)
states: 234,412,314,625 (11)
abstracting: (0<=p61)
states: 279,940,792,321 (11)
abstracting: (p49<=0)
states: 273,152,434,177 (11)
abstracting: (0<=p49)
states: 279,940,792,321 (11)
abstracting: (p13<=0)
states: 118,015,626,241 (11)
abstracting: (0<=p13)
states: 279,940,792,321 (11)
abstracting: (0<=p15)
states: 279,940,792,321 (11)
abstracting: (p15<=0)
states: 137,706,232,321 (11)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.714sec

checking: AF [[A [AX [1<=0] U EG [[1<=p75 & p75<=1]]] | EF [[[[[[1<=p69 & p69<=1] & [p93<=1 & 1<=p93]] & [[1<=p110 & p110<=1] & [p97<=1 & 1<=p97]]] & [[[1<=p15 & p15<=1] & [1<=p13 & p13<=1]] & [[1<=p49 & p49<=1] & [p61<=1 & 1<=p61]]]] | [[[[1<=p15 & p15<=1] & [1<=p13 & p13<=1]] & [[p47<=1 & 1<=p47] & [p35<=1 & 1<=p35]]] & [[[1<=p76 & p76<=1] & [p92<=1 & 1<=p92]] & [[p97<=1 & 1<=p97] & [p115<=1 & 1<=p115]]]]]]]]
normalized: ~ [EG [~ [[E [true U [[[[[p115<=1 & 1<=p115] & [p97<=1 & 1<=p97]] & [[p92<=1 & 1<=p92] & [1<=p76 & p76<=1]]] & [[[p35<=1 & 1<=p35] & [p47<=1 & 1<=p47]] & [[1<=p13 & p13<=1] & [1<=p15 & p15<=1]]]] | [[[[p61<=1 & 1<=p61] & [1<=p49 & p49<=1]] & [[1<=p13 & p13<=1] & [1<=p15 & p15<=1]]] & [[[p97<=1 & 1<=p97] & [1<=p110 & p110<=1]] & [[p93<=1 & 1<=p93] & [1<=p69 & p69<=1]]]]]] | [~ [EG [~ [EG [[1<=p75 & p75<=1]]]]] & ~ [E [~ [EG [[1<=p75 & p75<=1]]] U [EX [~ [1<=0]] & ~ [EG [[1<=p75 & p75<=1]]]]]]]]]]]

abstracting: (p75<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p75)
states: 9,671,602,176 (9)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (p75<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p75)
states: 9,671,602,176 (9)
.
EG iterations: 1
abstracting: (p75<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p75)
states: 9,671,602,176 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p69<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p69)
states: 9,964,062,720 (9)
abstracting: (1<=p93)
states: 17,139,686,400 (10)
abstracting: (p93<=1)
states: 279,940,792,321 (11)
abstracting: (p110<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p110)
states: 15,042,723,840 (10)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (p76<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p76)
states: 9,964,062,720 (9)
abstracting: (1<=p92)
states: 17,139,686,400 (10)
abstracting: (p92<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p115)
states: 15,042,723,840 (10)
abstracting: (p115<=1)
states: 279,940,792,321 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA EnergyBus-PT-none-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.417sec

checking: AF [EX [EX [[[[[[1<=p61 & p61<=1] & [1<=p49 & p49<=1]] & [[1<=p15 & p15<=1] & [1<=p13 & p13<=1]]] & [[[p122<=1 & 1<=p122] & [p96<=1 & 1<=p96]] & [[p72<=1 & 1<=p72] & [1<=p87 & p87<=1]]]] | [[[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[1<=p49 & p49<=1] & [1<=p61 & p61<=1]]] & [[[p79<=1 & 1<=p79] & [p92<=1 & 1<=p92]] & [[p97<=1 & 1<=p97] & [p111<=1 & 1<=p111]]]] | [[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p35<=1 & 1<=p35] & [p47<=1 & 1<=p47]]] & [[[p69<=1 & 1<=p69] & [p87<=1 & 1<=p87]] & [[p97<=1 & 1<=p97] & [p115<=1 & 1<=p115]]]]]]]]]
normalized: ~ [EG [~ [EX [EX [[[[[[[p97<=1 & 1<=p97] & [p111<=1 & 1<=p111]] & [[p79<=1 & 1<=p79] & [p92<=1 & 1<=p92]]] & [[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[1<=p61 & p61<=1] & [1<=p49 & p49<=1]]]] | [[[[p69<=1 & 1<=p69] & [p87<=1 & 1<=p87]] & [[p97<=1 & 1<=p97] & [p115<=1 & 1<=p115]]] & [[[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]] & [[p47<=1 & 1<=p47] & [p35<=1 & 1<=p35]]]]] | [[[[1<=p49 & p49<=1] & [1<=p61 & p61<=1]] & [[1<=p15 & p15<=1] & [1<=p13 & p13<=1]]] & [[[1<=p87 & p87<=1] & [p72<=1 & 1<=p72]] & [[p122<=1 & 1<=p122] & [p96<=1 & 1<=p96]]]]]]]]]]

abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p122)
states: 15,413,207,040 (10)
abstracting: (p122<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p72)
states: 9,671,602,176 (9)
abstracting: (p72<=1)
states: 279,940,792,321 (11)
abstracting: (p87<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p87)
states: 17,139,686,400 (10)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p115)
states: 15,042,723,840 (10)
abstracting: (p115<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p87)
states: 17,139,686,400 (10)
abstracting: (p87<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p69)
states: 9,964,062,720 (9)
abstracting: (p69<=1)
states: 279,940,792,321 (11)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p92)
states: 17,139,686,400 (10)
abstracting: (p92<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p79)
states: 20,683,081,728 (10)
abstracting: (p79<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p111)
states: 15,042,723,840 (10)
abstracting: (p111<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
...
EG iterations: 1
-> the formula is FALSE

FORMULA EnergyBus-PT-none-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.209sec

checking: EF [EX [[[[[[0<=p114 & p114<=0] | [0<=p97 & p97<=0]] | [[0<=p87 & p87<=0] | [p65<=0 & 0<=p65]]] | [[[p13<=0 & 0<=p13] | [p15<=0 & 0<=p15]] | [[p49<=0 & 0<=p49] | [p61<=0 & 0<=p61]]]] & EG [[[[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p49<=1 & 1<=p49] & [p61<=1 & 1<=p61]]] & [[[p76<=1 & 1<=p76] & [p87<=1 & 1<=p87]] & [[p96<=1 & 1<=p96] & [p111<=1 & 1<=p111]]]] | AX [[[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p49<=1 & 1<=p49] & [p61<=1 & 1<=p61]]] & [[[p69<=1 & 1<=p69] & [p93<=1 & 1<=p93]] & [[p96<=1 & 1<=p96] & [p119<=1 & 1<=p119]]]]]]]]]]
normalized: E [true U EX [[EG [[~ [EX [~ [[[[[p119<=1 & 1<=p119] & [p96<=1 & 1<=p96]] & [[p93<=1 & 1<=p93] & [p69<=1 & 1<=p69]]] & [[[p61<=1 & 1<=p61] & [p49<=1 & 1<=p49]] & [[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]]]]]]] | [[[[p111<=1 & 1<=p111] & [p96<=1 & 1<=p96]] & [[p87<=1 & 1<=p87] & [p76<=1 & 1<=p76]]] & [[[p61<=1 & 1<=p61] & [p49<=1 & 1<=p49]] & [[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]]]]]] & [[[[p61<=0 & 0<=p61] | [p49<=0 & 0<=p49]] | [[p15<=0 & 0<=p15] | [p13<=0 & 0<=p13]]] | [[[p65<=0 & 0<=p65] | [0<=p87 & p87<=0]] | [[0<=p97 & p97<=0] | [0<=p114 & p114<=0]]]]]]]

abstracting: (p114<=0)
states: 264,898,068,481 (11)
abstracting: (0<=p114)
states: 279,940,792,321 (11)
abstracting: (p97<=0)
states: 170,995,018,753 (11)
abstracting: (0<=p97)
states: 279,940,792,321 (11)
abstracting: (p87<=0)
states: 262,801,105,921 (11)
abstracting: (0<=p87)
states: 279,940,792,321 (11)
abstracting: (0<=p65)
states: 279,940,792,321 (11)
abstracting: (p65<=0)
states: 259,257,710,593 (11)
abstracting: (0<=p13)
states: 279,940,792,321 (11)
abstracting: (p13<=0)
states: 118,015,626,241 (11)
abstracting: (0<=p15)
states: 279,940,792,321 (11)
abstracting: (p15<=0)
states: 137,706,232,321 (11)
abstracting: (0<=p49)
states: 279,940,792,321 (11)
abstracting: (p49<=0)
states: 273,152,434,177 (11)
abstracting: (0<=p61)
states: 279,940,792,321 (11)
abstracting: (p61<=0)
states: 234,412,314,625 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p76)
states: 9,964,062,720 (9)
abstracting: (p76<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p87)
states: 17,139,686,400 (10)
abstracting: (p87<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p111)
states: 15,042,723,840 (10)
abstracting: (p111<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p69)
states: 9,964,062,720 (9)
abstracting: (p69<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p93)
states: 17,139,686,400 (10)
abstracting: (p93<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p119)
states: 14,572,265,472 (10)
abstracting: (p119<=1)
states: 279,940,792,321 (11)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA EnergyBus-PT-none-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.939sec

checking: AF [[EX [EX [[[[AX [[[[[p61<=1 & 1<=p61] & [p49<=1 & 1<=p49]] & [[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]]] & [[[p72<=1 & 1<=p72] & [p93<=1 & 1<=p93]] & [[p97<=1 & 1<=p97] & [p110<=1 & 1<=p110]]]]] | [p13<=0 & 0<=p13]] | [[p15<=0 & 0<=p15] | [p49<=0 & 0<=p49]]] | [[[p61<=0 & 0<=p61] | [p72<=0 & 0<=p72]] | [[p87<=0 & 0<=p87] | [[p97<=0 & 0<=p97] | [p118<=0 & 0<=p118]]]]]]] & EF [[[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p49<=1 & 1<=p49] & [p61<=1 & 1<=p61]]] & [[[p69<=1 & 1<=p69] & [p87<=1 & 1<=p87]] & [[p97<=1 & 1<=p97] & [[p119<=1 & 1<=p119] & [[[[p13<=0 & 0<=p13] | [p15<=0 & 0<=p15]] | [[p49<=0 & 0<=p49] | [p61<=0 & 0<=p61]]] | [[[p86<=0 & 0<=p86] | [p92<=0 & 0<=p92]] | [[p96<=0 & 0<=p96] | [p118<=0 & 0<=p118]]]]]]]]]]]
normalized: ~ [EG [~ [[E [true U [[[[[[[[p13<=0 & 0<=p13] | [p15<=0 & 0<=p15]] | [[p61<=0 & 0<=p61] | [p49<=0 & 0<=p49]]] | [[[p96<=0 & 0<=p96] | [p118<=0 & 0<=p118]] | [[p92<=0 & 0<=p92] | [p86<=0 & 0<=p86]]]] & [p119<=1 & 1<=p119]] & [p97<=1 & 1<=p97]] & [[p87<=1 & 1<=p87] & [p69<=1 & 1<=p69]]] & [[[p61<=1 & 1<=p61] & [p49<=1 & 1<=p49]] & [[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]]]]] & EX [EX [[[[[[p118<=0 & 0<=p118] | [p97<=0 & 0<=p97]] | [p87<=0 & 0<=p87]] | [[p72<=0 & 0<=p72] | [p61<=0 & 0<=p61]]] | [[[p49<=0 & 0<=p49] | [p15<=0 & 0<=p15]] | [[p13<=0 & 0<=p13] | ~ [EX [~ [[[[[p110<=1 & 1<=p110] & [p97<=1 & 1<=p97]] & [[p93<=1 & 1<=p93] & [p72<=1 & 1<=p72]]] & [[[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]] & [[p49<=1 & 1<=p49] & [p61<=1 & 1<=p61]]]]]]]]]]]]]]]]

abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p72)
states: 9,671,602,176 (9)
abstracting: (p72<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p93)
states: 17,139,686,400 (10)
abstracting: (p93<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p110)
states: 15,042,723,840 (10)
abstracting: (p110<=1)
states: 279,940,792,321 (11)
.abstracting: (0<=p13)
states: 279,940,792,321 (11)
abstracting: (p13<=0)
states: 118,015,626,241 (11)
abstracting: (0<=p15)
states: 279,940,792,321 (11)
abstracting: (p15<=0)
states: 137,706,232,321 (11)
abstracting: (0<=p49)
states: 279,940,792,321 (11)
abstracting: (p49<=0)
states: 273,152,434,177 (11)
abstracting: (0<=p61)
states: 279,940,792,321 (11)
abstracting: (p61<=0)
states: 234,412,314,625 (11)
abstracting: (0<=p72)
states: 279,940,792,321 (11)
abstracting: (p72<=0)
states: 270,269,190,145 (11)
abstracting: (0<=p87)
states: 279,940,792,321 (11)
abstracting: (p87<=0)
states: 262,801,105,921 (11)
abstracting: (0<=p97)
states: 279,940,792,321 (11)
abstracting: (p97<=0)
states: 170,995,018,753 (11)
abstracting: (0<=p118)
states: 279,940,792,321 (11)
abstracting: (p118<=0)
states: 265,368,526,849 (11)
..abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p69)
states: 9,964,062,720 (9)
abstracting: (p69<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p87)
states: 17,139,686,400 (10)
abstracting: (p87<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p119)
states: 14,572,265,472 (10)
abstracting: (p119<=1)
states: 279,940,792,321 (11)
abstracting: (0<=p86)
states: 279,940,792,321 (11)
abstracting: (p86<=0)
states: 278,705,848,321 (11)
abstracting: (0<=p92)
states: 279,940,792,321 (11)
abstracting: (p92<=0)
states: 262,801,105,921 (11)
abstracting: (0<=p118)
states: 279,940,792,321 (11)
abstracting: (p118<=0)
states: 265,368,526,849 (11)
abstracting: (0<=p96)
states: 279,940,792,321 (11)
abstracting: (p96<=0)
states: 170,995,018,753 (11)
abstracting: (0<=p49)
states: 279,940,792,321 (11)
abstracting: (p49<=0)
states: 273,152,434,177 (11)
abstracting: (0<=p61)
states: 279,940,792,321 (11)
abstracting: (p61<=0)
states: 234,412,314,625 (11)
abstracting: (0<=p15)
states: 279,940,792,321 (11)
abstracting: (p15<=0)
states: 137,706,232,321 (11)
abstracting: (0<=p13)
states: 279,940,792,321 (11)
abstracting: (p13<=0)
states: 118,015,626,241 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA EnergyBus-PT-none-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.962sec

checking: E [[[AF [EG [[[[[p97<=1 & 1<=p97] & [p114<=1 & 1<=p114]] & [[p76<=1 & 1<=p76] & [p87<=1 & 1<=p87]]] & [[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p49<=1 & 1<=p49] & [p61<=1 & 1<=p61]]]]]] & ~ [[[[[[1<=p119 & p119<=1] & [1<=p96 & p96<=1]] & [[1<=p89 & p89<=1] & [1<=p64 & p64<=1]]] & [[[1<=p47 & p47<=1] & [1<=p35 & p35<=1]] & [[1<=p15 & p15<=1] & [1<=p13 & p13<=1]]]] | [[[[1<=p47 & p47<=1] & [1<=p35 & p35<=1]] & [[1<=p15 & p15<=1] & [1<=p13 & p13<=1]]] & [[[1<=p92 & p92<=1] & [1<=p72 & p72<=1]] & [[p97<=1 & 1<=p97] & [p115<=1 & 1<=p115]]]]]]] | [EX [EF [AX [[[[[p13<=1 & 1<=p13] & [p15<=1 & 1<=p15]] & [[p35<=1 & 1<=p35] & [p47<=1 & 1<=p47]]] & [[[p77<=1 & 1<=p77] & [p89<=1 & 1<=p89]] & [[1<=p96 & p96<=1] & [1<=p115 & p115<=1]]]]]]] & [[[1<=p75 & p75<=1] & [1<=p26 & p26<=1]] | EF [[[[[1<=p61 & p61<=1] & [1<=p49 & p49<=1]] & [[1<=p13 & p13<=1] & [1<=p15 & p15<=1]]] & [[[1<=p89 & p89<=1] & [1<=p74 & p74<=1]] & [[p97<=1 & 1<=p97] & [p114<=1 & 1<=p114]]]]]]]] U EG [[[[[1<=p15 & p15<=1] & [1<=p13 & p13<=1]] & [[1<=p35 & p35<=1] & [p47<=1 & 1<=p47]]] & [[[p71<=1 & 1<=p71] & [p92<=1 & 1<=p92]] & [[p96<=1 & 1<=p96] & [p114<=1 & 1<=p114]]]]]]
normalized: E [[[~ [[[[[[1<=p13 & p13<=1] & [1<=p15 & p15<=1]] & [[1<=p35 & p35<=1] & [1<=p47 & p47<=1]]] & [[[1<=p64 & p64<=1] & [1<=p89 & p89<=1]] & [[1<=p96 & p96<=1] & [1<=p119 & p119<=1]]]] | [[[[p115<=1 & 1<=p115] & [p97<=1 & 1<=p97]] & [[1<=p72 & p72<=1] & [1<=p92 & p92<=1]]] & [[[1<=p13 & p13<=1] & [1<=p15 & p15<=1]] & [[1<=p35 & p35<=1] & [1<=p47 & p47<=1]]]]]] & ~ [EG [~ [EG [[[[[p61<=1 & 1<=p61] & [p49<=1 & 1<=p49]] & [[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]]] & [[[p87<=1 & 1<=p87] & [p76<=1 & 1<=p76]] & [[p114<=1 & 1<=p114] & [p97<=1 & 1<=p97]]]]]]]]] | [[E [true U [[[[p114<=1 & 1<=p114] & [p97<=1 & 1<=p97]] & [[1<=p74 & p74<=1] & [1<=p89 & p89<=1]]] & [[[1<=p15 & p15<=1] & [1<=p13 & p13<=1]] & [[1<=p49 & p49<=1] & [1<=p61 & p61<=1]]]]] | [[1<=p26 & p26<=1] & [1<=p75 & p75<=1]]] & EX [E [true U ~ [EX [~ [[[[[1<=p115 & p115<=1] & [1<=p96 & p96<=1]] & [[p89<=1 & 1<=p89] & [p77<=1 & 1<=p77]]] & [[[p47<=1 & 1<=p47] & [p35<=1 & 1<=p35]] & [[p15<=1 & 1<=p15] & [p13<=1 & 1<=p13]]]]]]]]]]] U EG [[[[[1<=p15 & p15<=1] & [1<=p13 & p13<=1]] & [[p47<=1 & 1<=p47] & [1<=p35 & p35<=1]]] & [[[p96<=1 & 1<=p96] & [p114<=1 & 1<=p114]] & [[p92<=1 & 1<=p92] & [p71<=1 & 1<=p71]]]]]]

abstracting: (1<=p71)
states: 9,671,602,176 (9)
abstracting: (p71<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p92)
states: 17,139,686,400 (10)
abstracting: (p92<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p114)
states: 15,042,723,840 (10)
abstracting: (p114<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
.
EG iterations: 1
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p77)
states: 9,964,062,720 (9)
abstracting: (p77<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p89)
states: 106,350,520,320 (11)
abstracting: (p89<=1)
states: 279,940,792,321 (11)
abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (p115<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p115)
states: 15,042,723,840 (10)
..abstracting: (p75<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p75)
states: 9,671,602,176 (9)
abstracting: (p26<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p26)
states: 139,970,396,160 (11)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p89<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p89)
states: 106,350,520,320 (11)
abstracting: (p74<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p74)
states: 9,671,602,176 (9)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p114)
states: 15,042,723,840 (10)
abstracting: (p114<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p114)
states: 15,042,723,840 (10)
abstracting: (p114<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p76)
states: 9,964,062,720 (9)
abstracting: (p76<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p87)
states: 17,139,686,400 (10)
abstracting: (p87<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p49)
states: 6,788,358,144 (9)
abstracting: (p49<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p61)
states: 45,528,477,696 (10)
abstracting: (p61<=1)
states: 279,940,792,321 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
abstracting: (p92<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p92)
states: 17,139,686,400 (10)
abstracting: (p72<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p72)
states: 9,671,602,176 (9)
abstracting: (1<=p97)
states: 108,945,773,568 (11)
abstracting: (p97<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p115)
states: 15,042,723,840 (10)
abstracting: (p115<=1)
states: 279,940,792,321 (11)
abstracting: (p119<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p119)
states: 14,572,265,472 (10)
abstracting: (p96<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p96)
states: 108,945,773,568 (11)
abstracting: (p89<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p89)
states: 106,350,520,320 (11)
abstracting: (p64<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p64)
states: 20,683,081,728 (10)
abstracting: (p47<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p47)
states: 45,528,477,696 (10)
abstracting: (p35<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p35)
states: 6,788,358,144 (9)
abstracting: (p15<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p15)
states: 142,234,560,000 (11)
abstracting: (p13<=1)
states: 279,940,792,321 (11)
abstracting: (1<=p13)
states: 161,925,166,080 (11)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.569sec

totally nodes used: 14976078 (1.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 110068932 249298620 359367552
used/not used/entry size/cache size: 65244744 1864120 16 1024MB
basic ops cache: hits/miss/sum: 9944638 13254885 23199523
used/not used/entry size/cache size: 12372477 4404739 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 63670 177299 240969
used/not used/entry size/cache size: 175476 8213132 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 54574078
1 10476458
2 1728042
3 283844
4 40778
5 5148
6 465
7 46
8 5
9 0
>= 10 0

Total processing time: 1m27.724sec


BK_STOP 1678492751364

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.009sec

19702 25607 24863 27040 23168 43086 40747
iterations count:730618 (392), effective:9377 (5)

initing FirstDep: 0m 0.004sec

15073 22891 16773 19982 18657 24235
iterations count:615039 (330), effective:7959 (4)

iterations count:1937 (1), effective:1 (0)

iterations count:1860 (1), effective:0 (0)
14516 24433 22773 22767 20920
iterations count:563429 (302), effective:6936 (3)

iterations count:2139 (1), effective:1 (0)
12313 18998 23314
iterations count:340095 (182), effective:5468 (2)

iterations count:1860 (1), effective:0 (0)
18786 30171 27947 27658 27660 27640
iterations count:613729 (329), effective:7223 (3)
13860 27471 23959 24273 23818 25702
iterations count:639292 (343), effective:7997 (4)
14966 24962 18858 20926 20283 24465
iterations count:605274 (325), effective:7446 (4)
18663 27958
iterations count:252091 (135), effective:4964 (2)

iterations count:1860 (1), effective:0 (0)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-PT-none"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is EnergyBus-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856800130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;