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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K 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 2.0M 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-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717221479142

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-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:58:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:58:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:58:00] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-06-01 05:58:00] [INFO ] Transformed 138 places.
[2024-06-01 05:58:00] [INFO ] Transformed 2348 transitions.
[2024-06-01 05:58:00] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 276 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 14
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[+inf, +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, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 05:58:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-06-01 05:58:00] [INFO ] Computed 7 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[50, 50, 50, 50, 2, 50, 50, 1, 1, 1, 50, 1]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (23 resets) in 212 ms. (46 steps per ms)
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (26 resets) in 82 ms. (361 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 20, 1] Max Struct:[50, 50, 2]
[2024-06-01 05:58:01] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-06-01 05:58:01] [INFO ] Invariant cache hit.
[2024-06-01 05:58:01] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 05:58:01] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 05:58:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:58:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 05:58:01] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 05:58:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:58:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2024-06-01 05:58:01] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 101 ms.
[2024-06-01 05:58:01] [INFO ] Added : 20 causal constraints over 4 iterations in 305 ms. Result :sat
Minimization took 225 ms.
[2024-06-01 05:58:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 05:58:02] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-01 05:58:02] [INFO ] [Real]Added 42 Read/Feed constraints in 19 ms returned sat
[2024-06-01 05:58:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:58:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 05:58:02] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 05:58:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:58:02] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 83 ms.
[2024-06-01 05:58:02] [INFO ] Added : 22 causal constraints over 20 iterations in 431 ms. Result :sat
Minimization took 212 ms.
[2024-06-01 05:58:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7, 20, 1] Max Struct:[50, 50, 1]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 20] Max Struct:[50, 50]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 399 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:58:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:58:04] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 05:58:04] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:58:32] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20129 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:59:02] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 3 solved, 2342 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 58652ms problems are : Problem set: 3 solved, 2342 unsolved
Search for dead transitions found 3 dead transitions in 58714ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 3 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/138 places, 2345/2348 transitions.
Applied a total of 0 rules in 243 ms. Remains 136 /136 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59393 ms. Remains : 136/138 places, 2345/2348 transitions.
[2024-06-01 05:59:03] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:59:03] [INFO ] Computed 5 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 20] Max Struct:[50, 50]
RANDOM walk for 1000004 steps (2316 resets) in 6194 ms. (161 steps per ms)
BEST_FIRST walk for 2000001 steps (1621 resets) in 4714 ms. (424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 05:59:14] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
[2024-06-01 05:59:14] [INFO ] Invariant cache hit.
[2024-06-01 05:59:14] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:59:14] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 05:59:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:59:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:59:14] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 05:59:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:59:14] [INFO ] [Nat]Added 42 Read/Feed constraints in 53 ms returned sat
[2024-06-01 05:59:15] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 1 ms to minimize.
[2024-06-01 05:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2024-06-01 05:59:15] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 79 ms.
[2024-06-01 05:59:15] [INFO ] Added : 21 causal constraints over 5 iterations in 303 ms. Result :sat
Minimization took 206 ms.
[2024-06-01 05:59:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:59:15] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-01 05:59:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:59:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:59:15] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 05:59:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2024-06-01 05:59:16] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2024-06-01 05:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2024-06-01 05:59:16] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 68 ms.
[2024-06-01 05:59:16] [INFO ] Added : 22 causal constraints over 20 iterations in 464 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2345/2345 transitions.
Applied a total of 0 rules in 248 ms. Remains 136 /136 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 136/136 places, 2345/2345 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2345/2345 transitions.
Applied a total of 0 rules in 215 ms. Remains 136 /136 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
[2024-06-01 05:59:18] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
[2024-06-01 05:59:18] [INFO ] Invariant cache hit.
[2024-06-01 05:59:18] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-01 05:59:18] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
[2024-06-01 05:59:18] [INFO ] Invariant cache hit.
[2024-06-01 05:59:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:59:20] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1647 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2345/2345 transitions.
Applied a total of 0 rules in 176 ms. Remains 134 /134 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2039 ms. Remains : 134/136 places, 2345/2345 transitions.
[2024-06-01 05:59:20] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-06-01 05:59:20] [INFO ] Computed 5 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2315 resets) in 5828 ms. (171 steps per ms)
BEST_FIRST walk for 2000001 steps (1615 resets) in 4026 ms. (496 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 05:59:30] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
[2024-06-01 05:59:30] [INFO ] Invariant cache hit.
[2024-06-01 05:59:30] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:59:30] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-06-01 05:59:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:59:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:59:30] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-01 05:59:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:59:30] [INFO ] [Nat]Added 42 Read/Feed constraints in 42 ms returned sat
[2024-06-01 05:59:30] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2024-06-01 05:59:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-06-01 05:59:30] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 75 ms.
[2024-06-01 05:59:31] [INFO ] Added : 21 causal constraints over 5 iterations in 238 ms. Result :sat
Minimization took 278 ms.
[2024-06-01 05:59:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:59:31] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-01 05:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:59:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:59:31] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 05:59:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2024-06-01 05:59:31] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 73 ms.
[2024-06-01 05:59:31] [INFO ] Added : 21 causal constraints over 20 iterations in 335 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2345/2345 transitions.
Applied a total of 0 rules in 165 ms. Remains 134 /134 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 134/134 places, 2345/2345 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2345/2345 transitions.
Applied a total of 0 rules in 215 ms. Remains 134 /134 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
[2024-06-01 05:59:33] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
[2024-06-01 05:59:33] [INFO ] Invariant cache hit.
[2024-06-01 05:59:34] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 05:59:34] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
[2024-06-01 05:59:34] [INFO ] Invariant cache hit.
[2024-06-01 05:59:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:59:34] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2024-06-01 05:59:34] [INFO ] Redundant transitions in 147 ms returned []
Running 2342 sub problems to find dead transitions.
[2024-06-01 05:59:34] [INFO ] Flow matrix only has 290 transitions (discarded 2055 similar events)
[2024-06-01 05:59:34] [INFO ] Invariant cache hit.
[2024-06-01 05:59:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-06-01 06:00:01] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 2 ms to minimize.
[2024-06-01 06:00:18] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 0 ms to minimize.
Problem TDEAD1308 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1581 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/424 variables, and 7 constraints, problems are : Problem set: 14 solved, 2328 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 14 solved, 2328 unsolved
Problem TDEAD1602 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2274 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 47 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/424 variables, and 7 constraints, problems are : Problem set: 47 solved, 2295 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 77129ms problems are : Problem set: 47 solved, 2295 unsolved
Search for dead transitions found 47 dead transitions in 77153ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 2298/2345 transitions.
Applied a total of 0 rules in 161 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-06-01 06:00:52] [INFO ] Redundant transitions in 106 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78851 ms. Remains : 134/134 places, 2298/2345 transitions.
[2024-06-01 06:00:52] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-06-01 06:00:52] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 5575 ms. (179 steps per ms)
BEST_FIRST walk for 2000020 steps (1615 resets) in 3826 ms. (522 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 06:01:01] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:01:01] [INFO ] Invariant cache hit.
[2024-06-01 06:01:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:01:01] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 06:01:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 06:01:01] [INFO ] [Real]Added 41 Read/Feed constraints in 33 ms returned sat
[2024-06-01 06:01:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:01:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:01:02] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 06:01:02] [INFO ] [Nat]Added 41 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:01:02] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 49 ms.
[2024-06-01 06:01:02] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-06-01 06:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-06-01 06:01:02] [INFO ] Added : 21 causal constraints over 5 iterations in 417 ms. Result :sat
Minimization took 131 ms.
[2024-06-01 06:01:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:01:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 06:01:02] [INFO ] [Real]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:01:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:01:02] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 06:01:02] [INFO ] [Nat]Added 41 Read/Feed constraints in 30 ms returned sat
[2024-06-01 06:01:02] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 51 ms.
[2024-06-01 06:01:03] [INFO ] Added : 21 causal constraints over 20 iterations in 304 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 190 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 210 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-06-01 06:01:04] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:01:04] [INFO ] Invariant cache hit.
[2024-06-01 06:01:05] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-01 06:01:05] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:01:05] [INFO ] Invariant cache hit.
[2024-06-01 06:01:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 06:01:06] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2024-06-01 06:01:06] [INFO ] Redundant transitions in 62 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-06-01 06:01:06] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:01:06] [INFO ] Invariant cache hit.
[2024-06-01 06:01:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 06:01:30] [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 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 76486ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 76512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78312 ms. Remains : 134/134 places, 2298/2298 transitions.
RANDOM walk for 40001 steps (92 resets) in 1147 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 329 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 228275 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 228275 steps, saw 60986 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 06:02:26] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:02:26] [INFO ] Invariant cache hit.
[2024-06-01 06:02:26] [INFO ] State equation strengthened by 41 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) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/400 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 23/423 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1183 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 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) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/400 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/423 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1535 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2744ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1386 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 153 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 06:02:30] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:02:30] [INFO ] Invariant cache hit.
[2024-06-01 06:02:31] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 06:02:56] [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 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 57176ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 57219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57396 ms. Remains : 134/134 places, 2298/2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 442 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (32 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (28 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (31 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 272468 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 4
Probabilistic random walk after 272468 steps, saw 72904 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-06-01 06:03:31] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:03:31] [INFO ] Invariant cache hit.
[2024-06-01 06:03:31] [INFO ] State equation strengthened by 41 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) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/400 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 23/423 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 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) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/400 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/423 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2358ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1214 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 156 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 149 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-06-01 06:03:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:03:35] [INFO ] Invariant cache hit.
[2024-06-01 06:03:35] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-01 06:03:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:03:35] [INFO ] Invariant cache hit.
[2024-06-01 06:03:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 06:03:36] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2024-06-01 06:03:36] [INFO ] Redundant transitions in 45 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-06-01 06:03:36] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 06:03:36] [INFO ] Invariant cache hit.
[2024-06-01 06:03:36] [INFO ] State equation strengthened by 41 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-V50P50N20-UpperBounds-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-01
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-06
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-08
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-11
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-12
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-13
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-14
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-UpperBounds-15

BK_STOP 1717221826974

--------------------
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-V50P50N20-UpperBounds-00
ub formula formula --maxsum=/tmp/712/ub_0_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-01
ub formula formula --maxsum=/tmp/712/ub_1_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
ub formula formula --maxsum=/tmp/712/ub_2_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-03
ub formula formula --maxsum=/tmp/712/ub_3_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-04
ub formula formula --maxsum=/tmp/712/ub_4_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
ub formula formula --maxsum=/tmp/712/ub_5_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-06
ub formula formula --maxsum=/tmp/712/ub_6_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
ub formula formula --maxsum=/tmp/712/ub_7_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-08
ub formula formula --maxsum=/tmp/712/ub_8_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
ub formula formula --maxsum=/tmp/712/ub_9_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-10
ub formula formula --maxsum=/tmp/712/ub_10_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-11
ub formula formula --maxsum=/tmp/712/ub_11_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-12
ub formula formula --maxsum=/tmp/712/ub_12_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-13
ub formula formula --maxsum=/tmp/712/ub_13_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-14
ub formula formula --maxsum=/tmp/712/ub_14_
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-15
ub formula formula --maxsum=/tmp/712/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-V50P50N20"
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-V50P50N20, 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-171620399100261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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