Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266400218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r492-smll-171636266400218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 18:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.2M May 18 16:42 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-2024-00
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-01
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-02
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-03
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-04
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-05
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-06
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-07
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-08
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-09
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-10
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2024-11
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2023-12
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2023-13
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2023-14
FORMULA_NAME EnergyBus-PT-none-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717238188226

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:36:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:36:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:36:30] [INFO ] Load time of PNML (sax parser for PT used): 589 ms
[2024-06-01 10:36:30] [INFO ] Transformed 157 places.
[2024-06-01 10:36:30] [INFO ] Transformed 4430 transitions.
[2024-06-01 10:36:30] [INFO ] Found NUPN structural information;
[2024-06-01 10:36:30] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 798 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 127 ms.
Deduced a syphon composed of 4 places in 27 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
Support contains 41 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 133 transition count 1876
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 133 transition count 1876
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 133 transition count 1873
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 133 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 132 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 132 transition count 1864
Applied a total of 53 rules in 115 ms. Remains 132 /153 variables (removed 21) and now considering 1864/1913 (removed 49) transitions.
[2024-06-01 10:36:31] [INFO ] Flow matrix only has 606 transitions (discarded 1258 similar events)
// Phase 1: matrix 606 rows 132 cols
[2024-06-01 10:36:31] [INFO ] Computed 23 invariants in 21 ms
[2024-06-01 10:36:31] [INFO ] Implicit Places using invariants in 356 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 519 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/153 places, 1864/1913 transitions.
Applied a total of 0 rules in 15 ms. Remains 131 /131 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 674 ms. Remains : 131/153 places, 1864/1913 transitions.
Support contains 41 out of 131 places after structural reductions.
[2024-06-01 10:36:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 10:36:32] [INFO ] Flatten gal took : 474 ms
FORMULA EnergyBus-PT-none-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:36:32] [INFO ] Flatten gal took : 279 ms
[2024-06-01 10:36:33] [INFO ] Input system was already deterministic with 1864 transitions.
RANDOM walk for 40000 steps (8 resets) in 3781 ms. (10 steps per ms) remains 72/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 72/72 properties
[2024-06-01 10:36:35] [INFO ] Flow matrix only has 606 transitions (discarded 1258 similar events)
// Phase 1: matrix 606 rows 131 cols
[2024-06-01 10:36:35] [INFO ] Computed 22 invariants in 10 ms
[2024-06-01 10:36:35] [INFO ] State equation strengthened by 461 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 43/80 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 68 unsolved
[2024-06-01 10:36:39] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 12 ms to minimize.
Problem AtomicPropp75 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/9 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 38/118 variables, 12/21 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 10/128 variables, 2/23 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 603/731 variables, 128/151 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 460/611 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 731/737 variables, and 611 constraints, problems are : Problem set: 5 solved, 67 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/131 constraints, ReadFeed: 460/461 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 44/80 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 38/118 variables, 12/21 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 10/128 variables, 2/23 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 603/731 variables, 128/151 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 460/611 constraints. Problems are: Problem set: 8 solved, 64 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 731/737 variables, and 611 constraints, problems are : Problem set: 8 solved, 64 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/131 constraints, ReadFeed: 460/461 constraints, PredecessorRefiner: 0/72 constraints, Known Traps: 1/1 constraints]
After SMT, in 12482ms problems are : Problem set: 8 solved, 64 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 54 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 736 edges and 125 vertex of which 122 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.37 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 122 transition count 1835
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 118 transition count 1835
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 118 transition count 1832
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 115 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 114 transition count 1830
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 114 transition count 1830
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 38 place count 105 transition count 1821
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 105 transition count 1819
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 100 transition count 1828
Drop transitions (Empty/Sink Transition effects.) 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 58 place count 100 transition count 1820
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 138 place count 100 transition count 1740
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 142 place count 98 transition count 1738
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 145 place count 96 transition count 1737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 146 place count 95 transition count 1737
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 146 place count 95 transition count 1734
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 152 place count 92 transition count 1734
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 154 place count 92 transition count 1732
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 157 place count 90 transition count 1731
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 158 place count 90 transition count 1730
Applied a total of 158 rules in 2081 ms. Remains 90 /131 variables (removed 41) and now considering 1730/1864 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2082 ms. Remains : 90/131 places, 1730/1864 transitions.
RANDOM walk for 40000 steps (8 resets) in 2043 ms. (19 steps per ms) remains 62/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
Interrupted probabilistic random walk after 94477 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 61
Probabilistic random walk after 94477 steps, saw 50460 distinct states, run finished after 3014 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 10:36:54] [INFO ] Flow matrix only has 524 transitions (discarded 1206 similar events)
// Phase 1: matrix 524 rows 90 cols
[2024-06-01 10:36:54] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 10:36:54] [INFO ] State equation strengthened by 456 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 27/62 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 25/87 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 523/611 variables, 88/107 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 455/562 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 3/614 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/614 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 565 constraints, problems are : Problem set: 0 solved, 61 unsolved in 12913 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 27/62 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 25/87 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 10:37:09] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 523/611 variables, 88/108 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 455/563 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/611 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 3/614 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 61/627 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/614 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 15 (OVERLAPS) 0/614 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 627 constraints, problems are : Problem set: 0 solved, 61 unsolved in 39582 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints]
After SMT, in 54047ms problems are : Problem set: 0 solved, 61 unsolved
Parikh walk visited 0 properties in 9122 ms.
Support contains 35 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1730/1730 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 1729
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 1729
Applied a total of 2 rules in 361 ms. Remains 89 /90 variables (removed 1) and now considering 1729/1730 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 89/90 places, 1729/1730 transitions.
RANDOM walk for 40000 steps (8 resets) in 2406 ms. (16 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
Interrupted probabilistic random walk after 77852 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 59
Probabilistic random walk after 77852 steps, saw 41978 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-06-01 10:38:02] [INFO ] Flow matrix only has 523 transitions (discarded 1206 similar events)
// Phase 1: matrix 523 rows 89 cols
[2024-06-01 10:38:02] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 10:38:02] [INFO ] State equation strengthened by 456 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 26/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 25/86 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 10:38:05] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/87 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 522/609 variables, 87/107 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 455/562 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 3/612 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/612 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (OVERLAPS) 0/612 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 565 constraints, problems are : Problem set: 0 solved, 59 unsolved in 12578 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 26/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 25/86 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/87 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 522/609 variables, 87/107 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 455/562 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 3/612 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/612 variables, 59/624 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 15 (OVERLAPS) 0/612 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 624 constraints, problems are : Problem set: 0 solved, 59 unsolved in 31499 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 45642ms problems are : Problem set: 0 solved, 59 unsolved
Parikh walk visited 0 properties in 8046 ms.
Support contains 35 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1729/1729 transitions.
Applied a total of 0 rules in 297 ms. Remains 89 /89 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 89/89 places, 1729/1729 transitions.
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
FORMULA EnergyBus-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:38:56] [INFO ] Flatten gal took : 223 ms
[2024-06-01 10:38:57] [INFO ] Flatten gal took : 227 ms
[2024-06-01 10:38:57] [INFO ] Input system was already deterministic with 1864 transitions.
Computed a total of 3 stabilizing places and 130 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1252
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1252
Applied a total of 16 rules in 26 ms. Remains 123 /131 variables (removed 8) and now considering 1252/1864 (removed 612) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 123/131 places, 1252/1864 transitions.
[2024-06-01 10:38:58] [INFO ] Flatten gal took : 114 ms
[2024-06-01 10:38:58] [INFO ] Flatten gal took : 157 ms
[2024-06-01 10:38:58] [INFO ] Input system was already deterministic with 1252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 125 transition count 1444
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 125 transition count 1444
Applied a total of 12 rules in 15 ms. Remains 125 /131 variables (removed 6) and now considering 1444/1864 (removed 420) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 125/131 places, 1444/1864 transitions.
[2024-06-01 10:38:59] [INFO ] Flatten gal took : 136 ms
[2024-06-01 10:38:59] [INFO ] Flatten gal took : 218 ms
[2024-06-01 10:38:59] [INFO ] Input system was already deterministic with 1444 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1188
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1188
Applied a total of 16 rules in 12 ms. Remains 123 /131 variables (removed 8) and now considering 1188/1864 (removed 676) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 123/131 places, 1188/1864 transitions.
[2024-06-01 10:38:59] [INFO ] Flatten gal took : 103 ms
[2024-06-01 10:38:59] [INFO ] Flatten gal took : 110 ms
[2024-06-01 10:38:59] [INFO ] Input system was already deterministic with 1188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1252
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1252
Applied a total of 16 rules in 12 ms. Remains 123 /131 variables (removed 8) and now considering 1252/1864 (removed 612) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 123/131 places, 1252/1864 transitions.
[2024-06-01 10:39:00] [INFO ] Flatten gal took : 98 ms
[2024-06-01 10:39:00] [INFO ] Flatten gal took : 106 ms
[2024-06-01 10:39:00] [INFO ] Input system was already deterministic with 1252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 1556
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 1556
Applied a total of 10 rules in 16 ms. Remains 126 /131 variables (removed 5) and now considering 1556/1864 (removed 308) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 126/131 places, 1556/1864 transitions.
[2024-06-01 10:39:00] [INFO ] Flatten gal took : 124 ms
[2024-06-01 10:39:00] [INFO ] Flatten gal took : 134 ms
[2024-06-01 10:39:00] [INFO ] Input system was already deterministic with 1556 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 1604
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 1604
Applied a total of 10 rules in 22 ms. Remains 126 /131 variables (removed 5) and now considering 1604/1864 (removed 260) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 126/131 places, 1604/1864 transitions.
[2024-06-01 10:39:01] [INFO ] Flatten gal took : 127 ms
[2024-06-01 10:39:01] [INFO ] Flatten gal took : 137 ms
[2024-06-01 10:39:01] [INFO ] Input system was already deterministic with 1604 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 63 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 121 transition count 1844
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 117 transition count 1844
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 115 transition count 1588
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 115 transition count 1588
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 109 transition count 1582
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 44 place count 109 transition count 1571
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 109 transition count 1570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 108 transition count 1570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 46 place count 108 transition count 1568
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 50 place count 106 transition count 1568
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 56 place count 103 transition count 1565
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 103 transition count 1562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 102 transition count 1562
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 64 place count 100 transition count 1560
Applied a total of 64 rules in 1457 ms. Remains 100 /131 variables (removed 31) and now considering 1560/1864 (removed 304) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1457 ms. Remains : 100/131 places, 1560/1864 transitions.
[2024-06-01 10:39:02] [INFO ] Flatten gal took : 96 ms
[2024-06-01 10:39:03] [INFO ] Flatten gal took : 107 ms
[2024-06-01 10:39:03] [INFO ] Input system was already deterministic with 1560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 66 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 121 transition count 1845
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 118 transition count 1845
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 115 transition count 1667
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 115 transition count 1667
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 33 place count 109 transition count 1661
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 46 place count 109 transition count 1648
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 109 transition count 1647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 108 transition count 1647
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 48 place count 108 transition count 1645
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 52 place count 106 transition count 1645
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 62 place count 101 transition count 1640
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 101 transition count 1637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 100 transition count 1637
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 70 place count 98 transition count 1635
Applied a total of 70 rules in 1070 ms. Remains 98 /131 variables (removed 33) and now considering 1635/1864 (removed 229) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1070 ms. Remains : 98/131 places, 1635/1864 transitions.
[2024-06-01 10:39:04] [INFO ] Flatten gal took : 86 ms
[2024-06-01 10:39:04] [INFO ] Flatten gal took : 97 ms
[2024-06-01 10:39:04] [INFO ] Input system was already deterministic with 1635 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 125 transition count 1492
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 125 transition count 1492
Applied a total of 12 rules in 14 ms. Remains 125 /131 variables (removed 6) and now considering 1492/1864 (removed 372) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 125/131 places, 1492/1864 transitions.
[2024-06-01 10:39:04] [INFO ] Flatten gal took : 117 ms
[2024-06-01 10:39:05] [INFO ] Flatten gal took : 127 ms
[2024-06-01 10:39:05] [INFO ] Input system was already deterministic with 1492 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 124 transition count 1316
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 124 transition count 1316
Applied a total of 14 rules in 12 ms. Remains 124 /131 variables (removed 7) and now considering 1316/1864 (removed 548) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 124/131 places, 1316/1864 transitions.
[2024-06-01 10:39:05] [INFO ] Flatten gal took : 103 ms
[2024-06-01 10:39:05] [INFO ] Flatten gal took : 111 ms
[2024-06-01 10:39:05] [INFO ] Input system was already deterministic with 1316 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 58 edges and 131 vertex of which 7 / 131 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 127 transition count 1852
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 123 transition count 1852
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 123 transition count 1850
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 121 transition count 1850
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 118 transition count 1672
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 118 transition count 1672
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 31 place count 112 transition count 1666
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 44 place count 112 transition count 1653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 112 transition count 1652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 111 transition count 1652
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 46 place count 111 transition count 1650
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 50 place count 109 transition count 1650
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 56 place count 106 transition count 1647
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 106 transition count 1644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 105 transition count 1644
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 64 place count 103 transition count 1642
Applied a total of 64 rules in 1050 ms. Remains 103 /131 variables (removed 28) and now considering 1642/1864 (removed 222) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1050 ms. Remains : 103/131 places, 1642/1864 transitions.
[2024-06-01 10:39:06] [INFO ] Flatten gal took : 94 ms
[2024-06-01 10:39:06] [INFO ] Flatten gal took : 115 ms
[2024-06-01 10:39:07] [INFO ] Input system was already deterministic with 1642 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 124 transition count 1364
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 124 transition count 1364
Applied a total of 14 rules in 12 ms. Remains 124 /131 variables (removed 7) and now considering 1364/1864 (removed 500) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 124/131 places, 1364/1864 transitions.
[2024-06-01 10:39:07] [INFO ] Flatten gal took : 107 ms
[2024-06-01 10:39:07] [INFO ] Flatten gal took : 116 ms
[2024-06-01 10:39:07] [INFO ] Input system was already deterministic with 1364 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Graph (trivial) has 77 edges and 131 vertex of which 10 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 125 transition count 1848
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 1848
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 121 transition count 1843
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 116 transition count 1843
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 25 place count 110 transition count 1345
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 110 transition count 1345
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 104 transition count 1339
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 104 transition count 1325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 104 transition count 1324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 103 transition count 1324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 59 place count 103 transition count 1322
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 63 place count 101 transition count 1322
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 73 place count 96 transition count 1317
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 96 transition count 1314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 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 81 place count 93 transition count 1312
Applied a total of 81 rules in 723 ms. Remains 93 /131 variables (removed 38) and now considering 1312/1864 (removed 552) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 724 ms. Remains : 93/131 places, 1312/1864 transitions.
[2024-06-01 10:39:08] [INFO ] Flatten gal took : 68 ms
[2024-06-01 10:39:08] [INFO ] Flatten gal took : 76 ms
[2024-06-01 10:39:08] [INFO ] Input system was already deterministic with 1312 transitions.
RANDOM walk for 40000 steps (8 resets) in 574 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 430488 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 430488 steps, saw 182549 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-06-01 10:39:11] [INFO ] Flow matrix only has 363 transitions (discarded 949 similar events)
// Phase 1: matrix 363 rows 93 cols
[2024-06-01 10:39:11] [INFO ] Computed 21 invariants in 8 ms
[2024-06-01 10:39:11] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/82 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/87 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 358/445 variables, 87/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 150/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/455 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 133/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/456 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 398 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/82 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/87 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 358/445 variables, 87/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 150/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/455 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 133/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/456 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/456 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 967ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 280 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 (Empty/Sink Transition effects.) 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 (Empty/Sink Transition effects.) 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 (Redundant composition of simpler 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 1 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 658 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 658 ms. Remains : 72/93 places, 1286/1312 transitions.
RANDOM walk for 4000000 steps (8 resets) in 72037 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 5172 ms. (773 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 684128 steps, run visited all 1 properties in 5024 ms. (steps per millisecond=136 )
Probabilistic random walk after 684128 steps, saw 318584 distinct states, run finished after 5030 ms. (steps per millisecond=136 ) properties seen :1
FORMULA EnergyBus-PT-none-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 1864/1864 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 1236
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 1236
Applied a total of 16 rules in 13 ms. Remains 123 /131 variables (removed 8) and now considering 1236/1864 (removed 628) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 123/131 places, 1236/1864 transitions.
[2024-06-01 10:39:38] [INFO ] Flatten gal took : 99 ms
[2024-06-01 10:39:38] [INFO ] Flatten gal took : 108 ms
[2024-06-01 10:39:38] [INFO ] Input system was already deterministic with 1236 transitions.
[2024-06-01 10:39:39] [INFO ] Flatten gal took : 166 ms
[2024-06-01 10:39:39] [INFO ] Flatten gal took : 173 ms
[2024-06-01 10:39:39] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 22 ms.
[2024-06-01 10:39:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 1864 transitions and 25942 arcs took 35 ms.
Total runtime 189405 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-00
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-01
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-03
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-04
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-05
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-06
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-07
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-08
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-09
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-10
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2024-11
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2023-12
Could not compute solution for formula : EnergyBus-PT-none-CTLFireability-2023-15

BK_STOP 1717238379870

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name EnergyBus-PT-none-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/558/ctl_0_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/558/ctl_1_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/558/ctl_2_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/558/ctl_3_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/558/ctl_4_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/558/ctl_5_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/558/ctl_6_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/558/ctl_7_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/558/ctl_8_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/558/ctl_9_
ctl formula name EnergyBus-PT-none-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/558/ctl_10_
ctl formula name EnergyBus-PT-none-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/558/ctl_11_
ctl formula name EnergyBus-PT-none-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/558/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r492-smll-171636266400218"
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 ;