Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.4K Apr 13 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 02:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 02:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716278600527

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 08:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:03:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 08:03:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:03:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2024-05-21 08:03:22] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 11
[2024-05-21 08:03:22] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-05-21 08:03:22] [INFO ] Skeletonized 11 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:03:22] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[50, 0, 50, 1, 0, 1, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 1, 50, 1, 50, 1, 50, 50, 1]
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 08:03:22] [INFO ] Invariant cache hit.
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-21 08:03:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 08:03:22] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 08:03:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 08:03:22] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 08:03:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:03:22] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:03:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 08:03:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:03:22] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-21 08:03:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:03:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:03:23] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 08:03:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:03:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 08:03:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 08:03:23] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 08:03:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:03:23] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 08:03:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 08:03:23] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 1, 50, 50, 1]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:03:23] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 69 ms.
[2024-05-21 08:03:23] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 1, 50, 50, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 1, 50, 50, 1]
[2024-05-21 08:03:23] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-21 08:03:23] [INFO ] Computed 7 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 1, 50, 50, 1]
RANDOM walk for 10000 steps (22 resets) in 133 ms. (74 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (17 resets) in 130 ms. (152 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 08:03:23] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2024-05-21 08:03:23] [INFO ] Invariant cache hit.
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 08:03:23] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 08:03:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:03:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 08:03:23] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 08:03:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:03:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 20 ms returned sat
[2024-05-21 08:03:23] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 75 ms.
[2024-05-21 08:03:24] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 12 ms to minimize.
[2024-05-21 08:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-21 08:03:24] [INFO ] Added : 5 causal constraints over 4 iterations in 335 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 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.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 174 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
Running 1324 sub problems to find dead transitions.
[2024-05-21 08:03:24] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2024-05-21 08:03:24] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 08:03:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-05-21 08:03:35] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2024-05-21 08:03:40] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
Problem TDEAD727 is UNSAT
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
[2024-05-21 08:03:44] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
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
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 8 constraints, problems are : Problem set: 100 solved, 1224 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 249/374 variables, 125/133 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 22/155 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1377 constraints, problems are : Problem set: 102 solved, 1222 unsolved in 20123 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1222/1324 constraints, Known Traps: 3/3 constraints]
After SMT, in 45905ms problems are : Problem set: 102 solved, 1222 unsolved
Search for dead transitions found 102 dead transitions in 45940ms
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 : 125/128 places, 1225/1328 transitions.
Applied a total of 0 rules in 80 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46213 ms. Remains : 125/128 places, 1225/1328 transitions.
[2024-05-21 08:04:10] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 08:04:10] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 4618 ms. (216 steps per ms)
BEST_FIRST walk for 1000007 steps (1029 resets) in 1633 ms. (611 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 08:04:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:04:16] [INFO ] Invariant cache hit.
[2024-05-21 08:04:16] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-21 08:04:16] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 08:04:16] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-21 08:04:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:04:16] [INFO ] [Real]Added 20 Read/Feed constraints in 17 ms returned sat
[2024-05-21 08:04:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:04:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-21 08:04:17] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 08:04:17] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 08:04:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2024-05-21 08:04:17] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 13 ms to minimize.
[2024-05-21 08:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-21 08:04:17] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 34 ms.
[2024-05-21 08:04:17] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2024-05-21 08:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-21 08:04:17] [INFO ] Added : 3 causal constraints over 2 iterations in 327 ms. Result :sat
Minimization took 218 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 90 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 125/125 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 71 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:04:17] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:04:17] [INFO ] Invariant cache hit.
[2024-05-21 08:04:18] [INFO ] Implicit Places using invariants in 304 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 88 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 474 ms. Remains : 123/125 places, 1225/1225 transitions.
[2024-05-21 08:04:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 08:04:18] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 4436 ms. (225 steps per ms)
BEST_FIRST walk for 1000001 steps (1027 resets) in 1581 ms. (632 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 08:04:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:04:24] [INFO ] Invariant cache hit.
[2024-05-21 08:04:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:04:24] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-21 08:04:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:04:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:04:24] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-21 08:04:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:04:24] [INFO ] [Nat]Added 20 Read/Feed constraints in 16 ms returned sat
[2024-05-21 08:04:24] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 2 ms to minimize.
[2024-05-21 08:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-05-21 08:04:24] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 33 ms.
[2024-05-21 08:04:25] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 14 ms to minimize.
[2024-05-21 08:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-21 08:04:25] [INFO ] Added : 3 causal constraints over 2 iterations in 337 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 60 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 60 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 48 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:04:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:04:25] [INFO ] Invariant cache hit.
[2024-05-21 08:04:25] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 08:04:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:04:25] [INFO ] Invariant cache hit.
[2024-05-21 08:04:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:04:26] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2024-05-21 08:04:26] [INFO ] Redundant transitions in 61 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:04:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:04:26] [INFO ] Invariant cache hit.
[2024-05-21 08:04: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-05-21 08:04:35] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30060 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 64855ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64875ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66080 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 1150 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 388 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (40 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 379826 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 2
Probabilistic random walk after 379826 steps, saw 108117 distinct states, run finished after 3004 ms. (steps per millisecond=126 ) properties seen :0
[2024-05-21 08:05:35] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:05:35] [INFO ] Invariant cache hit.
[2024-05-21 08:05: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
[2024-05-21 08:05:35] [INFO ] Deduced a trap composed of 4 places in 164 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-05-21 08:05:35] [INFO ] Deduced a trap composed of 5 places in 162 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 736 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 756 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 1511ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 333 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 69 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:05:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:05:37] [INFO ] Invariant cache hit.
[2024-05-21 08:05:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:05:47] [INFO ] Deduced a trap composed of 5 places in 202 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 20027 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 46124ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46215 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 421 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 388938 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 2
Probabilistic random walk after 388938 steps, saw 110502 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-21 08:06:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:06:26] [INFO ] Invariant cache hit.
[2024-05-21 08:06: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
[2024-05-21 08:06:26] [INFO ] Deduced a trap composed of 4 places in 115 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-05-21 08:06:27] [INFO ] Deduced a trap composed of 5 places in 243 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 806 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 566 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 1396ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 233 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:06:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:06:28] [INFO ] Invariant cache hit.
[2024-05-21 08:06:28] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 08:06:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:06:28] [INFO ] Invariant cache hit.
[2024-05-21 08:06:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:06:29] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-05-21 08:06:29] [INFO ] Redundant transitions in 42 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:06:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:06:29] [INFO ] Invariant cache hit.
[2024-05-21 08:06:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:06:38] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 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: 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 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: 1/1 constraints]
After SMT, in 64727ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65627 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-05-21 08:07:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:07:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (26 resets) in 40 ms. (243 steps per ms)
BEST_FIRST walk for 10000 steps (10 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 08:07:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:07:34] [INFO ] Invariant cache hit.
[2024-05-21 08:07:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:07:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 08:07:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:07:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 08:07:34] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 08:07:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:07:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 23 ms returned sat
[2024-05-21 08:07:34] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 2 ms to minimize.
[2024-05-21 08:07:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-21 08:07:34] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 32 ms.
[2024-05-21 08:07:34] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-21 08:07:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-05-21 08:07:34] [INFO ] Added : 3 causal constraints over 2 iterations in 231 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 80 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:07:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:07:34] [INFO ] Invariant cache hit.
[2024-05-21 08:07: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-05-21 08:07:43] [INFO ] Deduced a trap composed of 5 places in 152 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 20027 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 20466 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 45411ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45510 ms. Remains : 123/123 places, 1225/1225 transitions.
[2024-05-21 08:08:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:08:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (2622 resets) in 3789 ms. (263 steps per ms)
BEST_FIRST walk for 1000000 steps (1029 resets) in 1533 ms. (651 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2024-05-21 08:08:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:08:25] [INFO ] Invariant cache hit.
[2024-05-21 08:08:25] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2024-05-21 08:08:25] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 08:08:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:08:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:08:25] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 08:08:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:08:25] [INFO ] [Nat]Added 20 Read/Feed constraints in 24 ms returned sat
[2024-05-21 08:08:26] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 3 ms to minimize.
[2024-05-21 08:08:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-21 08:08:26] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 41 ms.
[2024-05-21 08:08:26] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2024-05-21 08:08:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-21 08:08:26] [INFO ] Added : 3 causal constraints over 2 iterations in 308 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 88 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 88 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 69 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:08:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:08:26] [INFO ] Invariant cache hit.
[2024-05-21 08:08:26] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 08:08:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:08:26] [INFO ] Invariant cache hit.
[2024-05-21 08:08:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:08:27] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-21 08:08:27] [INFO ] Redundant transitions in 22 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:08:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:08:27] [INFO ] Invariant cache hit.
[2024-05-21 08:08:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:08:36] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30023 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 65049ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65971 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 436407 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 436407 steps, saw 123375 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2024-05-21 08:09:35] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:09:35] [INFO ] Invariant cache hit.
[2024-05-21 08:09: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
[2024-05-21 08:09:35] [INFO ] Deduced a trap composed of 4 places in 69 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-05-21 08:09:36] [INFO ] Deduced a trap composed of 5 places in 124 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 531 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 750 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 1307ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 271 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.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:09:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:09:37] [INFO ] Invariant cache hit.
[2024-05-21 08:09:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:09:45] [INFO ] Deduced a trap composed of 5 places in 168 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 20023 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 20025 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 44847ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44921 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (40 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 382661 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 2
Probabilistic random walk after 382661 steps, saw 108864 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2024-05-21 08:10:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:10:25] [INFO ] Invariant cache hit.
[2024-05-21 08:10:25] [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-05-21 08:10:25] [INFO ] Deduced a trap composed of 4 places in 127 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-05-21 08:10:26] [INFO ] Deduced a trap composed of 5 places in 192 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 766 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 753 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 1538ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 291 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 57 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 57 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:10:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:10:27] [INFO ] Invariant cache hit.
[2024-05-21 08:10:27] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 08:10:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:10:27] [INFO ] Invariant cache hit.
[2024-05-21 08:10:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:10:28] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2024-05-21 08:10:28] [INFO ] Redundant transitions in 15 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:10:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:10:28] [INFO ] Invariant cache hit.
[2024-05-21 08:10: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-05-21 08:10:37] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 64862ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64876ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65718 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[50]
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-08 in 239069 ms.
[2024-05-21 08:11:33] [INFO ] Flatten gal took : 149 ms
[2024-05-21 08:11:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 16 ms.
[2024-05-21 08:11:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 1225 transitions and 8998 arcs took 36 ms.
Total runtime 491531 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V50P50N10

IS_COLORED=
IS_NUPN=

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


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


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

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

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

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

BK_STOP 1716279096922

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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