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-171620399200277.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-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399200277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 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-V80P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717221774417

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-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:02:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:02:56] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-06-01 06:02:56] [INFO ] Transformed 188 places.
[2024-06-01 06:02:56] [INFO ] Transformed 2108 transitions.
[2024-06-01 06:02:56] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 12
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 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:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:02:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-06-01 06:02:56] [INFO ] Computed 7 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[80, 20, 80, 20, 80, 80, 2, 1, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 241 ms. (41 steps per ms)
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (11 resets) in 61 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 1] Max Struct:[20, 2]
[2024-06-01 06:02:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:02:56] [INFO ] Invariant cache hit.
[2024-06-01 06:02:56] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-01 06:02:57] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-01 06:02:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:02:57] [INFO ] [Real]Added 22 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:02:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:02:57] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 06:02:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 73 ms returned sat
[2024-06-01 06:02:57] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 143 ms.
[2024-06-01 06:02:58] [INFO ] Added : 10 causal constraints over 2 iterations in 380 ms. Result :sat
Minimization took 303 ms.
[2024-06-01 06:02:58] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 1] Max Struct:[20, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 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.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 523 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2024-06-01 06:02:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:02:59] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 06:02:59] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 06:03:23] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 06:03:52] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
Problem TDEAD1067 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1177 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 7 constraints, problems are : Problem set: 11 solved, 2093 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 2/2 constraints]
After SMT, in 54046ms problems are : Problem set: 11 solved, 2093 unsolved
Search for dead transitions found 11 dead transitions in 54118ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/188 places, 2096/2108 transitions.
Applied a total of 0 rules in 242 ms. Remains 185 /185 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54932 ms. Remains : 185/188 places, 2096/2108 transitions.
[2024-06-01 06:03:54] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:03:54] [INFO ] Computed 5 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 6656 ms. (150 steps per ms)
BEST_FIRST walk for 1000001 steps (696 resets) in 2505 ms. (399 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 06:04:03] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
[2024-06-01 06:04:03] [INFO ] Invariant cache hit.
[2024-06-01 06:04:03] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:04:03] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 06:04:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:04:03] [INFO ] [Real]Added 22 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:04:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:04:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:04:03] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-01 06:04:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 74 ms returned sat
[2024-06-01 06:04:03] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 71 ms.
[2024-06-01 06:04:03] [INFO ] Added : 10 causal constraints over 2 iterations in 189 ms. Result :sat
Minimization took 377 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2096/2096 transitions.
Applied a total of 0 rules in 174 ms. Remains 185 /185 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 185/185 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2096/2096 transitions.
Applied a total of 0 rules in 148 ms. Remains 185 /185 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2024-06-01 06:04:05] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
[2024-06-01 06:04:05] [INFO ] Invariant cache hit.
[2024-06-01 06:04:05] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-06-01 06:04:05] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
[2024-06-01 06:04:05] [INFO ] Invariant cache hit.
[2024-06-01 06:04:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:04:07] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1899 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2096/2096 transitions.
Applied a total of 0 rules in 174 ms. Remains 183 /183 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2222 ms. Remains : 183/185 places, 2096/2096 transitions.
[2024-06-01 06:04:07] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-06-01 06:04:07] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 5940 ms. (168 steps per ms)
BEST_FIRST walk for 1000000 steps (696 resets) in 2342 ms. (426 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 06:04:15] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
[2024-06-01 06:04:15] [INFO ] Invariant cache hit.
[2024-06-01 06:04:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:04:15] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-01 06:04:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:04:15] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:04:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:04:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:04:15] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-01 06:04:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 33 ms returned sat
[2024-06-01 06:04:16] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 3 ms to minimize.
[2024-06-01 06:04:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2024-06-01 06:04:16] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 68 ms.
[2024-06-01 06:04:16] [INFO ] Added : 11 causal constraints over 3 iterations in 430 ms. Result :sat
Minimization took 349 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2096/2096 transitions.
Applied a total of 0 rules in 185 ms. Remains 183 /183 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 183/183 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2096/2096 transitions.
Applied a total of 0 rules in 192 ms. Remains 183 /183 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2024-06-01 06:04:17] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
[2024-06-01 06:04:17] [INFO ] Invariant cache hit.
[2024-06-01 06:04:18] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-01 06:04:18] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
[2024-06-01 06:04:18] [INFO ] Invariant cache hit.
[2024-06-01 06:04:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:04:20] [INFO ] Implicit Places using invariants and state equation in 2479 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
[2024-06-01 06:04:20] [INFO ] Redundant transitions in 160 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 06:04:20] [INFO ] Flow matrix only has 369 transitions (discarded 1727 similar events)
[2024-06-01 06:04:20] [INFO ] Invariant cache hit.
[2024-06-01 06:04:20] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 06:04:43] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2024-06-01 06:04:59] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
Problem TDEAD1177 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1529 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/552 variables, and 7 constraints, problems are : Problem set: 33 solved, 2060 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2093/2093 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 33 solved, 2060 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 33 solved, 2060 unsolved
Problem TDEAD1540 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1925 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 2/7 constraints. Problems are: Problem set: 69 solved, 2024 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/552 variables, and 7 constraints, problems are : Problem set: 69 solved, 2024 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2093 constraints, Known Traps: 2/2 constraints]
After SMT, in 73357ms problems are : Problem set: 69 solved, 2024 unsolved
Search for dead transitions found 69 dead transitions in 73381ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/183 places, 2027/2096 transitions.
Applied a total of 0 rules in 123 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:05:34] [INFO ] Redundant transitions in 35 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76837 ms. Remains : 183/183 places, 2027/2096 transitions.
[2024-06-01 06:05:34] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 06:05:34] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 5574 ms. (179 steps per ms)
BEST_FIRST walk for 1000001 steps (695 resets) in 2411 ms. (414 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 06:05:42] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:05:42] [INFO ] Invariant cache hit.
[2024-06-01 06:05:42] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:05:42] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-01 06:05:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:05:42] [INFO ] [Real]Added 21 Read/Feed constraints in 16 ms returned sat
[2024-06-01 06:05:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:05:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:05:42] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 06:05:42] [INFO ] [Nat]Added 21 Read/Feed constraints in 34 ms returned sat
[2024-06-01 06:05:43] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2024-06-01 06:05:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-06-01 06:05:43] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 43 ms.
[2024-06-01 06:05:43] [INFO ] Added : 11 causal constraints over 3 iterations in 341 ms. Result :sat
Minimization took 364 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
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 150 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 151 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 150 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:05:44] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:05:44] [INFO ] Invariant cache hit.
[2024-06-01 06:05:44] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 06:05:44] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:05:44] [INFO ] Invariant cache hit.
[2024-06-01 06:05:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:05:45] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-06-01 06:05:45] [INFO ] Redundant transitions in 119 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:05:45] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:05:45] [INFO ] Invariant cache hit.
[2024-06-01 06:05:45] [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:06:10] [INFO ] Deduced a trap composed of 5 places in 254 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 30040 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 30037 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 76017ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 76044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77452 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 991 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (27 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (26 resets) in 457 ms. (87 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 285276 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 285276 steps, saw 78902 distinct states, run finished after 3004 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 06:07:05] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:07:05] [INFO ] Invariant cache hit.
[2024-06-01 06:07:05] [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:07:05] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2024-06-01 06:07:06] [INFO ] Deduced a trap composed of 4 places in 229 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
All remaining problems are real, not stopping.
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 850 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 2341 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 3213ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 326 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 156 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:07:09] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:07:09] [INFO ] Invariant cache hit.
[2024-06-01 06:07:09] [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:07:33] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 5 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 20031 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 20035 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 55556ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55749 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 412 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (25 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (27 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 283692 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 283692 steps, saw 78505 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 06:08:07] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:08:07] [INFO ] Invariant cache hit.
[2024-06-01 06:08:07] [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:08:08] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-06-01 06:08:08] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 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
All remaining problems are real, not stopping.
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 785 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 2348 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 3160ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 314 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 173 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 174 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 149 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:08:11] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:08:11] [INFO ] Invariant cache hit.
[2024-06-01 06:08:12] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 06:08:12] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:08:12] [INFO ] Invariant cache hit.
[2024-06-01 06:08:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:08:13] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2024-06-01 06:08:13] [INFO ] Redundant transitions in 64 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:08:13] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:08:13] [INFO ] Invariant cache hit.
[2024-06-01 06:08:13] [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:08:35] [INFO ] Deduced a trap composed of 5 places in 240 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 30072 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 30034 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 73548ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 73573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75214 ms. Remains : 183/183 places, 2027/2027 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Starting property specific reduction for BridgeAndVehicles-PT-V80P20N10-UpperBounds-04
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-06-01 06:09:26] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:09:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10001 steps (16 resets) in 81 ms. (121 steps per ms)
BEST_FIRST walk for 10005 steps (6 resets) in 30 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 06:09:26] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:09:26] [INFO ] Invariant cache hit.
[2024-06-01 06:09:26] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:09:27] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-06-01 06:09:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:09:27] [INFO ] [Real]Added 21 Read/Feed constraints in 13 ms returned sat
[2024-06-01 06:09:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:09:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:09:27] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 06:09:27] [INFO ] [Nat]Added 21 Read/Feed constraints in 33 ms returned sat
[2024-06-01 06:09:27] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2024-06-01 06:09:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2024-06-01 06:09:27] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 42 ms.
[2024-06-01 06:09:27] [INFO ] Added : 11 causal constraints over 3 iterations in 331 ms. Result :sat
Minimization took 353 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
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 190 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:09:28] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:09:28] [INFO ] Invariant cache hit.
[2024-06-01 06:09: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:09:50] [INFO ] Deduced a trap composed of 5 places in 266 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 20049 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 20050 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 53028ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 53050ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53245 ms. Remains : 183/183 places, 2027/2027 transitions.
[2024-06-01 06:10:21] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:10:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 5932 ms. (168 steps per ms)
BEST_FIRST walk for 1000000 steps (694 resets) in 2205 ms. (453 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 06:10:29] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:10:29] [INFO ] Invariant cache hit.
[2024-06-01 06:10:29] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:10:29] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-06-01 06:10:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:10:30] [INFO ] [Real]Added 21 Read/Feed constraints in 20 ms returned sat
[2024-06-01 06:10:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:10:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:10:30] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-01 06:10:30] [INFO ] [Nat]Added 21 Read/Feed constraints in 33 ms returned sat
[2024-06-01 06:10:30] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2024-06-01 06:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2024-06-01 06:10:30] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 56 ms.
[2024-06-01 06:10:30] [INFO ] Added : 11 causal constraints over 3 iterations in 366 ms. Result :sat
Minimization took 344 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
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 149 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 149 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 147 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:10:31] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:10:31] [INFO ] Invariant cache hit.
[2024-06-01 06:10:32] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 06:10:32] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:10:32] [INFO ] Invariant cache hit.
[2024-06-01 06:10:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:10:32] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2024-06-01 06:10:32] [INFO ] Redundant transitions in 48 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:10:33] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:10:33] [INFO ] Invariant cache hit.
[2024-06-01 06:10:33] [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:10:54] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30046 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 30070 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 73459ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 73481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74772 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 490 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (25 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (25 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 264665 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 264665 steps, saw 73457 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 06:11:49] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:11:49] [INFO ] Invariant cache hit.
[2024-06-01 06:11:49] [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:11:50] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2024-06-01 06:11:50] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 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
All remaining problems are real, not stopping.
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 844 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 2104 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 2979ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 279 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 157 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:11:53] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:11:53] [INFO ] Invariant cache hit.
[2024-06-01 06:11:53] [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:12:14] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20036 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 20043 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 53538ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 53562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53724 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 525 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (26 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 289787 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 289787 steps, saw 80071 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-06-01 06:12:50] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:12:50] [INFO ] Invariant cache hit.
[2024-06-01 06:12:50] [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:12:50] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2024-06-01 06:12:50] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 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
All remaining problems are real, not stopping.
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 2354 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 3212ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 306 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 154 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 155 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 150 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:12:53] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:12:53] [INFO ] Invariant cache hit.
[2024-06-01 06:12:54] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-06-01 06:12:54] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:12:54] [INFO ] Invariant cache hit.
[2024-06-01 06:12:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:12:55] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2024-06-01 06:12:55] [INFO ] Redundant transitions in 49 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:12:55] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:12:55] [INFO ] Invariant cache hit.
[2024-06-01 06:12:55] [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:13:17] [INFO ] Deduced a trap composed of 5 places in 273 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 30055 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 30035 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 73907ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 73929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75525 ms. Remains : 183/183 places, 2027/2027 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Ending property specific reduction for BridgeAndVehicles-PT-V80P20N10-UpperBounds-04 in 282503 ms.
[2024-06-01 06:14:09] [INFO ] Flatten gal took : 384 ms
[2024-06-01 06:14:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 06:14:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 183 places, 2027 transitions and 14984 arcs took 18 ms.
Total runtime 673983 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-UpperBounds-04

BK_STOP 1717222450194

--------------------
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-V80P20N10-UpperBounds-04
ub formula formula --maxsum=/tmp/820/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P20N10"
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-V80P20N10, 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-171620399200277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 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 ;