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.r047-tajo-171620397800253.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 greatspnxred
Input is BridgeAndVehicles-PT-V50P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 18K Apr 13 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 13 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 129K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 529K Apr 13 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 77K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 227K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Apr 13 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 264K Apr 13 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Apr 13 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 514K Apr 13 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K 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.1M 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-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716288474380

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:47:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 10:47:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:47:56] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-21 10:47:56] [INFO ] Transformed 128 places.
[2024-05-21 10:47:56] [INFO ] Transformed 1328 transitions.
[2024-05-21 10:47:56] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 11
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[50, 0, 50, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[50, 0, 50, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 10:47:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-21 10:47:56] [INFO ] Computed 7 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50, 0, 50, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1, 50, 50, 1, 50]
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (22 resets) in 227 ms. (43 steps per ms)
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (19 resets) in 63 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[50]
[2024-05-21 10:47:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2024-05-21 10:47:56] [INFO ] Invariant cache hit.
[2024-05-21 10:47:57] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-05-21 10:47:57] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-21 10:47:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 10:47:57] [INFO ] [Real]Added 22 Read/Feed constraints in 38 ms returned sat
[2024-05-21 10:47:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:47:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 10:47:57] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 10:47:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 47 ms returned sat
[2024-05-21 10:47:57] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 151 ms.
[2024-05-21 10:47:58] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 13 ms to minimize.
[2024-05-21 10:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2024-05-21 10:47:58] [INFO ] Added : 10 causal constraints over 2 iterations in 675 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[50]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 311 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
Running 1324 sub problems to find dead transitions.
[2024-05-21 10:47:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2024-05-21 10:47:59] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 10:47:59] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 3 ms to minimize.
[2024-05-21 10:48:15] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 7 constraints, problems are : Problem set: 50 solved, 1274 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 1274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 50 solved, 1274 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 249/374 variables, 125/132 constraints. Problems are: Problem set: 52 solved, 1272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 22/154 constraints. Problems are: Problem set: 52 solved, 1272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1426 constraints, problems are : Problem set: 52 solved, 1272 unsolved in 22021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1272/1324 constraints, Known Traps: 2/2 constraints]
After SMT, in 48990ms problems are : Problem set: 52 solved, 1272 unsolved
Search for dead transitions found 52 dead transitions in 49031ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 52 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1275/1328 transitions.
Applied a total of 0 rules in 74 ms. Remains 125 /125 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49447 ms. Remains : 125/128 places, 1275/1328 transitions.
[2024-05-21 10:48:48] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
// Phase 1: matrix 246 rows 125 cols
[2024-05-21 10:48:48] [INFO ] Computed 7 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 4771 ms. (209 steps per ms)
BEST_FIRST walk for 1000001 steps (1087 resets) in 1889 ms. (529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 10:48:54] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2024-05-21 10:48:54] [INFO ] Invariant cache hit.
[2024-05-21 10:48:54] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 10:48:54] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-21 10:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:48:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 10:48:54] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 10:48:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:48:55] [INFO ] [Nat]Added 21 Read/Feed constraints in 23 ms returned sat
[2024-05-21 10:48:55] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2024-05-21 10:48:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-21 10:48:55] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 46 ms.
[2024-05-21 10:48:55] [INFO ] Added : 11 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1275/1275 transitions.
Applied a total of 0 rules in 79 ms. Remains 125 /125 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 125/125 places, 1275/1275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1275/1275 transitions.
Applied a total of 0 rules in 81 ms. Remains 125 /125 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2024-05-21 10:48:55] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2024-05-21 10:48:55] [INFO ] Invariant cache hit.
[2024-05-21 10:48:56] [INFO ] Implicit Places using invariants in 400 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 406 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1275/1275 transitions.
Applied a total of 0 rules in 75 ms. Remains 123 /123 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 562 ms. Remains : 123/125 places, 1275/1275 transitions.
[2024-05-21 10:48:56] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
// Phase 1: matrix 246 rows 123 cols
[2024-05-21 10:48:56] [INFO ] Computed 5 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 4111 ms. (243 steps per ms)
BEST_FIRST walk for 1000001 steps (1086 resets) in 1645 ms. (607 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 10:49:02] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2024-05-21 10:49:02] [INFO ] Invariant cache hit.
[2024-05-21 10:49:02] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 10:49:02] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-21 10:49:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:49:02] [INFO ] [Real]Added 21 Read/Feed constraints in 16 ms returned sat
[2024-05-21 10:49:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:49:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:49:02] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 10:49:02] [INFO ] [Nat]Added 21 Read/Feed constraints in 19 ms returned sat
[2024-05-21 10:49:02] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 45 ms.
[2024-05-21 10:49:02] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2024-05-21 10:49:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-21 10:49:02] [INFO ] Added : 11 causal constraints over 3 iterations in 378 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1275/1275 transitions.
Applied a total of 0 rules in 69 ms. Remains 123 /123 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 123/123 places, 1275/1275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1275/1275 transitions.
Applied a total of 0 rules in 64 ms. Remains 123 /123 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2024-05-21 10:49:03] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2024-05-21 10:49:03] [INFO ] Invariant cache hit.
[2024-05-21 10:49:03] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-21 10:49:03] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2024-05-21 10:49:03] [INFO ] Invariant cache hit.
[2024-05-21 10:49:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:49:04] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-05-21 10:49:04] [INFO ] Redundant transitions in 76 ms returned []
Running 1272 sub problems to find dead transitions.
[2024-05-21 10:49:04] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2024-05-21 10:49:04] [INFO ] Invariant cache hit.
[2024-05-21 10:49:04] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
[2024-05-21 10:49:13] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2024-05-21 10:49:14] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD664 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 246/369 variables, 123/130 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
SMT process timed out in 35642ms, After SMT, problems are : Problem set: 50 solved, 1222 unsolved
Search for dead transitions found 50 dead transitions in 35663ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 1225/1275 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 10:49:39] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36666 ms. Remains : 123/123 places, 1225/1275 transitions.
[2024-05-21 10:49:40] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 10:49:40] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 3832 ms. (260 steps per ms)
BEST_FIRST walk for 1000000 steps (1084 resets) in 1505 ms. (664 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 10:49:45] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:49:45] [INFO ] Invariant cache hit.
[2024-05-21 10:49:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:49:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 10:49:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:49:45] [INFO ] [Real]Added 20 Read/Feed constraints in 14 ms returned sat
[2024-05-21 10:49:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:49:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:49:45] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-21 10:49:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 34 ms returned sat
[2024-05-21 10:49:45] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 33 ms.
[2024-05-21 10:49:46] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 2 ms to minimize.
[2024-05-21 10:49:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2024-05-21 10:49:46] [INFO ] Added : 11 causal constraints over 3 iterations in 565 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 72 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 69 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 10:49:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:49:46] [INFO ] Invariant cache hit.
[2024-05-21 10:49:47] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 10:49:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:49:47] [INFO ] Invariant cache hit.
[2024-05-21 10:49:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:49:47] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2024-05-21 10:49:47] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:49:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:49:47] [INFO ] Invariant cache hit.
[2024-05-21 10:49:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:49:55] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 64982ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65814 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 1061 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (42 resets) in 412 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 354333 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 354333 steps, saw 98452 distinct states, run finished after 3006 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-21 10:50:56] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:50:56] [INFO ] Invariant cache hit.
[2024-05-21 10:50:56] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 10:50:56] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-21 10:50:56] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1766ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 708 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 76 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:50:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:50:58] [INFO ] Invariant cache hit.
[2024-05-21 10:50:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:51:07] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45375ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45391ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45475 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 434 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (41 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 397872 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 2
Probabilistic random walk after 397872 steps, saw 110503 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-21 10:51:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:47] [INFO ] Invariant cache hit.
[2024-05-21 10:51:47] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 10:51:47] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 2 ms to minimize.
[2024-05-21 10:51:48] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1631ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 605 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 10:51:49] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:49] [INFO ] Invariant cache hit.
[2024-05-21 10:51:50] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-21 10:51:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:50] [INFO ] Invariant cache hit.
[2024-05-21 10:51:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:51:50] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2024-05-21 10:51:50] [INFO ] Redundant transitions in 20 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:51:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:50] [INFO ] Invariant cache hit.
[2024-05-21 10:51:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:51:59] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 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 Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 65081ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65095ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66071 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-05-21 10:52:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:52:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (26 resets) in 41 ms. (238 steps per ms)
BEST_FIRST walk for 10001 steps (10 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 10:52:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:52:55] [INFO ] Invariant cache hit.
[2024-05-21 10:52:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:52:56] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 10:52:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:52:56] [INFO ] [Real]Added 20 Read/Feed constraints in 13 ms returned sat
[2024-05-21 10:52:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:52:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:52:56] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 10:52:56] [INFO ] [Nat]Added 20 Read/Feed constraints in 22 ms returned sat
[2024-05-21 10:52:56] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 29 ms.
[2024-05-21 10:52:56] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2024-05-21 10:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-21 10:52:56] [INFO ] Added : 11 causal constraints over 3 iterations in 331 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:52:56] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:52:56] [INFO ] Invariant cache hit.
[2024-05-21 10:52:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:53:05] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 44926ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44989 ms. Remains : 123/123 places, 1225/1225 transitions.
[2024-05-21 10:53:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:53:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2623 resets) in 3735 ms. (267 steps per ms)
BEST_FIRST walk for 1000001 steps (1085 resets) in 1430 ms. (698 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 10:53:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:53:47] [INFO ] Invariant cache hit.
[2024-05-21 10:53:47] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 10:53:47] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 10:53:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:53:47] [INFO ] [Real]Added 20 Read/Feed constraints in 14 ms returned sat
[2024-05-21 10:53:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:53:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:53:47] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 10:53:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 20 ms returned sat
[2024-05-21 10:53:47] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 31 ms.
[2024-05-21 10:53:47] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 5 ms to minimize.
[2024-05-21 10:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-21 10:53:47] [INFO ] Added : 11 causal constraints over 3 iterations in 368 ms. Result :sat
Minimization took 249 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 10:53:48] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:53:48] [INFO ] Invariant cache hit.
[2024-05-21 10:53:48] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-21 10:53:48] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:53:48] [INFO ] Invariant cache hit.
[2024-05-21 10:53:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:53:49] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2024-05-21 10:53:49] [INFO ] Redundant transitions in 18 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:53:49] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:53:49] [INFO ] Invariant cache hit.
[2024-05-21 10:53:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:53:56] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 64525ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65515 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 432 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (42 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 431364 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 431364 steps, saw 119448 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-21 10:54:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:54:57] [INFO ] Invariant cache hit.
[2024-05-21 10:54:57] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 10:54:57] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-21 10:54:57] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1574ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 688 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 76 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:54:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:54:59] [INFO ] Invariant cache hit.
[2024-05-21 10:54:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:55:07] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 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 Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 44713ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44727ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44807 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 337 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (41 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 401805 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 401805 steps, saw 111575 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-21 10:55:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:55:47] [INFO ] Invariant cache hit.
[2024-05-21 10:55:47] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 10:55:47] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-21 10:55:47] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1523ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 559 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 10:55:49] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:55:49] [INFO ] Invariant cache hit.
[2024-05-21 10:55:49] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 10:55:49] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:55:49] [INFO ] Invariant cache hit.
[2024-05-21 10:55:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:55:50] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2024-05-21 10:55:50] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:55:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:55:50] [INFO ] Invariant cache hit.
[2024-05-21 10:55:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:55:58] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 64770ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65715 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 in 239300 ms.
[2024-05-21 10:56:55] [INFO ] Flatten gal took : 115 ms
[2024-05-21 10:56:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 10:56:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 1225 transitions and 8998 arcs took 10 ms.
Total runtime 539632 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 123
TRANSITIONS: 1225
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.056s, Sys 0.000s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 846
MODEL NAME: /home/mcc/execution/418/model
123 places, 1225 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716289017796

--------------------
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

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-V50P50N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-PT-V50P50N10, 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 r047-tajo-171620397800253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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