fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r472-tajo-171620398700069
Last Updated
July 7, 2024

About the Execution of LTSMin+red for BridgeAndVehicles-COL-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13008.848 748594.00 901007.00 210.20 50 50 20 1 50 50 ? ? 50 50 1 50 1 1 ? 50 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620398700069.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-COL-V50P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.7K Apr 13 00:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 00:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 00:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 00:33 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 13 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717218304820

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:05:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:05:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:05:06] [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-06-01 05:05:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:05:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 792 ms
[2024-06-01 05:05:07] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2024-06-01 05:05:07] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 15 ms.
[2024-06-01 05:05:07] [INFO ] Skeletonized 10 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-06-01 05:05:07] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 50, 20, 1, 0, 0, 0, 1, 50, 0] Max Struct:[50, 50, 20, 1, 50, 20, 20, 1, 50, 1]
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 05:05:07] [INFO ] Invariant cache hit.
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:05:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:05:07] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 05:05:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:05:07] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 05:05:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:05:07] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 05:05:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:05:07] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:05:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:05:08] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 20, 1]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 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-06-01 05:05:08] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 74 ms.
[2024-06-01 05:05:08] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 20, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 20, 1]
[2024-06-01 05:05:08] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-06-01 05:05:08] [INFO ] Computed 7 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 20, 1]
RANDOM walk for 10002 steps (22 resets) in 215 ms. (46 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (24 resets) in 96 ms. (309 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2024-06-01 05:05:08] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2024-06-01 05:05:08] [INFO ] Invariant cache hit.
[2024-06-01 05:05:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 05:05:08] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-01 05:05:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 05:05:08] [INFO ] [Real]Added 22 Read/Feed constraints in 42 ms returned sat
[2024-06-01 05:05:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 05:05:08] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 05:05:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 39 ms returned sat
[2024-06-01 05:05:09] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 38 ms to minimize.
[2024-06-01 05:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 503 ms
[2024-06-01 05:05:09] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 123 ms.
[2024-06-01 05:05:09] [INFO ] Added : 11 causal constraints over 10 iterations in 407 ms. Result :sat
Minimization took 233 ms.
[2024-06-01 05:05:10] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 05:05:10] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-01 05:05:10] [INFO ] [Real]Added 22 Read/Feed constraints in 32 ms returned sat
[2024-06-01 05:05:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 05:05:10] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-06-01 05:05:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 47 ms returned sat
[2024-06-01 05:05:10] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 92 ms.
[2024-06-01 05:05:10] [INFO ] Added : 10 causal constraints over 2 iterations in 234 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 246 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-06-01 05:05:11] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2024-06-01 05:05:11] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:05:12] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 05:05:23] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 2 ms to minimize.
[2024-06-01 05:05:29] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 12 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-06-01 05:05:33] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/376 variables, 126/134 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 22/156 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1379 constraints, problems are : Problem set: 102 solved, 1223 unsolved in 21826 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1223/1325 constraints, Known Traps: 3/3 constraints]
After SMT, in 48762ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 48825ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/128 places, 1226/1328 transitions.
Applied a total of 0 rules in 73 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49170 ms. Remains : 126/128 places, 1226/1328 transitions.
[2024-06-01 05:06:00] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-06-01 05:06:00] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (2272 resets) in 4756 ms. (210 steps per ms)
BEST_FIRST walk for 2000002 steps (1683 resets) in 3415 ms. (585 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2024-06-01 05:06:08] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:06:08] [INFO ] Invariant cache hit.
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 05:06:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:06:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 05:06:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:06:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 37 ms returned sat
[2024-06-01 05:06:09] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2024-06-01 05:06:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-06-01 05:06:09] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 32 ms.
[2024-06-01 05:06:09] [INFO ] Added : 3 causal constraints over 2 iterations in 106 ms. Result :sat
Minimization took 122 ms.
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 05:06:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:06:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:06:10] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-01 05:06:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 14 ms returned sat
[2024-06-01 05:06:10] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:06:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-06-01 05:06:10] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 34 ms.
[2024-06-01 05:06:10] [INFO ] Added : 10 causal constraints over 2 iterations in 116 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 86 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 126/126 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 227 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-06-01 05:06:11] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:06:11] [INFO ] Invariant cache hit.
[2024-06-01 05:06:11] [INFO ] Implicit Places using invariants in 271 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 277 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 89 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 597 ms. Remains : 124/126 places, 1226/1226 transitions.
[2024-06-01 05:06:11] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-06-01 05:06:11] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (2272 resets) in 3626 ms. (275 steps per ms)
BEST_FIRST walk for 2000002 steps (1682 resets) in 2701 ms. (740 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2024-06-01 05:06:17] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:06:17] [INFO ] Invariant cache hit.
[2024-06-01 05:06:17] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:06:17] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 05:06:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:06:17] [INFO ] [Real]Added 20 Read/Feed constraints in 13 ms returned sat
[2024-06-01 05:06:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:06:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:06:18] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 05:06:18] [INFO ] [Nat]Added 20 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:06:18] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 31 ms.
[2024-06-01 05:06:18] [INFO ] Added : 12 causal constraints over 10 iterations in 173 ms. Result :sat
Minimization took 109 ms.
[2024-06-01 05:06:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:06:18] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 05:06:18] [INFO ] [Real]Added 20 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:06:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:06:18] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 05:06:18] [INFO ] [Nat]Added 20 Read/Feed constraints in 19 ms returned sat
[2024-06-01 05:06:18] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 35 ms.
[2024-06-01 05:06:18] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2024-06-01 05:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-06-01 05:06:19] [INFO ] Added : 11 causal constraints over 3 iterations in 411 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 57 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 57 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-06-01 05:06:19] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:06:19] [INFO ] Invariant cache hit.
[2024-06-01 05:06:19] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 05:06:19] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:06:19] [INFO ] Invariant cache hit.
[2024-06-01 05:06:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:06:20] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2024-06-01 05:06:20] [INFO ] Redundant transitions in 63 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:06:20] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:06:20] [INFO ] Invariant cache hit.
[2024-06-01 05:06:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:06:29] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 65081ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66063 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40001 steps (88 resets) in 1197 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 325 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 265730 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 4
Probabilistic random walk after 265730 steps, saw 73104 distinct states, run finished after 3004 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 05:07:29] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:07:29] [INFO ] Invariant cache hit.
[2024-06-01 05:07:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:07:29] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:07:29] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-06-01 05:07:30] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2664ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 928 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 48 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:07:32] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:07:32] [INFO ] Invariant cache hit.
[2024-06-01 05:07:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:07:41] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 44886ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 44899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44953 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 751 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40010 steps (30 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40009 steps (32 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 350992 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 4
Probabilistic random walk after 350992 steps, saw 96143 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-06-01 05:08:21] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:08:21] [INFO ] Invariant cache hit.
[2024-06-01 05:08:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:08:21] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:08:22] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 4 ms to minimize.
[2024-06-01 05:08:22] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 4 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/370 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2006ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1121 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 44 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 43 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-06-01 05:08:24] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:08:24] [INFO ] Invariant cache hit.
[2024-06-01 05:08:24] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 05:08:24] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:08:24] [INFO ] Invariant cache hit.
[2024-06-01 05:08:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:08:25] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-06-01 05:08:25] [INFO ] Redundant transitions in 23 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:08:25] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:08:25] [INFO ] Invariant cache hit.
[2024-06-01 05:08:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:08:34] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 64712ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 64725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65484 ms. Remains : 124/124 places, 1226/1226 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 10] Max Struct:[20, 20]
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-06-01 05:09:30] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:09:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (22 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10000 steps (8 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 05:09:30] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:09:30] [INFO ] Invariant cache hit.
[2024-06-01 05:09:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:09:30] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 05:09:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:09:30] [INFO ] [Real]Added 20 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:09:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:09:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:09:30] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-01 05:09:30] [INFO ] [Nat]Added 20 Read/Feed constraints in 42 ms returned sat
[2024-06-01 05:09:30] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 26 ms.
[2024-06-01 05:09:30] [INFO ] Added : 12 causal constraints over 10 iterations in 298 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 115 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:09:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:09:31] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:09:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:09:40] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20371 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45752ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45771ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45890 ms. Remains : 123/124 places, 1225/1226 transitions.
[2024-06-01 05:10:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 4342 ms. (230 steps per ms)
BEST_FIRST walk for 1000001 steps (1028 resets) in 1755 ms. (569 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 05:10:22] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:22] [INFO ] Invariant cache hit.
[2024-06-01 05:10:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:10:23] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 05:10:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:10:23] [INFO ] [Real]Added 20 Read/Feed constraints in 14 ms returned sat
[2024-06-01 05:10:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:10:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:10:23] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 05:10:23] [INFO ] [Nat]Added 20 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:10:23] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 35 ms.
[2024-06-01 05:10:23] [INFO ] Added : 3 causal constraints over 2 iterations in 113 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 60 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 05:10:23] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:23] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-06-01 05:10:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:24] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:10:24] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2024-06-01 05:10:24] [INFO ] Redundant transitions in 16 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:10:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:24] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:10:33] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:10:58] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1372 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65299ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66311 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 523 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 367037 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 367037 steps, saw 104527 distinct states, run finished after 3002 ms. (steps per millisecond=122 ) properties seen :0
[2024-06-01 05:11:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:11:33] [INFO ] Invariant cache hit.
[2024-06-01 05:11:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:11:33] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:11:33] [INFO ] Deduced a trap composed of 10 places in 330 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 153 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 70 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:11:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:11:34] [INFO ] Invariant cache hit.
[2024-06-01 05:11:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:11:45] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46744ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46835 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 414303 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 414303 steps, saw 117472 distinct states, run finished after 3003 ms. (steps per millisecond=137 ) properties seen :0
[2024-06-01 05:12:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:12:24] [INFO ] Invariant cache hit.
[2024-06-01 05:12:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:12:25] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:12:25] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1154ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 57 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 46 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 05:12:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:12:26] [INFO ] Invariant cache hit.
[2024-06-01 05:12:26] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 05:12:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:12:26] [INFO ] Invariant cache hit.
[2024-06-01 05:12:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:12:26] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 05:12:26] [INFO ] Redundant transitions in 11 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:12:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:12:26] [INFO ] Invariant cache hit.
[2024-06-01 05:12:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:12:36] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:12:58] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1372 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65537ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66217 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-06 in 242350 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-06-01 05:13:32] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-06-01 05:13:32] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (22 resets) in 42 ms. (232 steps per ms)
BEST_FIRST walk for 10000 steps (8 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 05:13:32] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:13:32] [INFO ] Invariant cache hit.
[2024-06-01 05:13:32] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:13:32] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 05:13:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:13:32] [INFO ] [Real]Added 20 Read/Feed constraints in 16 ms returned sat
[2024-06-01 05:13:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:13:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:13:32] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 05:13:32] [INFO ] [Nat]Added 20 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:13:32] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 35 ms.
[2024-06-01 05:13:33] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-06-01 05:13:33] [INFO ] Added : 11 causal constraints over 3 iterations in 474 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 74 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:13:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:13:33] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:13:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:13:43] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45354ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45449 ms. Remains : 123/124 places, 1225/1226 transitions.
[2024-06-01 05:14:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2623 resets) in 4095 ms. (244 steps per ms)
BEST_FIRST walk for 1000000 steps (1085 resets) in 1509 ms. (662 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-06-01 05:14:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:24] [INFO ] Invariant cache hit.
[2024-06-01 05:14:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:14:24] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 05:14:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:14:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:14:24] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 05:14:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:14:24] [INFO ] [Nat]Added 20 Read/Feed constraints in 22 ms returned sat
[2024-06-01 05:14:25] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 38 ms.
[2024-06-01 05:14:25] [INFO ] Added : 10 causal constraints over 2 iterations in 140 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 55 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 05:14:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:25] [INFO ] Invariant cache hit.
[2024-06-01 05:14:25] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 05:14:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:25] [INFO ] Invariant cache hit.
[2024-06-01 05:14:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:14:26] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-06-01 05:14:26] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:14:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:26] [INFO ] Invariant cache hit.
[2024-06-01 05:14:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:14:35] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:14:59] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1372 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65130ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66089 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 441 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (41 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 323998 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 2
Probabilistic random walk after 323998 steps, saw 89543 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-06-01 05:15:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:15:34] [INFO ] Invariant cache hit.
[2024-06-01 05:15:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:15:35] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2024-06-01 05:15:35] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 311 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 87 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:15:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:15:36] [INFO ] Invariant cache hit.
[2024-06-01 05:15:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:15:46] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46433ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46541 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 582 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (40 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 401866 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 401866 steps, saw 111184 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-06-01 05:16:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:16:26] [INFO ] Invariant cache hit.
[2024-06-01 05:16:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:16:26] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-06-01 05:16:26] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1050ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 206 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 78 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 05:16:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:16:27] [INFO ] Invariant cache hit.
[2024-06-01 05:16:28] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 05:16:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:16:28] [INFO ] Invariant cache hit.
[2024-06-01 05:16:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:16:28] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2024-06-01 05:16:28] [INFO ] Redundant transitions in 11 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:16:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:16:28] [INFO ] Invariant cache hit.
[2024-06-01 05:16:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:16:35] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:17:01] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1372 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 63664ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 63675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64685 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-07 in 240056 ms.
[2024-06-01 05:17:32] [INFO ] Flatten gal took : 198 ms
[2024-06-01 05:17:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 7 ms.
[2024-06-01 05:17:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 1226 transitions and 9000 arcs took 20 ms.
Total runtime 746556 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-UpperBounds-07

BK_STOP 1717219053414

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
ub formula formula --maxsum=/tmp/947/ub_0_
ub formula name BridgeAndVehicles-COL-V50P20N10-UpperBounds-07
ub formula formula --maxsum=/tmp/947/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V50P20N10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620398700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P20N10.tgz
mv BridgeAndVehicles-COL-V50P20N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;