MCC'2024- Execution of r047-tajo-171620397500117

About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V80P20N10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16046.831	1014401.00	1486162.00	260.80	80 1 20 80 10 80 80 1 80 80 1 80 80 80 10 ?	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397500117.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-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 13K Apr 13 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 01:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716280449401

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-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:34:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 08:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:34:10] [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:34:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:34:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 525 ms
[2024-05-21 08:34:11] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-21 08:34:11] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 08:34:11] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:34:11] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[80, 1, 20, 0, 0, 0, 80, 0, 0] Max Struct:[80, 1, 20, 80, 20, 80, 80, 1, 20]
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-13 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-08 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 08:34:11] [INFO ] Invariant cache hit.
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-21 08:34:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 08:34:11] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 10 ms.
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 08:34:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 08:34:11] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 08:34:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:34:11] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 08:34:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:34:11] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 2 ms.
[2024-05-21 08:34:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:34:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:34:11] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-21 08:34:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 08:34:11] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:34:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 08:34:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 08:34:11] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[80, 20, 80, 1, 20]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:34:12] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 155 ms.
[2024-05-21 08:34:12] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[80, 20, 80, 1, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[80, 20, 80, 1, 20]
[2024-05-21 08:34:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 08:34:12] [INFO ] Computed 7 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[80, 20, 80, 1, 20]
RANDOM walk for 10000 steps (14 resets) in 287 ms. (34 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (11 resets) in 61 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 6] Max Struct:[20, 20]
[2024-05-21 08:34:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:34:12] [INFO ] Invariant cache hit.
[2024-05-21 08:34:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 08:34:12] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-21 08:34:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:34:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 08:34:12] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 08:34:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:34:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 42 ms returned sat
[2024-05-21 08:34:13] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 56 ms to minimize.
[2024-05-21 08:34:13] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 2 ms to minimize.
[2024-05-21 08:34:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 805 ms
[2024-05-21 08:34:13] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 119 ms.
[2024-05-21 08:34:13] [INFO ] Added : 10 causal constraints over 2 iterations in 278 ms. Result :sat
Minimization took 330 ms.
[2024-05-21 08:34:14] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-21 08:34:14] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-21 08:34:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:34:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 08:34:14] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 08:34:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2024-05-21 08:34:14] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 2 ms to minimize.
[2024-05-21 08:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2024-05-21 08:34:15] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 144 ms.
[2024-05-21 08:34:15] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 2 ms to minimize.
[2024-05-21 08:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-05-21 08:34:15] [INFO ] Added : 8 causal constraints over 8 iterations in 854 ms. Result :sat
Minimization took 331 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 6] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 376 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 08:34:16] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-21 08:34:16] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 08:34:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 08:34:42] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 54501ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 54560ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54968 ms. Remains : 186/188 places, 2108/2108 transitions.
[2024-05-21 08:35:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (1423 resets) in 6805 ms. (146 steps per ms)
BEST_FIRST walk for 2000001 steps (1083 resets) in 4602 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2024-05-21 08:35:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:22] [INFO ] Invariant cache hit.
[2024-05-21 08:35:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:35:22] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-21 08:35:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:35:22] [INFO ] [Real]Added 22 Read/Feed constraints in 19 ms returned sat
[2024-05-21 08:35:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:35:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:35:23] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-21 08:35:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 26 ms returned sat
[2024-05-21 08:35:23] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 51 ms.
[2024-05-21 08:35:23] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2024-05-21 08:35:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-21 08:35:23] [INFO ] Added : 10 causal constraints over 2 iterations in 503 ms. Result :sat
Minimization took 252 ms.
[2024-05-21 08:35:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:35:24] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-21 08:35:24] [INFO ] [Real]Added 22 Read/Feed constraints in 30 ms returned sat
[2024-05-21 08:35:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:35:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:35:24] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-21 08:35:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 40 ms returned sat
[2024-05-21 08:35:24] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2024-05-21 08:35:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2024-05-21 08:35:24] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 63 ms.
[2024-05-21 08:35:25] [INFO ] Added : 12 causal constraints over 10 iterations in 350 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 220 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 226 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-21 08:35:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:26] [INFO ] Invariant cache hit.
[2024-05-21 08:35:26] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-21 08:35:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:26] [INFO ] Invariant cache hit.
[2024-05-21 08:35:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:35:27] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1929 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 194 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2351 ms. Remains : 184/186 places, 2108/2108 transitions.
[2024-05-21 08:35:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2024-05-21 08:35:28] [INFO ] Computed 5 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (1423 resets) in 5580 ms. (179 steps per ms)
BEST_FIRST walk for 2000002 steps (1082 resets) in 4051 ms. (493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2024-05-21 08:35:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:37] [INFO ] Invariant cache hit.
[2024-05-21 08:35:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:35:37] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-21 08:35:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:35:38] [INFO ] [Real]Added 22 Read/Feed constraints in 20 ms returned sat
[2024-05-21 08:35:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:35:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:35:38] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-21 08:35:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 39 ms returned sat
[2024-05-21 08:35:38] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 58 ms.
[2024-05-21 08:35:38] [INFO ] Added : 10 causal constraints over 2 iterations in 314 ms. Result :sat
Minimization took 260 ms.
[2024-05-21 08:35:38] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:35:38] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-21 08:35:38] [INFO ] [Real]Added 22 Read/Feed constraints in 19 ms returned sat
[2024-05-21 08:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:35:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:35:39] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 08:35:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 29 ms returned sat
[2024-05-21 08:35:39] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 58 ms.
[2024-05-21 08:35:39] [INFO ] Added : 7 causal constraints over 6 iterations in 431 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 184 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 177 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-21 08:35:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:40] [INFO ] Invariant cache hit.
[2024-05-21 08:35:40] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-21 08:35:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:40] [INFO ] Invariant cache hit.
[2024-05-21 08:35:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:35:41] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2024-05-21 08:35:41] [INFO ] Redundant transitions in 112 ms returned []
Running 2105 sub problems to find dead transitions.
[2024-05-21 08:35:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:35:41] [INFO ] Invariant cache hit.
[2024-05-21 08:35:41] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 08:36:08] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 2 ms to minimize.
[2024-05-21 08:36:25] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 76316ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 76366ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/184 places, 2028/2108 transitions.
Applied a total of 0 rules in 202 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 08:36:58] [INFO ] Redundant transitions in 72 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78253 ms. Remains : 184/184 places, 2028/2108 transitions.
[2024-05-21 08:36:58] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-05-21 08:36:58] [INFO ] Computed 5 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (1423 resets) in 5463 ms. (183 steps per ms)
BEST_FIRST walk for 2000002 steps (1082 resets) in 3806 ms. (525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2024-05-21 08:37:07] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:37:07] [INFO ] Invariant cache hit.
[2024-05-21 08:37:07] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-21 08:37:07] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-21 08:37:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:37:08] [INFO ] [Real]Added 21 Read/Feed constraints in 22 ms returned sat
[2024-05-21 08:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:37:08] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-21 08:37:08] [INFO ] [Nat]Added 21 Read/Feed constraints in 36 ms returned sat
[2024-05-21 08:37:08] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 50 ms.
[2024-05-21 08:37:08] [INFO ] Added : 10 causal constraints over 2 iterations in 249 ms. Result :sat
Minimization took 252 ms.
[2024-05-21 08:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:37:08] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-21 08:37:08] [INFO ] [Real]Added 21 Read/Feed constraints in 18 ms returned sat
[2024-05-21 08:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:37:09] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-21 08:37:09] [INFO ] [Nat]Added 21 Read/Feed constraints in 29 ms returned sat
[2024-05-21 08:37:09] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 53 ms.
[2024-05-21 08:37:09] [INFO ] Added : 12 causal constraints over 10 iterations in 265 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 118 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 118 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 08:37:10] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:37:10] [INFO ] Invariant cache hit.
[2024-05-21 08:37:10] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-21 08:37:10] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:37:10] [INFO ] Invariant cache hit.
[2024-05-21 08:37:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:37:11] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2024-05-21 08:37:11] [INFO ] Redundant transitions in 44 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 08:37:11] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:37:11] [INFO ] Invariant cache hit.
[2024-05-21 08:37:11] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 08:37:34] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 74420ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75704 ms. Remains : 184/184 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 1137 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 434 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 244928 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 4
Probabilistic random walk after 244928 steps, saw 67620 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-21 08:38:29] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:38:29] [INFO ] Invariant cache hit.
[2024-05-21 08:38:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 08:38:30] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 08:38:30] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/553 variables, 13/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3183ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2345 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 129 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 08:38:35] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:38:35] [INFO ] Invariant cache hit.
[2024-05-21 08:38:35] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 08:38:59] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54091ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54253 ms. Remains : 184/184 places, 2028/2028 transitions.
RANDOM walk for 40001 steps (56 resets) in 481 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (20 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40005 steps (20 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 259821 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 4
Probabilistic random walk after 259821 steps, saw 71616 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-21 08:39:32] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:39:32] [INFO ] Invariant cache hit.
[2024-05-21 08:39:32] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 08:39:33] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 08:39:33] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/553 variables, 13/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3424ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1899 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 178 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 147 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 08:39:38] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:39:38] [INFO ] Invariant cache hit.
[2024-05-21 08:39:38] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 08:39:38] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:39:38] [INFO ] Invariant cache hit.
[2024-05-21 08:39:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:39:39] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2024-05-21 08:39:39] [INFO ] Redundant transitions in 31 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 08:39:39] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:39:39] [INFO ] Invariant cache hit.
[2024-05-21 08:39:39] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 08:40:04] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 75481ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 75510ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76768 ms. Remains : 184/184 places, 2028/2028 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 10] Max Struct:[20, 20]
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-21 08:40:55] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:40:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (14 resets) in 60 ms. (163 steps per ms)
BEST_FIRST walk for 10000 steps (5 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 08:40:55] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:40:55] [INFO ] Invariant cache hit.
[2024-05-21 08:40:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:40:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-21 08:40:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:40:55] [INFO ] [Real]Added 21 Read/Feed constraints in 14 ms returned sat
[2024-05-21 08:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:40:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:40:55] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 08:40:55] [INFO ] [Nat]Added 21 Read/Feed constraints in 31 ms returned sat
[2024-05-21 08:40:55] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 60 ms.
[2024-05-21 08:40:55] [INFO ] Added : 10 causal constraints over 2 iterations in 239 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 2027
Applied a total of 2 rules in 215 ms. Remains 183 /184 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:40:56] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-05-21 08:40:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 08:40:56] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:41:20] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
(s97 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 20.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55246ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55273ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55496 ms. Remains : 183/184 places, 2027/2028 transitions.
[2024-05-21 08:41:51] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:41:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 6033 ms. (165 steps per ms)
BEST_FIRST walk for 1000001 steps (695 resets) in 2520 ms. (396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 08:42:00] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:42:00] [INFO ] Invariant cache hit.
[2024-05-21 08:42:00] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:42:00] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-21 08:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:42:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:42:00] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-21 08:42:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:42:00] [INFO ] [Nat]Added 21 Read/Feed constraints in 30 ms returned sat
[2024-05-21 08:42:00] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 0 ms to minimize.
[2024-05-21 08:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-05-21 08:42:01] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 57 ms.
[2024-05-21 08:42:01] [INFO ] Added : 11 causal constraints over 3 iterations in 218 ms. Result :sat
Minimization took 327 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 157 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 08:42:02] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:42:02] [INFO ] Invariant cache hit.
[2024-05-21 08:42:02] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-21 08:42:02] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:42:02] [INFO ] Invariant cache hit.
[2024-05-21 08:42:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:42:03] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2024-05-21 08:42:03] [INFO ] Redundant transitions in 30 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:42:03] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:42:03] [INFO ] Invariant cache hit.
[2024-05-21 08:42:03] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:42:26] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 74771ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 74798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76718 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 650 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (25 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (27 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 230979 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 230979 steps, saw 63533 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 08:43:22] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:43:22] [INFO ] Invariant cache hit.
[2024-05-21 08:43:22] [INFO ] State equation strengthened by 21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:43:22] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/388 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:43:22] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/551 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/551 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2356 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3117ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 383 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 157 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:43:25] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:43:25] [INFO ] Invariant cache hit.
[2024-05-21 08:43:25] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:43:49] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55690ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55879 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 680 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40009 steps (27 resets) in 328 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (26 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 237153 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 237153 steps, saw 65194 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-21 08:44:25] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:44:25] [INFO ] Invariant cache hit.
[2024-05-21 08:44:25] [INFO ] State equation strengthened by 21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:44:25] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/388 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:44:25] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/551 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/551 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2812 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3874ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 325 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 181 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 182 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 08:44:29] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:44:29] [INFO ] Invariant cache hit.
[2024-05-21 08:44:30] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-21 08:44:30] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:44:30] [INFO ] Invariant cache hit.
[2024-05-21 08:44:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:44:31] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2024-05-21 08:44:31] [INFO ] Redundant transitions in 76 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:44:31] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:44:31] [INFO ] Invariant cache hit.
[2024-05-21 08:44:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:44:54] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 74976ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 75017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77178 ms. Remains : 183/183 places, 2027/2027 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-04 in 291496 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-21 08:45:46] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-05-21 08:45:46] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (14 resets) in 76 ms. (129 steps per ms)
BEST_FIRST walk for 10000 steps (5 resets) in 26 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 08:45:46] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:45:46] [INFO ] Invariant cache hit.
[2024-05-21 08:45:46] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:45:46] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-21 08:45:46] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:45:46] [INFO ] [Real]Added 21 Read/Feed constraints in 18 ms returned sat
[2024-05-21 08:45:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:45:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:45:47] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-21 08:45:47] [INFO ] [Nat]Added 21 Read/Feed constraints in 31 ms returned sat
[2024-05-21 08:45:47] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 58 ms.
[2024-05-21 08:45:47] [INFO ] Added : 12 causal constraints over 10 iterations in 324 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 2027
Applied a total of 2 rules in 193 ms. Remains 183 /184 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:45:48] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-05-21 08:45:48] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 08:45:48] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:46:13] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55593ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55622ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55824 ms. Remains : 183/184 places, 2027/2028 transitions.
[2024-05-21 08:46:43] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:46:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 6302 ms. (158 steps per ms)
BEST_FIRST walk for 1000002 steps (671 resets) in 2421 ms. (412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 08:46:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:46:52] [INFO ] Invariant cache hit.
[2024-05-21 08:46:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:46:52] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-21 08:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:46:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 08:46:52] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-21 08:46:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:46:52] [INFO ] [Nat]Added 21 Read/Feed constraints in 42 ms returned sat
[2024-05-21 08:46:52] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 51 ms.
[2024-05-21 08:46:53] [INFO ] Added : 7 causal constraints over 6 iterations in 402 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 165 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 141 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 08:46:53] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:46:53] [INFO ] Invariant cache hit.
[2024-05-21 08:46:54] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-21 08:46:54] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:46:54] [INFO ] Invariant cache hit.
[2024-05-21 08:46:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:46:55] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2024-05-21 08:46:55] [INFO ] Redundant transitions in 34 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:46:55] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:46:55] [INFO ] Invariant cache hit.
[2024-05-21 08:46:55] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:47:18] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 74488ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 74512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76025 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 489 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40009 steps (24 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 252741 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 252741 steps, saw 76934 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 08:48:12] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:48:12] [INFO ] Invariant cache hit.
[2024-05-21 08:48:12] [INFO ] State equation strengthened by 21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:48:13] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 115/388 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/551 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1510ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 138 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:48:14] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:48:14] [INFO ] Invariant cache hit.
[2024-05-21 08:48:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:48:41] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55288ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55457 ms. Remains : 183/183 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 450 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 247687 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 247687 steps, saw 75479 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-21 08:49:13] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:49:13] [INFO ] Invariant cache hit.
[2024-05-21 08:49:13] [INFO ] State equation strengthened by 21 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) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 08:49:13] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 115/388 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/550 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/551 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/388 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/550 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/551 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 192 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 198 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 175 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 08:49:15] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:49:15] [INFO ] Invariant cache hit.
[2024-05-21 08:49:16] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-21 08:49:16] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:49:16] [INFO ] Invariant cache hit.
[2024-05-21 08:49:16] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:49:17] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-05-21 08:49:17] [INFO ] Redundant transitions in 57 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:49:17] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:49:17] [INFO ] Invariant cache hit.
[2024-05-21 08:49:17] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:49:43] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 76043ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 76071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77918 ms. Remains : 183/183 places, 2027/2027 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-14 in 286858 ms.
[2024-05-21 08:50:33] [INFO ] Flatten gal took : 178 ms
[2024-05-21 08:50:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 08:50:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 2028 transitions and 14986 arcs took 14 ms.
Total runtime 983143 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V80P20N10

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: 184
TRANSITIONS: 2028
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.113s, Sys 0.000s]

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

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

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

Process ID: 1054
MODEL NAME: /home/mcc/execution/416/model
184 places, 2028 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-V80P20N10-UpperBounds-04 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-14 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716281463802

--------------------
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-V80P20N10"
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-V80P20N10, 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-171620397500117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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