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-171636266400222.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400222
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717238602082

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
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:43:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:43:25] [INFO ] Load time of PNML (sax parser for PT used): 727 ms
[2024-06-01 10:43:25] [INFO ] Transformed 157 places.
[2024-06-01 10:43:25] [INFO ] Transformed 4430 transitions.
[2024-06-01 10:43:25] [INFO ] Found NUPN structural information;
[2024-06-01 10:43:25] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 990 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 48 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 5041 ms. (7 steps per ms) remains 7/13 properties
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1040 ms. (38 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 442 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 322 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
[2024-06-01 10:43:27] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2024-06-01 10:43:27] [INFO ] Computed 23 invariants in 33 ms
[2024-06-01 10:43:28] [INFO ] State equation strengthened by 463 read => feed constraints.
Problem EnergyBus-PT-none-ReachabilityCardinality-2024-06 is UNSAT
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem EnergyBus-PT-none-ReachabilityCardinality-2024-08 is UNSAT
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 74/132 variables, 18/76 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 74/150 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 7/139 variables, 3/153 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 7/160 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/148 variables, 2/162 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 9/171 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 640/788 variables, 148/319 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/788 variables, 239/558 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/788 variables, 0/558 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 10/798 variables, 4/562 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 4/566 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/798 variables, 223/789 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/798 variables, 0/789 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/799 variables, 1/790 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/799 variables, 1/791 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/799 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1/800 variables, 1/792 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/800 variables, 0/792 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/800 variables, 0/792 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 792 constraints, problems are : Problem set: 2 solved, 5 unsolved in 3959 ms.
Refiners :[Domain max(s): 153/153 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 153/153 constraints, ReadFeed: 463/463 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 84/132 variables, 18/66 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 84/150 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 10:43:33] [INFO ] Deduced a trap composed of 9 places in 709 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/151 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/139 variables, 3/154 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 7/161 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 9/148 variables, 2/163 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 9/172 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 10:43:34] [INFO ] Deduced a trap composed of 18 places in 962 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 1/173 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 640/788 variables, 148/321 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 239/560 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 10/798 variables, 4/564 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/798 variables, 4/568 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/798 variables, 223/791 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/798 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 1/799 variables, 1/792 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/799 variables, 1/793 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/800 variables, and 798 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5089 ms.
Refiners :[Domain max(s): 153/153 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 153/153 constraints, ReadFeed: 462/463 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 9606ms problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 66 edges and 153 vertex of which 8 / 153 are part of one of the 3 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 429 transitions
Reduce isomorphic transitions removed 446 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 148 transition count 1466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 147 transition count 1466
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3 place count 147 transition count 1462
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 143 transition count 1462
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 23 place count 131 transition count 1122
Iterating global reduction 2 with 12 rules applied. Total rules applied 35 place count 131 transition count 1122
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 45 place count 126 transition count 1117
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 126 transition count 1116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 125 transition count 1120
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 125 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 4 with 71 rules applied. Total rules applied 120 place count 125 transition count 1048
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 125 transition count 1047
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 122 place count 124 transition count 1047
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 122 place count 124 transition count 1045
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 126 place count 122 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 121 transition count 1044
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 121 transition count 1044
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 130 place count 120 transition count 1043
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 138 place count 120 transition count 1035
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 146 place count 112 transition count 1035
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 148 place count 112 transition count 1033
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 149 place count 112 transition count 1032
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 150 place count 111 transition count 1032
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 152 place count 111 transition count 1032
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 153 place count 111 transition count 1032
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 154 place count 111 transition count 1031
Applied a total of 154 rules in 1873 ms. Remains 111 /153 variables (removed 42) and now considering 1031/1913 (removed 882) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1901 ms. Remains : 111/153 places, 1031/1913 transitions.
RANDOM walk for 40000 steps (8 resets) in 766 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 188986 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 5
Probabilistic random walk after 188986 steps, saw 107020 distinct states, run finished after 3016 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 10:43:42] [INFO ] Flow matrix only has 450 transitions (discarded 581 similar events)
// Phase 1: matrix 450 rows 111 cols
[2024-06-01 10:43:42] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 10:43:42] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 49/97 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/104 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/109 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 448/557 variables, 109/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 181/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/561 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 161/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/561 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 476 constraints, problems are : Problem set: 0 solved, 5 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 49/97 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:43:44] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 3 ms to minimize.
[2024-06-01 10:43:44] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 7/104 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 5/109 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:43:45] [INFO ] Deduced a trap composed of 10 places in 568 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 448/557 variables, 109/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 181/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/561 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 161/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:43:47] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/561 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 485 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4357 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 5461ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4468 ms.
Support contains 48 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 1031/1031 transitions.
Applied a total of 0 rules in 108 ms. Remains 111 /111 variables (removed 0) and now considering 1031/1031 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 111/111 places, 1031/1031 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 1031/1031 transitions.
Applied a total of 0 rules in 105 ms. Remains 111 /111 variables (removed 0) and now considering 1031/1031 (removed 0) transitions.
[2024-06-01 10:43:53] [INFO ] Flow matrix only has 450 transitions (discarded 581 similar events)
[2024-06-01 10:43:53] [INFO ] Invariant cache hit.
[2024-06-01 10:43:53] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 10:43:53] [INFO ] Flow matrix only has 450 transitions (discarded 581 similar events)
[2024-06-01 10:43:53] [INFO ] Invariant cache hit.
[2024-06-01 10:43:53] [INFO ] State equation strengthened by 342 read => feed constraints.
[2024-06-01 10:43:54] [INFO ] Implicit Places using invariants and state equation in 877 ms returned [19, 85]
[2024-06-01 10:43:54] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1119 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 110/111 places, 1031/1031 transitions.
Applied a total of 0 rules in 171 ms. Remains 110 /110 variables (removed 0) and now considering 1031/1031 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1395 ms. Remains : 110/111 places, 1031/1031 transitions.
RANDOM walk for 40000 steps (8 resets) in 653 ms. (61 steps per ms) remains 4/5 properties
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
[2024-06-01 10:43:54] [INFO ] Flow matrix only has 450 transitions (discarded 581 similar events)
// Phase 1: matrix 450 rows 110 cols
[2024-06-01 10:43:54] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 10:43:54] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 47/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/101 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 448/555 variables, 107/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 181/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/560 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 161/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/560 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 474 constraints, problems are : Problem set: 0 solved, 4 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 47/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:43:55] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/101 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:43:56] [INFO ] Deduced a trap composed of 7 places in 415 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/107 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 448/555 variables, 107/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 181/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/560 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 161/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:43:58] [INFO ] Deduced a trap composed of 10 places in 517 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/560 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 481 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3818 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 4799ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 8318 ms.
Support contains 45 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 1031/1031 transitions.
Graph (trivial) has 13 edges and 110 vertex of which 4 / 110 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 420 transitions
Reduce isomorphic transitions removed 424 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 106 transition count 605
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 106 transition count 605
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 35 place count 106 transition count 575
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 105 transition count 574
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 105 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 104 transition count 573
Applied a total of 39 rules in 110 ms. Remains 104 /110 variables (removed 6) and now considering 573/1031 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 104/110 places, 573/1031 transitions.
RANDOM walk for 40000 steps (8 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 253761 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 4
Probabilistic random walk after 253761 steps, saw 129713 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 10:44:11] [INFO ] Flow matrix only has 421 transitions (discarded 152 similar events)
// Phase 1: matrix 421 rows 104 cols
[2024-06-01 10:44:11] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 10:44:11] [INFO ] State equation strengthened by 321 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/90 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/97 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/101 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 419/520 variables, 101/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 170/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/525 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 151/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/525 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 447 constraints, problems are : Problem set: 0 solved, 4 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/90 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:44:12] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/97 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:44:12] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/101 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 419/520 variables, 101/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 170/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:44:13] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/525 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 151/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:44:13] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 2 ms to minimize.
[2024-06-01 10:44:14] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 2 ms to minimize.
[2024-06-01 10:44:14] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-06-01 10:44:14] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/525 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 458 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3585 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 4381ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2960 ms.
Support contains 43 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 573/573 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 571
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 571
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 101 transition count 569
Applied a total of 6 rules in 105 ms. Remains 101 /104 variables (removed 3) and now considering 569/573 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 101/104 places, 569/573 transitions.
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 383772 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 2
Probabilistic random walk after 383772 steps, saw 190487 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2024-06-01 10:44:21] [INFO ] Flow matrix only has 364 transitions (discarded 205 similar events)
// Phase 1: matrix 364 rows 101 cols
[2024-06-01 10:44:21] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 10:44:21] [INFO ] State equation strengthened by 269 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/94 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 362/460 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 144/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/465 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 125/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/465 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/94 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:44:22] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/98 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:44:22] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 362/460 variables, 98/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 144/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/465 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 125/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:44:23] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/465 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1902 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 2459ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 959 ms.
Support contains 43 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 569/569 transitions.
Applied a total of 0 rules in 64 ms. Remains 101 /101 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 101/101 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 569/569 transitions.
Applied a total of 0 rules in 64 ms. Remains 101 /101 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-06-01 10:44:25] [INFO ] Flow matrix only has 364 transitions (discarded 205 similar events)
[2024-06-01 10:44:25] [INFO ] Invariant cache hit.
[2024-06-01 10:44:25] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 10:44:25] [INFO ] Flow matrix only has 364 transitions (discarded 205 similar events)
[2024-06-01 10:44:25] [INFO ] Invariant cache hit.
[2024-06-01 10:44:25] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-06-01 10:44:26] [INFO ] Implicit Places using invariants and state equation in 757 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1012 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/101 places, 569/569 transitions.
Applied a total of 0 rules in 64 ms. Remains 100 /100 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1140 ms. Remains : 100/101 places, 569/569 transitions.
RANDOM walk for 40000 steps (8 resets) in 326 ms. (122 steps per ms) remains 1/2 properties
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
[2024-06-01 10:44:26] [INFO ] Flow matrix only has 364 transitions (discarded 205 similar events)
// Phase 1: matrix 364 rows 100 cols
[2024-06-01 10:44:26] [INFO ] Computed 21 invariants in 9 ms
[2024-06-01 10:44:26] [INFO ] State equation strengthened by 269 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/91 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/95 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/455 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 142/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/464 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 127/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/464 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 269/269 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/91 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:27] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/95 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:27] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 360/455 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 142/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/464 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 127/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/464 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 290 ms.
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 569/569 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 100 transition count 568
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 568
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 99 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 567
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 98 transition count 566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 97 transition count 566
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 97 transition count 566
Applied a total of 7 rules in 244 ms. Remains 97 /100 variables (removed 3) and now considering 566/569 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 97/100 places, 566/569 transitions.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 813932 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :0 out of 1
Probabilistic random walk after 813932 steps, saw 356803 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
[2024-06-01 10:44:31] [INFO ] Flow matrix only has 361 transitions (discarded 205 similar events)
// Phase 1: matrix 361 rows 97 cols
[2024-06-01 10:44:31] [INFO ] Computed 21 invariants in 5 ms
[2024-06-01 10:44:31] [INFO ] State equation strengthened by 271 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/83 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/92 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 357/449 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 144/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/458 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 127/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 271/271 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/83 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:32] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/88 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:32] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/92 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:33] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 357/449 variables, 92/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 144/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/458 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 127/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:34] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/458 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/458 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2135 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 289 ms.
Support contains 40 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 566/566 transitions.
Applied a total of 0 rules in 65 ms. Remains 97 /97 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 97/97 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 566/566 transitions.
Applied a total of 0 rules in 55 ms. Remains 97 /97 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-06-01 10:44:34] [INFO ] Flow matrix only has 361 transitions (discarded 205 similar events)
[2024-06-01 10:44:34] [INFO ] Invariant cache hit.
[2024-06-01 10:44:35] [INFO ] Implicit Places using invariants in 603 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 606 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/97 places, 566/566 transitions.
Applied a total of 0 rules in 39 ms. Remains 96 /96 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 700 ms. Remains : 96/97 places, 566/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 776461 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 776461 steps, saw 343233 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2024-06-01 10:44:38] [INFO ] Flow matrix only has 361 transitions (discarded 205 similar events)
// Phase 1: matrix 361 rows 96 cols
[2024-06-01 10:44:38] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 10:44:38] [INFO ] State equation strengthened by 270 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/82 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/91 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 357/448 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 143/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/457 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 127/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/457 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 386 constraints, problems are : Problem set: 0 solved, 1 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 270/270 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/82 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:39] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/91 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:39] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 357/448 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 143/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/457 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 127/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:44:40] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/457 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2095ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 214 ms.
Support contains 40 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 566/566 transitions.
Applied a total of 0 rules in 59 ms. Remains 96 /96 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 96/96 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 566/566 transitions.
Applied a total of 0 rules in 59 ms. Remains 96 /96 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-06-01 10:44:41] [INFO ] Flow matrix only has 361 transitions (discarded 205 similar events)
[2024-06-01 10:44:41] [INFO ] Invariant cache hit.
[2024-06-01 10:44:41] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 10:44:41] [INFO ] Flow matrix only has 361 transitions (discarded 205 similar events)
[2024-06-01 10:44:41] [INFO ] Invariant cache hit.
[2024-06-01 10:44:41] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-06-01 10:44:42] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2024-06-01 10:44:42] [INFO ] Redundant transitions in 64 ms returned []
Running 565 sub problems to find dead transitions.
[2024-06-01 10:44:42] [INFO ] Flow matrix only has 361 transitions (discarded 205 similar events)
[2024-06-01 10:44:42] [INFO ] Invariant cache hit.
[2024-06-01 10:44:42] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 10:44:52] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-06-01 10:44:52] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2024-06-01 10:44:52] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2024-06-01 10:44:52] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 361/457 variables, 96/120 constraints. Problems are: Problem set: 1 solved, 564 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 270/390 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/457 variables, and 390 constraints, problems are : Problem set: 1 solved, 564 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 18/20 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 5 (OVERLAPS) 361/457 variables, 96/120 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 270/390 constraints. Problems are: Problem set: 1 solved, 564 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 564/954 constraints. Problems are: Problem set: 1 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/457 variables, and 954 constraints, problems are : Problem set: 1 solved, 564 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 564/565 constraints, Known Traps: 4/4 constraints]
After SMT, in 64394ms problems are : Problem set: 1 solved, 564 unsolved
Search for dead transitions found 1 dead transitions in 64407ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/96 places, 565/566 transitions.
Applied a total of 0 rules in 34 ms. Remains 96 /96 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-06-01 10:45:46] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65585 ms. Remains : 96/96 places, 565/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 778287 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 778287 steps, saw 343934 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-06-01 10:45:49] [INFO ] Flow matrix only has 360 transitions (discarded 205 similar events)
// Phase 1: matrix 360 rows 96 cols
[2024-06-01 10:45:49] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 10:45:49] [INFO ] State equation strengthened by 269 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/82 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/91 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 356/447 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 142/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/456 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 127/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/456 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 385 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 269/269 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/82 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:45:50] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/91 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:45:50] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 356/447 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:45:51] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 3 ms to minimize.
[2024-06-01 10:45:51] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/456 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 127/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:45:51] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:45:52] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/456 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/456 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/456 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2245 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 367 ms.
Support contains 40 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 565/565 transitions.
Applied a total of 0 rules in 56 ms. Remains 96 /96 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 96/96 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 565/565 transitions.
Applied a total of 0 rules in 56 ms. Remains 96 /96 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-06-01 10:45:52] [INFO ] Flow matrix only has 360 transitions (discarded 205 similar events)
[2024-06-01 10:45:52] [INFO ] Invariant cache hit.
[2024-06-01 10:45:53] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 10:45:53] [INFO ] Flow matrix only has 360 transitions (discarded 205 similar events)
[2024-06-01 10:45:53] [INFO ] Invariant cache hit.
[2024-06-01 10:45:53] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-06-01 10:45:53] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2024-06-01 10:45:53] [INFO ] Redundant transitions in 112 ms returned []
Running 564 sub problems to find dead transitions.
[2024-06-01 10:45:54] [INFO ] Flow matrix only has 360 transitions (discarded 205 similar events)
[2024-06-01 10:45:54] [INFO ] Invariant cache hit.
[2024-06-01 10:45:54] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 564 unsolved
[2024-06-01 10:46:04] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 2 ms to minimize.
[2024-06-01 10:46:04] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2024-06-01 10:46:04] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-06-01 10:46:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (OVERLAPS) 360/456 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 564 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 269/389 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/456 variables, and 389 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (OVERLAPS) 360/456 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 269/389 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 564/953 constraints. Problems are: Problem set: 0 solved, 564 unsolved
[2024-06-01 10:46:57] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 954 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 5/5 constraints]
After SMT, in 64192ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 64204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65323 ms. Remains : 96/96 places, 565/565 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 12 edges and 96 vertex of which 2 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 422 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 94 transition count 355
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 4 place count 93 transition count 355
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 0 with 6 rules applied. Total rules applied 10 place count 90 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 29 place count 90 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 89 transition count 333
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 89 transition count 332
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 88 transition count 331
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 88 transition count 331
Applied a total of 34 rules in 55 ms. Remains 88 /96 variables (removed 8) and now considering 331/565 (removed 234) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 331 rows 88 cols
[2024-06-01 10:46:58] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 10:46:58] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:46:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 10:46:58] [INFO ] [Nat]Absence check using 17 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 10:46:58] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 10:46:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:46:58] [INFO ] After 106ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:46:58] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:46:59] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 833 ms.
[2024-06-01 10:46:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 10:46:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 565 transitions and 6908 arcs took 21 ms.
[2024-06-01 10:46:59] [INFO ] Flatten gal took : 286 ms
Total runtime 215490 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-ReachabilityCardinality-2024-02

BK_STOP 1717238820212

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/770/inv_0_
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-171636266400222"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;