Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399200301.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V80P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399200301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 17K Apr 13 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 298K Apr 13 01:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 13 01:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 399K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Apr 13 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K Apr 13 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 596K Apr 13 01:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 01:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717222237762

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:10:39] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-06-01 06:10:39] [INFO ] Transformed 188 places.
[2024-06-01 06:10:39] [INFO ] Transformed 2108 transitions.
[2024-06-01 06:10:39] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 12
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 1, 80, 0, 50, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 1, 80, 0, 50, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:10:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-06-01 06:10:39] [INFO ] Computed 7 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 80, 0, 50, 1, 0, 0] Max Struct:[80, 50, 50, 80, 2, 80, 2, 50, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-08 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 246 ms. (40 steps per ms)
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (22 resets) in 174 ms. (228 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 6, 1, 1] Max Struct:[50, 50, 2, 2]
[2024-06-01 06:10:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:10:40] [INFO ] Invariant cache hit.
[2024-06-01 06:10:40] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2024-06-01 06:10:40] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-06-01 06:10:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:10:40] [INFO ] [Real]Added 22 Read/Feed constraints in 49 ms returned sat
[2024-06-01 06:10:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:10:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:10:40] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 06:10:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 81 ms returned sat
[2024-06-01 06:10:41] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 105 ms.
[2024-06-01 06:10:41] [INFO ] Added : 10 causal constraints over 2 iterations in 319 ms. Result :sat
Minimization took 232 ms.
[2024-06-01 06:10:41] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:10:41] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 06:10:41] [INFO ] [Real]Added 22 Read/Feed constraints in 17 ms returned sat
[2024-06-01 06:10:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:10:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:10:41] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 06:10:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 66 ms returned sat
[2024-06-01 06:10:42] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 19 ms to minimize.
[2024-06-01 06:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2024-06-01 06:10:42] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 122 ms.
[2024-06-01 06:10:42] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-06-01 06:10:42] [INFO ] Added : 3 causal constraints over 2 iterations in 480 ms. Result :sat
Minimization took 334 ms.
[2024-06-01 06:10:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-06-01 06:10:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 6, 1, 1] Max Struct:[50, 50, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 6] Max Struct:[50, 50]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 347 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-06-01 06:10:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:10:44] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 06:10:44] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 06:11:10] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 06:11:39] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 55186ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 55237ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 186/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 155 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55774 ms. Remains : 186/188 places, 2028/2108 transitions.
[2024-06-01 06:11:40] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-06-01 06:11:40] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 6] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1423 resets) in 6084 ms. (164 steps per ms)
BEST_FIRST walk for 2000010 steps (1083 resets) in 4246 ms. (470 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-06-01 06:11:50] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:11:50] [INFO ] Invariant cache hit.
[2024-06-01 06:11:50] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:11:50] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-01 06:11:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:11:50] [INFO ] [Real]Added 21 Read/Feed constraints in 24 ms returned sat
[2024-06-01 06:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:11:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:11:50] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 06:11:50] [INFO ] [Nat]Added 21 Read/Feed constraints in 88 ms returned sat
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 2 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2024-06-01 06:11:51] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 99 ms.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 3 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2024-06-01 06:11:51] [INFO ] Added : 10 causal constraints over 2 iterations in 726 ms. Result :sat
Minimization took 238 ms.
[2024-06-01 06:11:52] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:11:52] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-01 06:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:11:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:11:52] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-01 06:11:52] [INFO ] [Nat]Added 21 Read/Feed constraints in 46 ms returned sat
[2024-06-01 06:11:52] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 82 ms.
[2024-06-01 06:11:53] [INFO ] Added : 7 causal constraints over 7 iterations in 482 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 127 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 186/186 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 122 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:11:53] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:11:53] [INFO ] Invariant cache hit.
[2024-06-01 06:11:54] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-01 06:11:54] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:11:54] [INFO ] Invariant cache hit.
[2024-06-01 06:11:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:11:55] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1911 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 177 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2217 ms. Remains : 184/186 places, 2028/2028 transitions.
[2024-06-01 06:11:56] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 06:11:56] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000001 steps (1424 resets) in 5710 ms. (175 steps per ms)
BEST_FIRST walk for 2000000 steps (1081 resets) in 4062 ms. (492 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-06-01 06:12:05] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:12:05] [INFO ] Invariant cache hit.
[2024-06-01 06:12:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:12:06] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-01 06:12:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:12:06] [INFO ] [Real]Added 21 Read/Feed constraints in 20 ms returned sat
[2024-06-01 06:12:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:12:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:12:06] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-01 06:12:06] [INFO ] [Nat]Added 21 Read/Feed constraints in 32 ms returned sat
[2024-06-01 06:12:06] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 57 ms.
[2024-06-01 06:12:06] [INFO ] Added : 10 causal constraints over 2 iterations in 324 ms. Result :sat
Minimization took 327 ms.
[2024-06-01 06:12:06] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:12:07] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 06:12:07] [INFO ] [Real]Added 21 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:12:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:12:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:12:07] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-01 06:12:07] [INFO ] [Nat]Added 21 Read/Feed constraints in 39 ms returned sat
[2024-06-01 06:12:07] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 59 ms.
[2024-06-01 06:12:07] [INFO ] Added : 11 causal constraints over 10 iterations in 324 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 125 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 138 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:12:08] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:12:08] [INFO ] Invariant cache hit.
[2024-06-01 06:12:09] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 06:12:09] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:12:09] [INFO ] Invariant cache hit.
[2024-06-01 06:12:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:12:10] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
[2024-06-01 06:12:10] [INFO ] Redundant transitions in 117 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:12:10] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:12:10] [INFO ] Invariant cache hit.
[2024-06-01 06:12:10] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:12:33] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 74190ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75891 ms. Remains : 184/184 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 1342 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40009 steps (20 resets) in 492 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (20 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 275243 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 4
Probabilistic random walk after 275243 steps, saw 75531 distinct states, run finished after 3004 ms. (steps per millisecond=91 ) properties seen :0
[2024-06-01 06:13:28] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:13:28] [INFO ] Invariant cache hit.
[2024-06-01 06:13:28] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 13/553 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 210 constraints, problems are : Problem set: 0 solved, 4 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3835 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4402ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3128 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 118 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:13:36] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:13:36] [INFO ] Invariant cache hit.
[2024-06-01 06:13:36] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:14:00] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54478ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54631 ms. Remains : 184/184 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 390 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40010 steps (20 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 255050 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 4
Probabilistic random walk after 255050 steps, saw 70244 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 06:14:34] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:14:34] [INFO ] Invariant cache hit.
[2024-06-01 06:14:34] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 13/553 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 210 constraints, problems are : Problem set: 0 solved, 4 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3956 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4585ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3436 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 144 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 148 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:14:42] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:14:42] [INFO ] Invariant cache hit.
[2024-06-01 06:14:42] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 06:14:42] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:14:42] [INFO ] Invariant cache hit.
[2024-06-01 06:14:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:14:43] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2024-06-01 06:14:43] [INFO ] Redundant transitions in 106 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:14:44] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:14:44] [INFO ] Invariant cache hit.
[2024-06-01 06:14:44] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:15:07] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 74163ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74195ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75793 ms. Remains : 184/184 places, 2028/2028 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 10] Max Struct:[50, 50]
Starting property specific reduction for BridgeAndVehicles-PT-V80P50N10-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-06-01 06:15:58] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:15:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (14 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-06-01 06:15:58] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:15:58] [INFO ] Invariant cache hit.
[2024-06-01 06:15:58] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:15:58] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 06:15:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:15:58] [INFO ] [Real]Added 21 Read/Feed constraints in 30 ms returned sat
[2024-06-01 06:15:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:15:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:15:58] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-01 06:15:58] [INFO ] [Nat]Added 21 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:15:58] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 59 ms.
[2024-06-01 06:15:59] [INFO ] Added : 10 causal constraints over 2 iterations in 345 ms. Result :sat
Minimization took 305 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 2027
Applied a total of 2 rules in 208 ms. Remains 183 /184 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:16:00] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 06:16:00] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:16:00] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:16:27] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55560ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55803 ms. Remains : 183/184 places, 2027/2028 transitions.
[2024-06-01 06:16:55] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:16:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (1643 resets) in 5853 ms. (170 steps per ms)
BEST_FIRST walk for 1000001 steps (695 resets) in 2405 ms. (415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-06-01 06:17:03] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:17:03] [INFO ] Invariant cache hit.
[2024-06-01 06:17:03] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2024-06-01 06:17:04] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-01 06:17:04] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:17:04] [INFO ] [Real]Added 21 Read/Feed constraints in 28 ms returned sat
[2024-06-01 06:17:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:17:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:17:04] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 06:17:04] [INFO ] [Nat]Added 21 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:17:04] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 55 ms.
[2024-06-01 06:17:04] [INFO ] Added : 10 causal constraints over 2 iterations in 271 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 169 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:17:05] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:17:05] [INFO ] Invariant cache hit.
[2024-06-01 06:17:05] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 06:17:05] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:17:05] [INFO ] Invariant cache hit.
[2024-06-01 06:17:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:17:06] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2024-06-01 06:17:06] [INFO ] Redundant transitions in 35 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:17:06] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:17:06] [INFO ] Invariant cache hit.
[2024-06-01 06:17:06] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:17:30] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 75354ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 75375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76763 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 881 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (25 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 237179 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 237179 steps, saw 66166 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 06:18:25] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:18:25] [INFO ] Invariant cache hit.
[2024-06-01 06:18:25] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/388 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:18:26] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-06-01 06:18:26] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/551 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2046ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 888 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 141 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:18:28] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:18:28] [INFO ] Invariant cache hit.
[2024-06-01 06:18:28] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:18:54] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 57597ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 57621ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57767 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 505 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (26 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40007 steps (24 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 283237 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 283237 steps, saw 78367 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 06:19:29] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:19:29] [INFO ] Invariant cache hit.
[2024-06-01 06:19:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/388 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:19:30] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:19:30] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/551 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1916ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 762 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 120 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 129 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:19:32] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:19:32] [INFO ] Invariant cache hit.
[2024-06-01 06:19:33] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-06-01 06:19:33] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:19:33] [INFO ] Invariant cache hit.
[2024-06-01 06:19:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:19:33] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2024-06-01 06:19:34] [INFO ] Redundant transitions in 55 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:19:34] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:19:34] [INFO ] Invariant cache hit.
[2024-06-01 06:19:34] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 76630ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 76659ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78039 ms. Remains : 183/183 places, 2027/2027 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-PT-V80P50N10-UpperBounds-02 in 292476 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V80P50N10-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-06-01 06:20:50] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 06:20:50] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (14 resets) in 70 ms. (140 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-06-01 06:20:50] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:20:50] [INFO ] Invariant cache hit.
[2024-06-01 06:20:50] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:20:50] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 06:20:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:20:50] [INFO ] [Real]Added 21 Read/Feed constraints in 14 ms returned sat
[2024-06-01 06:20:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:20:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:20:51] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 06:20:51] [INFO ] [Nat]Added 21 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:20:51] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 39 ms.
[2024-06-01 06:20:51] [INFO ] Added : 11 causal constraints over 10 iterations in 253 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 2027
Applied a total of 2 rules in 130 ms. Remains 183 /184 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:20:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 06:20:52] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 06:20:52] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:21:18] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55421ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55572 ms. Remains : 183/184 places, 2027/2028 transitions.
[2024-06-01 06:21:47] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:21:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (1643 resets) in 5232 ms. (191 steps per ms)
BEST_FIRST walk for 1000001 steps (670 resets) in 2081 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-06-01 06:21:54] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:21:54] [INFO ] Invariant cache hit.
[2024-06-01 06:21:54] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:21:54] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 06:21:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:21:54] [INFO ] [Real]Added 21 Read/Feed constraints in 15 ms returned sat
[2024-06-01 06:21:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:21:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:21:55] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-01 06:21:55] [INFO ] [Nat]Added 21 Read/Feed constraints in 27 ms returned sat
[2024-06-01 06:21:55] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 43 ms.
[2024-06-01 06:21:55] [INFO ] Added : 6 causal constraints over 6 iterations in 509 ms. Result :sat
Minimization took 195 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 172 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 169 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:21:56] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:21:56] [INFO ] Invariant cache hit.
[2024-06-01 06:21:56] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-01 06:21:56] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:21:56] [INFO ] Invariant cache hit.
[2024-06-01 06:21:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:21:58] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2024-06-01 06:21:58] [INFO ] Redundant transitions in 50 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:21:58] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:21:58] [INFO ] Invariant cache hit.
[2024-06-01 06:21:58] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:22:23] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 75551ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 75572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77916 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 534 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40010 steps (24 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (24 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 311343 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 311343 steps, saw 90632 distinct states, run finished after 3014 ms. (steps per millisecond=103 ) properties seen :0
[2024-06-01 06:23:17] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:23:17] [INFO ] Invariant cache hit.
[2024-06-01 06:23:17] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:23:17] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 115/388 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/551 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1585ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 117 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:23:19] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:23:19] [INFO ] Invariant cache hit.
[2024-06-01 06:23:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:23:43] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55127ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55267 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 471 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40011 steps (24 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 284945 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 284945 steps, saw 83752 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 06:24:17] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:24:17] [INFO ] Invariant cache hit.
[2024-06-01 06:24:17] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:24:17] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 115/388 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/551 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1822ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 355 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 139 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 145 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:24:20] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:24:20] [INFO ] Invariant cache hit.
[2024-06-01 06:24:20] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-01 06:24:20] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:24:20] [INFO ] Invariant cache hit.
[2024-06-01 06:24:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:24:22] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2210 ms to find 0 implicit places.
[2024-06-01 06:24:22] [INFO ] Redundant transitions in 59 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:24:22] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:24:22] [INFO ] Invariant cache hit.
[2024-06-01 06:24:22] [INFO ] State equation strengthened by 21 read => feed constraints.
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 : BridgeAndVehicles-PT-V80P50N10-UpperBounds-00
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-01
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-02
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-03
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-04
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-05
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-06
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-07
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-08
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-09
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-10
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-11
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-12
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-13
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-14
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-UpperBounds-15

