About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V50P50N20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16156.476 | 1153231.00 | 1989451.00 | 264.90 | 50 1 20 1 50 20 1 50 1 1 50 1 50 1 1 50 | normal |
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-171620397500101.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-COL-V50P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.0K Apr 13 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716279113338
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 08:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:11:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 08:11:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:11:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2024-05-21 08:11:55] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-21 08:11:55] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 08:11:55] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:11:55] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 50, 1] Max Struct:[50, 1, 50, 1, 50, 50, 1, 50, 1]
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 08:11:55] [INFO ] Invariant cache hit.
[2024-05-21 08:11:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 08:11:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 08:11:55] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 08:11:55] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 13 ms.
[2024-05-21 08:11:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:11:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 08:11:55] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 08:11:55] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 08:11:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:11:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 08:11:55] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 08:11:55] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 08:11:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:11:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 08:11:56] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:11:56] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 08:11:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:11:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 08:11:56] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 08:11:56] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:11:56] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 126 ms.
[2024-05-21 08:11:56] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
[2024-05-21 08:11:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 08:11:56] [INFO ] Computed 7 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
RANDOM walk for 10000 steps (23 resets) in 271 ms. (36 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20010 steps (16 resets) in 72 ms. (274 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 20] Max Struct:[50, 50]
[2024-05-21 08:11:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:11:56] [INFO ] Invariant cache hit.
[2024-05-21 08:11:56] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 08:11:56] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-21 08:11:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 08:11:56] [INFO ] [Real]Added 42 Read/Feed constraints in 25 ms returned sat
[2024-05-21 08:11:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:11:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 08:11:56] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-21 08:11:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2024-05-21 08:11:57] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 144 ms.
[2024-05-21 08:11:57] [INFO ] Added : 21 causal constraints over 5 iterations in 321 ms. Result :sat
Minimization took 300 ms.
[2024-05-21 08:11:57] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 08:11:57] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-21 08:11:57] [INFO ] [Real]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-05-21 08:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:11:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 08:11:57] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-21 08:11:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 36 ms returned sat
[2024-05-21 08:11:58] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 140 ms.
[2024-05-21 08:11:58] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 15 ms to minimize.
[2024-05-21 08:11:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-05-21 08:11:58] [INFO ] Added : 3 causal constraints over 2 iterations in 545 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 20] Max Struct:[50, 50]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 350 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 08:11:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 08:11:59] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 08:11:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 08:12:26] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 49.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20105 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 08:12:58] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 2 ms to minimize.
SMT process timed out in 58378ms, After SMT, problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 58432ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58809 ms. Remains : 136/138 places, 2348/2348 transitions.
[2024-05-21 08:12:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:12:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 20] Max Struct:[50, 50]
RANDOM walk for 1000001 steps (2315 resets) in 7314 ms. (136 steps per ms)
BEST_FIRST walk for 2000001 steps (1615 resets) in 5042 ms. (396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 08:13:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:13:10] [INFO ] Invariant cache hit.
[2024-05-21 08:13:10] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:13:10] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 08:13:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:13:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:13:10] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-21 08:13:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 08:13:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 28 ms returned sat
[2024-05-21 08:13:10] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 96 ms.
[2024-05-21 08:13:11] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 1 ms to minimize.
[2024-05-21 08:13:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2024-05-21 08:13:11] [INFO ] Added : 21 causal constraints over 5 iterations in 626 ms. Result :sat
Minimization took 218 ms.
[2024-05-21 08:13:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:13:11] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-21 08:13:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:13:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:13:11] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-21 08:13:11] [INFO ] [Nat]Added 42 Read/Feed constraints in 41 ms returned sat
[2024-05-21 08:13:12] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 2 ms to minimize.
[2024-05-21 08:13:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2024-05-21 08:13:12] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 71 ms.
[2024-05-21 08:13:12] [INFO ] Added : 23 causal constraints over 20 iterations in 425 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 194 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 221 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-21 08:13:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:13:14] [INFO ] Invariant cache hit.
[2024-05-21 08:13:14] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-21 08:13:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:13:14] [INFO ] Invariant cache hit.
[2024-05-21 08:13:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 08:13:16] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1873 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 289 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2385 ms. Remains : 134/136 places, 2348/2348 transitions.
[2024-05-21 08:13:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 08:13:16] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6331 ms. (157 steps per ms)
BEST_FIRST walk for 2000001 steps (1621 resets) in 4403 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 08:13:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:13:27] [INFO ] Invariant cache hit.
[2024-05-21 08:13:27] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:13:27] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-21 08:13:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:13:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:13:27] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-21 08:13:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 08:13:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 47 ms returned sat
[2024-05-21 08:13:28] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 1 ms to minimize.
[2024-05-21 08:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2024-05-21 08:13:28] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 80 ms.
[2024-05-21 08:13:28] [INFO ] Added : 20 causal constraints over 5 iterations in 290 ms. Result :sat
Minimization took 187 ms.
[2024-05-21 08:13:28] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:13:28] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-21 08:13:28] [INFO ] [Real]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-05-21 08:13:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:13:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:13:28] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-21 08:13:28] [INFO ] [Nat]Added 42 Read/Feed constraints in 28 ms returned sat
[2024-05-21 08:13:29] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
[2024-05-21 08:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2024-05-21 08:13:29] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 68 ms.
[2024-05-21 08:13:29] [INFO ] Added : 22 causal constraints over 20 iterations in 436 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 223 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 134/134 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 220 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-21 08:13:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:13:31] [INFO ] Invariant cache hit.
[2024-05-21 08:13:31] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-21 08:13:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:13:31] [INFO ] Invariant cache hit.
[2024-05-21 08:13:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 08:13:33] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
[2024-05-21 08:13:33] [INFO ] Redundant transitions in 150 ms returned []
Running 2345 sub problems to find dead transitions.
[2024-05-21 08:13:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 08:13:33] [INFO ] Invariant cache hit.
[2024-05-21 08:13:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 08:14:03] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 3 ms to minimize.
[2024-05-21 08:14:20] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/424 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/424 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 79945ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 79973ms
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 : 134/134 places, 2298/2348 transitions.
Applied a total of 0 rules in 217 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 08:14:54] [INFO ] Redundant transitions in 100 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82836 ms. Remains : 134/134 places, 2298/2348 transitions.
[2024-05-21 08:14:54] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-21 08:14:54] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6477 ms. (154 steps per ms)
BEST_FIRST walk for 2000001 steps (1622 resets) in 4147 ms. (482 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 08:15:04] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:15:04] [INFO ] Invariant cache hit.
[2024-05-21 08:15:04] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:15:04] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-21 08:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:15:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:15:04] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-21 08:15:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:15:05] [INFO ] [Nat]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-05-21 08:15:05] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2024-05-21 08:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2024-05-21 08:15:05] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 83 ms.
[2024-05-21 08:15:05] [INFO ] Added : 21 causal constraints over 5 iterations in 348 ms. Result :sat
Minimization took 338 ms.
[2024-05-21 08:15:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:15:06] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-21 08:15:06] [INFO ] [Real]Added 41 Read/Feed constraints in 24 ms returned sat
[2024-05-21 08:15:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:15:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:15:06] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-21 08:15:06] [INFO ] [Nat]Added 41 Read/Feed constraints in 36 ms returned sat
[2024-05-21 08:15:06] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 1 ms to minimize.
[2024-05-21 08:15:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2024-05-21 08:15:06] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 84 ms.
[2024-05-21 08:15:07] [INFO ] Added : 22 causal constraints over 20 iterations in 505 ms. Result :sat
Minimization took 279 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 274 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 204 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 08:15:09] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:15:09] [INFO ] Invariant cache hit.
[2024-05-21 08:15:09] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-21 08:15:09] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:15:09] [INFO ] Invariant cache hit.
[2024-05-21 08:15:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:15:10] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2024-05-21 08:15:10] [INFO ] Redundant transitions in 57 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:15:10] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:15:10] [INFO ] Invariant cache hit.
[2024-05-21 08:15:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:15:37] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
(s0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 78377ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 78403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79953 ms. Remains : 134/134 places, 2298/2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 1255 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 501 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (28 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (28 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 226762 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 4
Probabilistic random walk after 226762 steps, saw 60494 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-21 08:16:32] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:16:32] [INFO ] Invariant cache hit.
[2024-05-21 08:16:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/400 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 08:16:33] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/423 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 181 constraints, problems are : Problem set: 0 solved, 4 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/400 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/423 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 185 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1532 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 168 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:16:36] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:16:36] [INFO ] Invariant cache hit.
[2024-05-21 08:16:36] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:17:02] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 58014ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 58037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58213 ms. Remains : 134/134 places, 2298/2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 561 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (28 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 234640 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 4
Probabilistic random walk after 234640 steps, saw 62660 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-21 08:17:38] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:17:38] [INFO ] Invariant cache hit.
[2024-05-21 08:17:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/400 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 08:17:38] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/423 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 181 constraints, problems are : Problem set: 0 solved, 4 unsolved in 897 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/400 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/423 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 185 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2607ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1232 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 187 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 208 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 08:17:42] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:17:42] [INFO ] Invariant cache hit.
[2024-05-21 08:17:42] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 08:17:42] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:17:42] [INFO ] Invariant cache hit.
[2024-05-21 08:17:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:17:43] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-21 08:17:43] [INFO ] Redundant transitions in 58 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:17:43] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:17:43] [INFO ] Invariant cache hit.
[2024-05-21 08:17:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:18:14] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 80218ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 80266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81849 ms. Remains : 134/134 places, 2298/2298 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[20, 20] Max Struct:[50, 50]
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-05-21 08:19:03] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:19:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (23 resets) in 80 ms. (123 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 31 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2024-05-21 08:19:04] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:19:04] [INFO ] Invariant cache hit.
[2024-05-21 08:19:04] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:19:04] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-21 08:19:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:19:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:19:04] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-21 08:19:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:19:04] [INFO ] [Nat]Added 41 Read/Feed constraints in 41 ms returned sat
[2024-05-21 08:19:04] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 1 ms to minimize.
[2024-05-21 08:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-05-21 08:19:04] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 67 ms.
[2024-05-21 08:19:05] [INFO ] Added : 21 causal constraints over 5 iterations in 309 ms. Result :sat
Minimization took 306 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2297
Applied a total of 2 rules in 263 ms. Remains 133 /134 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:19:06] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 08:19:06] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:19:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:19:34] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 60498ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60769 ms. Remains : 133/134 places, 2297/2298 transitions.
[2024-05-21 08:20:06] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (2682 resets) in 7597 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (1065 resets) in 3296 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2024-05-21 08:20:17] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:17] [INFO ] Invariant cache hit.
[2024-05-21 08:20:17] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:20:17] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-21 08:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:20:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:20:17] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-21 08:20:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:20:17] [INFO ] [Nat]Added 41 Read/Feed constraints in 34 ms returned sat
[2024-05-21 08:20:18] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 1 ms to minimize.
[2024-05-21 08:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2024-05-21 08:20:18] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 62 ms.
[2024-05-21 08:20:18] [INFO ] Added : 21 causal constraints over 5 iterations in 276 ms. Result :sat
Minimization took 428 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 276 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 133/133 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 262 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 08:20:20] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:20] [INFO ] Invariant cache hit.
[2024-05-21 08:20:20] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-21 08:20:20] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:20] [INFO ] Invariant cache hit.
[2024-05-21 08:20:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:20:21] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-21 08:20:21] [INFO ] Redundant transitions in 63 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:20:21] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:21] [INFO ] Invariant cache hit.
[2024-05-21 08:20:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:20:49] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 79412ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 79440ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80994 ms. Remains : 133/133 places, 2297/2297 transitions.
RANDOM walk for 40000 steps (104 resets) in 666 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (40 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 245196 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 245196 steps, saw 65869 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-21 08:21:44] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:21:44] [INFO ] Invariant cache hit.
[2024-05-21 08:21:44] [INFO ] State equation strengthened by 41 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) 147/200 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/318 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:21:44] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 102/420 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 21/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/421 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 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) 147/200 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/318 variables, 26/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/420 variables, 51/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 21/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/421 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/421 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/421 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1880ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1075 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 235 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:21:47] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:21:47] [INFO ] Invariant cache hit.
[2024-05-21 08:21:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:22:16] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60691 ms. Remains : 133/133 places, 2297/2297 transitions.
RANDOM walk for 40000 steps (104 resets) in 1097 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40012 steps (41 resets) in 457 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 253960 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 253960 steps, saw 68159 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 08:22:51] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:22:51] [INFO ] Invariant cache hit.
[2024-05-21 08:22:51] [INFO ] State equation strengthened by 41 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) 147/200 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/318 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:22:52] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 102/420 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 21/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/421 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 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) 147/200 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/318 variables, 26/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/420 variables, 51/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 21/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/421 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/421 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/421 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1343ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 735 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 209 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 133/133 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 196 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 08:22:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:22:54] [INFO ] Invariant cache hit.
[2024-05-21 08:22:54] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-21 08:22:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:22:54] [INFO ] Invariant cache hit.
[2024-05-21 08:22:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:22:55] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
[2024-05-21 08:22:55] [INFO ] Redundant transitions in 75 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:22:55] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:22:55] [INFO ] Invariant cache hit.
[2024-05-21 08:22:55] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:23:25] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 81030ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 81059ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82513 ms. Remains : 133/133 places, 2297/2297 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[20] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-02 in 312505 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-05
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 08:24:16] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-21 08:24:16] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (23 resets) in 74 ms. (133 steps per ms)
BEST_FIRST walk for 10000 steps (7 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2024-05-21 08:24:16] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:24:16] [INFO ] Invariant cache hit.
[2024-05-21 08:24:16] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:24:16] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-21 08:24:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:24:16] [INFO ] [Real]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-05-21 08:24:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:24:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:24:16] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-21 08:24:16] [INFO ] [Nat]Added 41 Read/Feed constraints in 39 ms returned sat
[2024-05-21 08:24:17] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 4 ms to minimize.
[2024-05-21 08:24:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2024-05-21 08:24:17] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 78 ms.
[2024-05-21 08:24:17] [INFO ] Added : 22 causal constraints over 20 iterations in 419 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 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 2 place count 133 transition count 2297
Applied a total of 2 rules in 183 ms. Remains 133 /134 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:24:18] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 08:24:18] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 08:24:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:24:47] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 59931ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 59952ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60140 ms. Remains : 133/134 places, 2297/2298 transitions.
[2024-05-21 08:25:18] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:25:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (2682 resets) in 7213 ms. (138 steps per ms)
BEST_FIRST walk for 1000000 steps (995 resets) in 2519 ms. (396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2024-05-21 08:25:27] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:25:27] [INFO ] Invariant cache hit.
[2024-05-21 08:25:27] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:25:27] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-21 08:25:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:25:28] [INFO ] [Real]Added 41 Read/Feed constraints in 50 ms returned sat
[2024-05-21 08:25:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:25:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:25:28] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 08:25:28] [INFO ] [Nat]Added 41 Read/Feed constraints in 41 ms returned sat
[2024-05-21 08:25:28] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 60 ms.
[2024-05-21 08:25:28] [INFO ] Added : 22 causal constraints over 20 iterations in 356 ms. Result :sat
Minimization took 320 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 242 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 133/133 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 203 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 08:25:29] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:25:29] [INFO ] Invariant cache hit.
[2024-05-21 08:25:30] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-21 08:25:30] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:25:30] [INFO ] Invariant cache hit.
[2024-05-21 08:25:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:25:31] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2024-05-21 08:25:31] [INFO ] Redundant transitions in 58 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:25:31] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:25:31] [INFO ] Invariant cache hit.
[2024-05-21 08:25:31] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:25:59] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 80559ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 80586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82100 ms. Remains : 133/133 places, 2297/2297 transitions.
RANDOM walk for 40000 steps (104 resets) in 553 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (38 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40015 steps (38 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 231258 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 231258 steps, saw 66278 distinct states, run finished after 3013 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 08:26:55] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:26:55] [INFO ] Invariant cache hit.
[2024-05-21 08:26:55] [INFO ] State equation strengthened by 41 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) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:26:55] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 115/318 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:26:55] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/420 variables, 51/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/421 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/421 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/421 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 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) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/318 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 21/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 102/420 variables, 51/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/421 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/421 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/421 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2012ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 369 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 207 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:26:57] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:26:57] [INFO ] Invariant cache hit.
[2024-05-21 08:26:57] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:27:25] [INFO ] Deduced a trap composed of 5 places in 370 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 59414ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 59448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59661 ms. Remains : 133/133 places, 2297/2297 transitions.
RANDOM walk for 40002 steps (104 resets) in 606 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (37 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (38 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 244420 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 244420 steps, saw 70318 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-21 08:28:00] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:28:00] [INFO ] Invariant cache hit.
[2024-05-21 08:28:00] [INFO ] State equation strengthened by 41 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) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:28:00] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 115/318 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:28:01] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/420 variables, 51/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/421 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/421 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/421 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 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) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/318 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 21/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 102/420 variables, 51/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/421 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/421 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/421 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1624ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 329 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 239 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 133/133 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 236 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 08:28:02] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:28:02] [INFO ] Invariant cache hit.
[2024-05-21 08:28:03] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 08:28:03] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:28:03] [INFO ] Invariant cache hit.
[2024-05-21 08:28:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:28:04] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
[2024-05-21 08:28:04] [INFO ] Redundant transitions in 60 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:28:04] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:28:04] [INFO ] Invariant cache hit.
[2024-05-21 08:28:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:28:32] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 78852ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 78878ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80614 ms. Remains : 133/133 places, 2297/2297 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[20] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-05 in 306955 ms.
[2024-05-21 08:29:23] [INFO ] Flatten gal took : 183 ms
[2024-05-21 08:29:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 130 ms.
[2024-05-21 08:29:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 134 places, 2298 transitions and 17486 arcs took 28 ms.
Total runtime 1049132 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BridgeAndVehicles-COL-V50P50N20
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: 134
TRANSITIONS: 2298
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.096s, Sys 0.000s]
SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.010s, 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: 1011
MODEL NAME: /home/mcc/execution/418/model
134 places, 2298 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-COL-V50P50N20-UpperBounds-02 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-05 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716280266569
--------------------
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-COL-V50P50N20"
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-COL-V50P50N20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397500101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N20.tgz
mv BridgeAndVehicles-COL-V50P50N20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;