About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V80P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16054.355 | 548978.00 | 835652.00 | 223.10 | 80 1 10 10 80 1 80 1 10 1 80 10 80 1 80 1 | 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-171620397600141.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-V80P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397600141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 01:34 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 45K 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-V80P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716282159052
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-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:02:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 09:02:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:02:40] [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 09:02:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 09:02:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 566 ms
[2024-05-21 09:02:41] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-21 09:02:41] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 09:02:41] [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 09:02:41] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 0, 1, 80, 0, 0] Max Struct:[80, 1, 50, 50, 80, 1, 80, 1, 80]
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 09:02:41] [INFO ] Invariant cache hit.
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-21 09:02:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:02:41] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 09:02:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:02:41] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 09:02:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:02:41] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-21 09:02:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:02:41] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 2 ms.
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 09:02:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:02:41] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:02:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 09:02:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:02:41] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] 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 09:02:41] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 105 ms.
[2024-05-21 09:02:41] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
[2024-05-21 09:02:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 09:02:41] [INFO ] Computed 7 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[80, 50, 50, 80, 1, 80]
RANDOM walk for 10001 steps (14 resets) in 288 ms. (34 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-14 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (11 resets) in 62 ms. (317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 6] Max Struct:[50, 50]
[2024-05-21 09:02:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:02:42] [INFO ] Invariant cache hit.
[2024-05-21 09:02:42] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2024-05-21 09:02:42] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-21 09:02:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:02:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 09:02:42] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 09:02:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 09:02:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 38 ms returned sat
[2024-05-21 09:02:43] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 42 ms to minimize.
[2024-05-21 09:02:43] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 2 ms to minimize.
[2024-05-21 09:02:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1028 ms
[2024-05-21 09:02:44] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 115 ms.
[2024-05-21 09:02:44] [INFO ] Added : 10 causal constraints over 2 iterations in 244 ms. Result :sat
Minimization took 182 ms.
[2024-05-21 09:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-21 09:02:44] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 09:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:02:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 53 ms returned sat
[2024-05-21 09:02:44] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-21 09:02:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 27 ms returned sat
[2024-05-21 09:02:45] [INFO ] Deduced a trap composed of 6 places in 497 ms of which 3 ms to minimize.
[2024-05-21 09:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 522 ms
[2024-05-21 09:02:45] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 62 ms.
[2024-05-21 09:02:45] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 2 ms to minimize.
[2024-05-21 09:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2024-05-21 09:02:45] [INFO ] Added : 8 causal constraints over 8 iterations in 559 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 6] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 301 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 09:02:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-21 09:02:46] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 09:02:47] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 09:03:13] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20114 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 56048ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 56112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56435 ms. Remains : 186/188 places, 2108/2108 transitions.
[2024-05-21 09:03:43] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:03:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1424 resets) in 7421 ms. (134 steps per ms)
BEST_FIRST walk for 2000001 steps (1082 resets) in 5145 ms. (388 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-05-21 09:03:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:03:55] [INFO ] Invariant cache hit.
[2024-05-21 09:03:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 09:03:55] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-21 09:03:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 09:03:55] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2024-05-21 09:03:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:03:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 09:03:55] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-21 09:03:55] [INFO ] [Nat]Added 22 Read/Feed constraints in 27 ms returned sat
[2024-05-21 09:03:56] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 66 ms.
[2024-05-21 09:03:56] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 1 ms to minimize.
[2024-05-21 09:03:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2024-05-21 09:03:56] [INFO ] Added : 10 causal constraints over 2 iterations in 598 ms. Result :sat
Minimization took 195 ms.
[2024-05-21 09:03:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 09:03:56] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-21 09:03:56] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2024-05-21 09:03:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:03:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 09:03:57] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-21 09:03:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2024-05-21 09:03:57] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 2 ms to minimize.
[2024-05-21 09:03:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2024-05-21 09:03:57] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 66 ms.
[2024-05-21 09:03:57] [INFO ] Added : 12 causal constraints over 10 iterations in 324 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 170 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 168 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-21 09:03:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:03:59] [INFO ] Invariant cache hit.
[2024-05-21 09:03:59] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-21 09:03:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:03:59] [INFO ] Invariant cache hit.
[2024-05-21 09:03:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 09:04:01] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2011 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 228 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2409 ms. Remains : 184/186 places, 2108/2108 transitions.
[2024-05-21 09:04:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2024-05-21 09:04:01] [INFO ] Computed 5 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1424 resets) in 6380 ms. (156 steps per ms)
BEST_FIRST walk for 2000002 steps (1083 resets) in 4771 ms. (419 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-05-21 09:04:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:04:12] [INFO ] Invariant cache hit.
[2024-05-21 09:04:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 09:04:12] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-21 09:04:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 09:04:12] [INFO ] [Real]Added 22 Read/Feed constraints in 23 ms returned sat
[2024-05-21 09:04:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:04:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 09:04:13] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-21 09:04:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 28 ms returned sat
[2024-05-21 09:04:13] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 47 ms.
[2024-05-21 09:04:13] [INFO ] Added : 10 causal constraints over 2 iterations in 164 ms. Result :sat
Minimization took 146 ms.
[2024-05-21 09:04:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 09:04:13] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-21 09:04:13] [INFO ] [Real]Added 22 Read/Feed constraints in 15 ms returned sat
[2024-05-21 09:04:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:04:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 09:04:13] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 09:04:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 25 ms returned sat
[2024-05-21 09:04:13] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 46 ms.
[2024-05-21 09:04:14] [INFO ] Added : 8 causal constraints over 7 iterations in 376 ms. Result :sat
Minimization took 206 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 168 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 141 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-21 09:04:15] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:04:15] [INFO ] Invariant cache hit.
[2024-05-21 09:04:15] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-21 09:04:15] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:04:15] [INFO ] Invariant cache hit.
[2024-05-21 09:04:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 09:04:16] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2024-05-21 09:04:16] [INFO ] Redundant transitions in 145 ms returned []
Running 2105 sub problems to find dead transitions.
[2024-05-21 09:04:16] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 09:04:16] [INFO ] Invariant cache hit.
[2024-05-21 09:04:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 09:04:42] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 3 ms to minimize.
[2024-05-21 09:04:58] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
(s43 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
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 1)
(s41 0)
(s42 0)
(s43 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 75490ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 75519ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/184 places, 2028/2108 transitions.
Applied a total of 0 rules in 185 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 09:05:32] [INFO ] Redundant transitions in 114 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77726 ms. Remains : 184/184 places, 2028/2108 transitions.
[2024-05-21 09:05:32] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-05-21 09:05:32] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1423 resets) in 5947 ms. (168 steps per ms)
BEST_FIRST walk for 2000001 steps (1083 resets) in 4337 ms. (461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2024-05-21 09:05:42] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:05:42] [INFO ] Invariant cache hit.
[2024-05-21 09:05:42] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-21 09:05:43] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-21 09:05:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 09:05:43] [INFO ] [Real]Added 21 Read/Feed constraints in 23 ms returned sat
[2024-05-21 09:05:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:05:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 09:05:43] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-21 09:05:43] [INFO ] [Nat]Added 21 Read/Feed constraints in 34 ms returned sat
[2024-05-21 09:05:43] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 54 ms.
[2024-05-21 09:05:43] [INFO ] Added : 10 causal constraints over 2 iterations in 313 ms. Result :sat
Minimization took 250 ms.
[2024-05-21 09:05:43] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 09:05:44] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-21 09:05:44] [INFO ] [Real]Added 21 Read/Feed constraints in 22 ms returned sat
[2024-05-21 09:05:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:05:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 09:05:44] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-21 09:05:44] [INFO ] [Nat]Added 21 Read/Feed constraints in 31 ms returned sat
[2024-05-21 09:05:44] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 60 ms.
[2024-05-21 09:05:44] [INFO ] Added : 12 causal constraints over 10 iterations in 349 ms. Result :sat
Minimization took 315 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 190 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 147 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 09:05:46] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:05:46] [INFO ] Invariant cache hit.
[2024-05-21 09:05:46] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-21 09:05:46] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:05:46] [INFO ] Invariant cache hit.
[2024-05-21 09:05:46] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 09:05:47] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
[2024-05-21 09:05:47] [INFO ] Redundant transitions in 51 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 09:05:47] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:05:47] [INFO ] Invariant cache hit.
[2024-05-21 09:05:47] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 09:06:10] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 74210ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75873 ms. Remains : 184/184 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 1249 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 419 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (20 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 210270 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 210270 steps, saw 58376 distinct states, run finished after 3005 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-21 09:07:05] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:07:05] [INFO ] Invariant cache hit.
[2024-05-21 09:07:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:07:06] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:07:06] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/553 variables, 13/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3193ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3306 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 139 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 09:07:12] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:07:12] [INFO ] Invariant cache hit.
[2024-05-21 09:07:12] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 09:07:36] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54684ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54709ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54855 ms. Remains : 184/184 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 564 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (20 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (20 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 214400 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 4
Probabilistic random walk after 214400 steps, saw 59423 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-21 09:08:10] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:08:10] [INFO ] Invariant cache hit.
[2024-05-21 09:08:10] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:08:11] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:08:11] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1835 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/553 variables, 13/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2551 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 4421ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3701 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 119 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 118 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 09:08:18] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:08:18] [INFO ] Invariant cache hit.
[2024-05-21 09:08:19] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-21 09:08:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:08:19] [INFO ] Invariant cache hit.
[2024-05-21 09:08:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 09:08:20] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
[2024-05-21 09:08:20] [INFO ] Redundant transitions in 52 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 09:08:20] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:08:20] [INFO ] Invariant cache hit.
[2024-05-21 09:08:20] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 09:08:45] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 74209ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75751 ms. Remains : 184/184 places, 2028/2028 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 10] Max Struct:[50, 50]
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-05-21 09:09:34] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:09:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (14 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10000 steps (5 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 09:09:34] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 09:09:34] [INFO ] Invariant cache hit.
[2024-05-21 09:09:34] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 09:09:34] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-21 09:09:34] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 09:09:34] [INFO ] [Real]Added 21 Read/Feed constraints in 53 ms returned sat
[2024-05-21 09:09:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:09:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 09:09:35] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-21 09:09:35] [INFO ] [Nat]Added 21 Read/Feed constraints in 39 ms returned sat
[2024-05-21 09:09:35] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 68 ms.
[2024-05-21 09:09:35] [INFO ] Added : 10 causal constraints over 2 iterations in 247 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 2027
Applied a total of 2 rules in 226 ms. Remains 183 /184 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 09:09:36] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-05-21 09:09:36] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 09:09:36] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 09:10:01] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 56620ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 56644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56875 ms. Remains : 183/184 places, 2027/2028 transitions.
[2024-05-21 09:10:32] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 09:10:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (1643 resets) in 6132 ms. (163 steps per ms)
BEST_FIRST walk for 1000000 steps (695 resets) in 2466 ms. (405 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 09:10:41] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 09:10:41] [INFO ] Invariant cache hit.
[2024-05-21 09:10:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 09:10:41] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-21 09:10:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:10:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 09:10:41] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-21 09:10:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 09:10:41] [INFO ] [Nat]Added 21 Read/Feed constraints in 39 ms returned sat
[2024-05-21 09:10:41] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 0 ms to minimize.
[2024-05-21 09:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2024-05-21 09:10:42] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 67 ms.
[2024-05-21 09:10:42] [INFO ] Added : 11 causal constraints over 3 iterations in 176 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 151 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 149 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 09:10:43] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 09:10:43] [INFO ] Invariant cache hit.
[2024-05-21 09:10:43] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 09:10:43] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 09:10:43] [INFO ] Invariant cache hit.
[2024-05-21 09:10:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 09:10:44] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2024-05-21 09:10:44] [INFO ] Redundant transitions in 32 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 09:10:44] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 09:10:44] [INFO ] Invariant cache hit.
[2024-05-21 09:10:44] [INFO ] State equation strengthened by 21 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BridgeAndVehicles-COL-V80P50N10
IS_COLORED=1
IS_NUPN=
LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 15
TRANSITIONS: 11
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 4
ARCS: 56
LOADING TIME: 0.166
UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 188
TRANSITIONS: 2108
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 15950
UNFOLDING TIME: 5.238
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.094
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 5.681
OK.
----------------------------------------------------------------------
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: 853
MODEL NAME: /home/mcc/execution/model
188 places, 2108 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-V80P50N10-UpperBounds-00 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-02 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-03 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-04 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-06 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-08 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-10 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-11 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-12 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-14 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716282708030
--------------------
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-V80P50N10"
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-V80P50N10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397600141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;