BK_STOP 1717223070644

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-00
ub formula formula --maxsum=/tmp/873/ub_0_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-01
ub formula formula --maxsum=/tmp/873/ub_1_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-02
ub formula formula --maxsum=/tmp/873/ub_2_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-03
ub formula formula --maxsum=/tmp/873/ub_3_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-04
ub formula formula --maxsum=/tmp/873/ub_4_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-05
ub formula formula --maxsum=/tmp/873/ub_5_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-06
ub formula formula --maxsum=/tmp/873/ub_6_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-07
ub formula formula --maxsum=/tmp/873/ub_7_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-08
ub formula formula --maxsum=/tmp/873/ub_8_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-09
ub formula formula --maxsum=/tmp/873/ub_9_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-10
ub formula formula --maxsum=/tmp/873/ub_10_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-11
ub formula formula --maxsum=/tmp/873/ub_11_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-12
ub formula formula --maxsum=/tmp/873/ub_12_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-13
ub formula formula --maxsum=/tmp/873/ub_13_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-14
ub formula formula --maxsum=/tmp/873/ub_14_
ub formula name BridgeAndVehicles-PT-V80P50N10-UpperBounds-15
ub formula formula --maxsum=/tmp/873/ub_15_
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="BridgeAndVehicles-PT-V80P50N10"
export BK_EXAMINATION="UpperBounds"
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 BridgeAndVehicles-PT-V80P50N10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399200301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N10.tgz
mv BridgeAndVehicles-PT-V80P50N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;