About the Execution of GreatSPN+red for Peterson-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9400.815 | 3600000.00 | 11745870.00 | 2083.60 | 8 8 ? 8 8 7 ? 7 8 8 8 8 8 8 ? 8 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r267-smll-171654406000245.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Peterson-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 03:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 03:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 04:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 47K May 18 16:43 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 Peterson-COL-7-UpperBounds-00
FORMULA_NAME Peterson-COL-7-UpperBounds-01
FORMULA_NAME Peterson-COL-7-UpperBounds-02
FORMULA_NAME Peterson-COL-7-UpperBounds-03
FORMULA_NAME Peterson-COL-7-UpperBounds-04
FORMULA_NAME Peterson-COL-7-UpperBounds-05
FORMULA_NAME Peterson-COL-7-UpperBounds-06
FORMULA_NAME Peterson-COL-7-UpperBounds-07
FORMULA_NAME Peterson-COL-7-UpperBounds-08
FORMULA_NAME Peterson-COL-7-UpperBounds-09
FORMULA_NAME Peterson-COL-7-UpperBounds-10
FORMULA_NAME Peterson-COL-7-UpperBounds-11
FORMULA_NAME Peterson-COL-7-UpperBounds-12
FORMULA_NAME Peterson-COL-7-UpperBounds-13
FORMULA_NAME Peterson-COL-7-UpperBounds-14
FORMULA_NAME Peterson-COL-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716760573490
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 21:56:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 21:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 21:56:15] [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-26 21:56:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 21:56:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1388 ms
[2024-05-26 21:56:17] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-26 21:56:17] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-26 21:56:17] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-26 21:56:17] [INFO ] Computed 1 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 8, 0, 7, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 7, 8, 8, 8]
FORMULA Peterson-COL-7-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-26 21:56:17] [INFO ] Invariant cache hit.
[2024-05-26 21:56:17] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-26 21:56:17] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-26 21:56:17] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-26 21:56:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:17] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-26 21:56:17] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 21:56:17] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 14 ms.
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 21:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-26 21:56:18] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 21:56:18] [INFO ] Added : 12 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:56:18] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 21:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:56:18] [INFO ] Added : 11 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 21:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:56:18] [INFO ] Added : 11 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 21:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:56:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 21:56:18] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:56:18] [INFO ] Added : 11 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8]
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 21:56:19] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 185 ms.
[2024-05-26 21:56:19] [INFO ] Unfolded 7 HLPN properties in 2 ms.
Deduced a syphon composed of 56 places in 43 ms
Reduce places removed 56 places and 112 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8]
[2024-05-26 21:56:19] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-05-26 21:56:19] [INFO ] Computed 31 invariants in 72 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 10000 steps (2 resets) in 664 ms. (15 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 623 ms. (80 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 6] Max Struct:[8, 8, 8]
[2024-05-26 21:56:20] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-26 21:56:20] [INFO ] Invariant cache hit.
[2024-05-26 21:56:21] [INFO ] [Real]Absence check using 23 positive place invariants in 64 ms returned sat
[2024-05-26 21:56:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 36 ms returned sat
[2024-05-26 21:56:22] [INFO ] [Real]Absence check using state equation in 1701 ms returned sat
[2024-05-26 21:56:23] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:56:23] [INFO ] [Real]Added 497 Read/Feed constraints in 77 ms returned sat
[2024-05-26 21:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 89 ms returned sat
[2024-05-26 21:56:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2024-05-26 21:56:25] [INFO ] [Nat]Absence check using state equation in 1563 ms returned sat
[2024-05-26 21:56:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 21:56:26] [INFO ] [Nat]Added 497 Read/Feed constraints in 591 ms returned sat
[2024-05-26 21:56:26] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 352 ms.
[2024-05-26 21:56:28] [INFO ] Added : 20 causal constraints over 4 iterations in 1979 ms. Result :unknown
[2024-05-26 21:56:28] [INFO ] [Real]Absence check using 23 positive place invariants in 82 ms returned sat
[2024-05-26 21:56:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 31 ms returned sat
[2024-05-26 21:56:30] [INFO ] [Real]Absence check using state equation in 1648 ms returned sat
[2024-05-26 21:56:30] [INFO ] [Real]Added 497 Read/Feed constraints in 215 ms returned sat
[2024-05-26 21:56:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 48 ms returned sat
[2024-05-26 21:56:31] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2024-05-26 21:56:33] [INFO ] [Nat]Absence check using state equation in 1963 ms returned sat
[2024-05-26 21:56:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 21:56:34] [INFO ] [Nat]Added 497 Read/Feed constraints in 1070 ms returned unknown
[2024-05-26 21:56:34] [INFO ] [Real]Absence check using 23 positive place invariants in 76 ms returned sat
[2024-05-26 21:56:34] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2024-05-26 21:56:37] [INFO ] [Real]Absence check using state equation in 2267 ms returned sat
[2024-05-26 21:56:37] [INFO ] [Real]Added 497 Read/Feed constraints in 305 ms returned sat
[2024-05-26 21:56:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:56:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 82 ms returned sat
[2024-05-26 21:56:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2024-05-26 21:56:40] [INFO ] [Nat]Absence check using state equation in 2199 ms returned sat
[2024-05-26 21:56:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 21:56:41] [INFO ] [Nat]Added 497 Read/Feed constraints in 1058 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 6] Max Struct:[8, 8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1, 6] Max Struct:[8, 8, 8]
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 655 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 1152/1992 places, 2256/3096 transitions.
[2024-05-26 21:56:42] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2024-05-26 21:56:42] [INFO ] Computed 31 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1, 6] Max Struct:[8, 8, 8]
RANDOM walk for 1000000 steps (2 resets) in 11997 ms. (83 steps per ms)
BEST_FIRST walk for 2599898 steps (5 resets) in 9488 ms. (273 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1] Max Struct:[8, 8]
[2024-05-26 21:57:03] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
[2024-05-26 21:57:03] [INFO ] Invariant cache hit.
[2024-05-26 21:57:04] [INFO ] [Real]Absence check using 23 positive place invariants in 44 ms returned sat
[2024-05-26 21:57:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2024-05-26 21:57:05] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2024-05-26 21:57:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:57:05] [INFO ] [Real]Added 497 Read/Feed constraints in 188 ms returned sat
[2024-05-26 21:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:57:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 53 ms returned sat
[2024-05-26 21:57:05] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2024-05-26 21:57:07] [INFO ] [Nat]Absence check using state equation in 1110 ms returned sat
[2024-05-26 21:57:07] [INFO ] [Nat]Added 497 Read/Feed constraints in 345 ms returned sat
[2024-05-26 21:57:07] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 188 ms.
[2024-05-26 21:57:18] [INFO ] Deduced a trap composed of 141 places in 1261 ms of which 100 ms to minimize.
[2024-05-26 21:57:19] [INFO ] Deduced a trap composed of 85 places in 1187 ms of which 16 ms to minimize.
[2024-05-26 21:57:21] [INFO ] Deduced a trap composed of 162 places in 1532 ms of which 16 ms to minimize.
[2024-05-26 21:57:22] [INFO ] Deduced a trap composed of 36 places in 1029 ms of which 9 ms to minimize.
[2024-05-26 21:57:24] [INFO ] Deduced a trap composed of 130 places in 915 ms of which 9 ms to minimize.
[2024-05-26 21:57:26] [INFO ] Deduced a trap composed of 143 places in 896 ms of which 10 ms to minimize.
[2024-05-26 21:57:27] [INFO ] Deduced a trap composed of 108 places in 1307 ms of which 16 ms to minimize.
[2024-05-26 21:57:29] [INFO ] Deduced a trap composed of 90 places in 1306 ms of which 16 ms to minimize.
[2024-05-26 21:57:30] [INFO ] Deduced a trap composed of 62 places in 1232 ms of which 14 ms to minimize.
[2024-05-26 21:57:32] [INFO ] Deduced a trap composed of 72 places in 1100 ms of which 13 ms to minimize.
[2024-05-26 21:57:33] [INFO ] Deduced a trap composed of 102 places in 1341 ms of which 16 ms to minimize.
[2024-05-26 21:57:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 17085 ms
[2024-05-26 21:57:34] [INFO ] Added : 208 causal constraints over 42 iterations in 27138 ms.(timeout) Result :sat
Minimization took 1769 ms.
[2024-05-26 21:57:36] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2024-05-26 21:57:36] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2024-05-26 21:57:37] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2024-05-26 21:57:37] [INFO ] [Real]Added 497 Read/Feed constraints in 72 ms returned sat
[2024-05-26 21:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:57:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 48 ms returned sat
[2024-05-26 21:57:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2024-05-26 21:57:39] [INFO ] [Nat]Absence check using state equation in 1036 ms returned sat
[2024-05-26 21:57:39] [INFO ] [Nat]Added 497 Read/Feed constraints in 651 ms returned sat
[2024-05-26 21:57:40] [INFO ] Deduced a trap composed of 28 places in 779 ms of which 10 ms to minimize.
[2024-05-26 21:57:41] [INFO ] Deduced a trap composed of 13 places in 810 ms of which 9 ms to minimize.
[2024-05-26 21:57:42] [INFO ] Deduced a trap composed of 73 places in 1233 ms of which 14 ms to minimize.
[2024-05-26 21:57:44] [INFO ] Deduced a trap composed of 44 places in 1295 ms of which 14 ms to minimize.
[2024-05-26 21:57:45] [INFO ] Deduced a trap composed of 114 places in 1208 ms of which 13 ms to minimize.
[2024-05-26 21:57:47] [INFO ] Deduced a trap composed of 13 places in 1275 ms of which 13 ms to minimize.
[2024-05-26 21:57:48] [INFO ] Deduced a trap composed of 51 places in 1238 ms of which 13 ms to minimize.
[2024-05-26 21:57:49] [INFO ] Deduced a trap composed of 80 places in 1107 ms of which 12 ms to minimize.
[2024-05-26 21:57:51] [INFO ] Deduced a trap composed of 140 places in 1354 ms of which 15 ms to minimize.
[2024-05-26 21:57:52] [INFO ] Deduced a trap composed of 70 places in 1176 ms of which 14 ms to minimize.
[2024-05-26 21:57:53] [INFO ] Deduced a trap composed of 34 places in 1174 ms of which 12 ms to minimize.
[2024-05-26 21:57:55] [INFO ] Deduced a trap composed of 32 places in 1135 ms of which 14 ms to minimize.
[2024-05-26 21:57:56] [INFO ] Deduced a trap composed of 43 places in 1063 ms of which 13 ms to minimize.
[2024-05-26 21:57:57] [INFO ] Deduced a trap composed of 67 places in 1260 ms of which 13 ms to minimize.
[2024-05-26 21:57:58] [INFO ] Deduced a trap composed of 32 places in 1162 ms of which 12 ms to minimize.
[2024-05-26 21:58:00] [INFO ] Deduced a trap composed of 68 places in 984 ms of which 10 ms to minimize.
[2024-05-26 21:58:01] [INFO ] Deduced a trap composed of 56 places in 1086 ms of which 14 ms to minimize.
[2024-05-26 21:58:02] [INFO ] Deduced a trap composed of 41 places in 1216 ms of which 12 ms to minimize.
[2024-05-26 21:58:04] [INFO ] Deduced a trap composed of 26 places in 1053 ms of which 8 ms to minimize.
[2024-05-26 21:58:05] [INFO ] Deduced a trap composed of 17 places in 1132 ms of which 13 ms to minimize.
[2024-05-26 21:58:06] [INFO ] Deduced a trap composed of 42 places in 1268 ms of which 13 ms to minimize.
[2024-05-26 21:58:07] [INFO ] Deduced a trap composed of 15 places in 1085 ms of which 9 ms to minimize.
[2024-05-26 21:58:09] [INFO ] Deduced a trap composed of 125 places in 1088 ms of which 14 ms to minimize.
[2024-05-26 21:58:10] [INFO ] Deduced a trap composed of 60 places in 1295 ms of which 14 ms to minimize.
[2024-05-26 21:58:11] [INFO ] Deduced a trap composed of 34 places in 1232 ms of which 13 ms to minimize.
[2024-05-26 21:58:13] [INFO ] Deduced a trap composed of 49 places in 1239 ms of which 15 ms to minimize.
[2024-05-26 21:58:14] [INFO ] Deduced a trap composed of 73 places in 1260 ms of which 14 ms to minimize.
[2024-05-26 21:58:15] [INFO ] Deduced a trap composed of 35 places in 1174 ms of which 12 ms to minimize.
[2024-05-26 21:58:17] [INFO ] Deduced a trap composed of 136 places in 1072 ms of which 12 ms to minimize.
[2024-05-26 21:58:18] [INFO ] Deduced a trap composed of 34 places in 1093 ms of which 12 ms to minimize.
[2024-05-26 21:58:19] [INFO ] Deduced a trap composed of 25 places in 1038 ms of which 12 ms to minimize.
[2024-05-26 21:58:21] [INFO ] Deduced a trap composed of 23 places in 906 ms of which 11 ms to minimize.
[2024-05-26 21:58:22] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 42967 ms
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 1] Max Struct:[8, 8]
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1152 transition count 2208
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1104 transition count 2208
Applied a total of 96 rules in 198 ms. Remains 1104 /1152 variables (removed 48) and now considering 2208/2256 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 1104/1152 places, 2208/2256 transitions.
[2024-05-26 21:58:27] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2024-05-26 21:58:27] [INFO ] Computed 31 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 1] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 10226 ms. (97 steps per ms)
BEST_FIRST walk for 1645428 steps (3 resets) in 6911 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1] Max Struct:[8, 8]
[2024-05-26 21:58:44] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:58:44] [INFO ] Invariant cache hit.
[2024-05-26 21:58:44] [INFO ] [Real]Absence check using 23 positive place invariants in 44 ms returned sat
[2024-05-26 21:58:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2024-05-26 21:58:45] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2024-05-26 21:58:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:58:45] [INFO ] [Real]Added 497 Read/Feed constraints in 126 ms returned sat
[2024-05-26 21:58:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:58:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 43 ms returned sat
[2024-05-26 21:58:46] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 16 ms returned sat
[2024-05-26 21:58:47] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2024-05-26 21:58:47] [INFO ] [Nat]Added 497 Read/Feed constraints in 302 ms returned sat
[2024-05-26 21:58:48] [INFO ] Deduced a trap composed of 17 places in 1097 ms of which 15 ms to minimize.
[2024-05-26 21:58:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1311 ms
[2024-05-26 21:58:49] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 255 ms.
[2024-05-26 21:58:56] [INFO ] Deduced a trap composed of 133 places in 1305 ms of which 14 ms to minimize.
[2024-05-26 21:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1741 ms
[2024-05-26 21:58:57] [INFO ] Added : 123 causal constraints over 25 iterations in 8513 ms. Result :sat
Minimization took 1466 ms.
[2024-05-26 21:58:59] [INFO ] [Real]Absence check using 23 positive place invariants in 44 ms returned sat
[2024-05-26 21:58:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2024-05-26 21:59:00] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2024-05-26 21:59:00] [INFO ] [Real]Added 497 Read/Feed constraints in 87 ms returned sat
[2024-05-26 21:59:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:59:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 46 ms returned sat
[2024-05-26 21:59:00] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2024-05-26 21:59:01] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2024-05-26 21:59:02] [INFO ] [Nat]Added 497 Read/Feed constraints in 510 ms returned sat
[2024-05-26 21:59:03] [INFO ] Deduced a trap composed of 39 places in 1107 ms of which 13 ms to minimize.
[2024-05-26 21:59:04] [INFO ] Deduced a trap composed of 15 places in 1218 ms of which 13 ms to minimize.
[2024-05-26 21:59:05] [INFO ] Deduced a trap composed of 89 places in 1180 ms of which 13 ms to minimize.
[2024-05-26 21:59:07] [INFO ] Deduced a trap composed of 127 places in 1126 ms of which 12 ms to minimize.
[2024-05-26 21:59:08] [INFO ] Deduced a trap composed of 64 places in 1248 ms of which 14 ms to minimize.
[2024-05-26 21:59:09] [INFO ] Deduced a trap composed of 50 places in 1215 ms of which 13 ms to minimize.
[2024-05-26 21:59:11] [INFO ] Deduced a trap composed of 56 places in 1068 ms of which 8 ms to minimize.
[2024-05-26 21:59:12] [INFO ] Deduced a trap composed of 67 places in 1086 ms of which 14 ms to minimize.
[2024-05-26 21:59:13] [INFO ] Deduced a trap composed of 49 places in 1150 ms of which 8 ms to minimize.
[2024-05-26 21:59:14] [INFO ] Deduced a trap composed of 46 places in 999 ms of which 13 ms to minimize.
[2024-05-26 21:59:15] [INFO ] Deduced a trap composed of 49 places in 1243 ms of which 14 ms to minimize.
[2024-05-26 21:59:17] [INFO ] Deduced a trap composed of 130 places in 1239 ms of which 13 ms to minimize.
[2024-05-26 21:59:18] [INFO ] Deduced a trap composed of 13 places in 1212 ms of which 13 ms to minimize.
[2024-05-26 21:59:19] [INFO ] Deduced a trap composed of 49 places in 1206 ms of which 14 ms to minimize.
[2024-05-26 21:59:21] [INFO ] Deduced a trap composed of 34 places in 1035 ms of which 14 ms to minimize.
[2024-05-26 21:59:22] [INFO ] Deduced a trap composed of 59 places in 1177 ms of which 13 ms to minimize.
[2024-05-26 21:59:23] [INFO ] Deduced a trap composed of 46 places in 1186 ms of which 13 ms to minimize.
[2024-05-26 21:59:25] [INFO ] Deduced a trap composed of 31 places in 1190 ms of which 14 ms to minimize.
[2024-05-26 21:59:26] [INFO ] Deduced a trap composed of 85 places in 1219 ms of which 14 ms to minimize.
[2024-05-26 21:59:27] [INFO ] Deduced a trap composed of 31 places in 1177 ms of which 14 ms to minimize.
[2024-05-26 21:59:29] [INFO ] Deduced a trap composed of 67 places in 1208 ms of which 13 ms to minimize.
[2024-05-26 21:59:30] [INFO ] Deduced a trap composed of 30 places in 1226 ms of which 14 ms to minimize.
[2024-05-26 21:59:31] [INFO ] Deduced a trap composed of 14 places in 1240 ms of which 13 ms to minimize.
[2024-05-26 21:59:33] [INFO ] Deduced a trap composed of 41 places in 1295 ms of which 14 ms to minimize.
[2024-05-26 21:59:34] [INFO ] Deduced a trap composed of 57 places in 1189 ms of which 13 ms to minimize.
[2024-05-26 21:59:35] [INFO ] Deduced a trap composed of 20 places in 1289 ms of which 14 ms to minimize.
[2024-05-26 21:59:37] [INFO ] Deduced a trap composed of 46 places in 1179 ms of which 12 ms to minimize.
[2024-05-26 21:59:39] [INFO ] Deduced a trap composed of 11 places in 1100 ms of which 14 ms to minimize.
[2024-05-26 21:59:40] [INFO ] Deduced a trap composed of 35 places in 1198 ms of which 13 ms to minimize.
[2024-05-26 21:59:42] [INFO ] Deduced a trap composed of 33 places in 1193 ms of which 12 ms to minimize.
[2024-05-26 21:59:43] [INFO ] Deduced a trap composed of 119 places in 1229 ms of which 14 ms to minimize.
[2024-05-26 21:59:44] [INFO ] Deduced a trap composed of 47 places in 1148 ms of which 13 ms to minimize.
[2024-05-26 21:59:45] [INFO ] Deduced a trap composed of 83 places in 1068 ms of which 14 ms to minimize.
[2024-05-26 21:59:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 1] Max Struct:[8, 8]
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 51 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 49 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-26 21:59:47] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:59:47] [INFO ] Invariant cache hit.
[2024-05-26 21:59:48] [INFO ] Implicit Places using invariants in 1363 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1370 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 73 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1497 ms. Remains : 1096/1104 places, 2208/2208 transitions.
[2024-05-26 21:59:48] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2024-05-26 21:59:48] [INFO ] Computed 23 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 1] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 10414 ms. (96 steps per ms)
BEST_FIRST walk for 1546284 steps (3 resets) in 7050 ms. (219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1] Max Struct:[8, 8]
[2024-05-26 22:00:06] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 22:00:06] [INFO ] Invariant cache hit.
[2024-05-26 22:00:06] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2024-05-26 22:00:07] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2024-05-26 22:00:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 22:00:08] [INFO ] [Real]Added 497 Read/Feed constraints in 197 ms returned sat
[2024-05-26 22:00:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:00:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2024-05-26 22:00:09] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2024-05-26 22:00:09] [INFO ] [Nat]Added 497 Read/Feed constraints in 287 ms returned sat
[2024-05-26 22:00:10] [INFO ] Deduced a trap composed of 15 places in 935 ms of which 9 ms to minimize.
[2024-05-26 22:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1086 ms
[2024-05-26 22:00:11] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 210 ms.
[2024-05-26 22:00:17] [INFO ] Added : 158 causal constraints over 32 iterations in 6828 ms. Result :sat
Minimization took 1359 ms.
[2024-05-26 22:00:19] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2024-05-26 22:00:20] [INFO ] [Real]Absence check using state equation in 872 ms returned sat
[2024-05-26 22:00:20] [INFO ] [Real]Added 497 Read/Feed constraints in 70 ms returned sat
[2024-05-26 22:00:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:00:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2024-05-26 22:00:21] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2024-05-26 22:00:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 506 ms returned sat
[2024-05-26 22:00:22] [INFO ] Deduced a trap composed of 104 places in 979 ms of which 13 ms to minimize.
[2024-05-26 22:00:24] [INFO ] Deduced a trap composed of 51 places in 1197 ms of which 13 ms to minimize.
[2024-05-26 22:00:25] [INFO ] Deduced a trap composed of 15 places in 1208 ms of which 12 ms to minimize.
[2024-05-26 22:00:26] [INFO ] Deduced a trap composed of 96 places in 1138 ms of which 12 ms to minimize.
[2024-05-26 22:00:28] [INFO ] Deduced a trap composed of 54 places in 1150 ms of which 13 ms to minimize.
[2024-05-26 22:00:29] [INFO ] Deduced a trap composed of 40 places in 1142 ms of which 14 ms to minimize.
[2024-05-26 22:00:30] [INFO ] Deduced a trap composed of 77 places in 1218 ms of which 13 ms to minimize.
[2024-05-26 22:00:32] [INFO ] Deduced a trap composed of 56 places in 1181 ms of which 12 ms to minimize.
[2024-05-26 22:00:33] [INFO ] Deduced a trap composed of 31 places in 1074 ms of which 13 ms to minimize.
[2024-05-26 22:00:34] [INFO ] Deduced a trap composed of 28 places in 1140 ms of which 12 ms to minimize.
[2024-05-26 22:00:35] [INFO ] Deduced a trap composed of 24 places in 1181 ms of which 13 ms to minimize.
[2024-05-26 22:00:37] [INFO ] Deduced a trap composed of 15 places in 1192 ms of which 13 ms to minimize.
[2024-05-26 22:00:38] [INFO ] Deduced a trap composed of 24 places in 1278 ms of which 14 ms to minimize.
[2024-05-26 22:00:39] [INFO ] Deduced a trap composed of 29 places in 1203 ms of which 13 ms to minimize.
[2024-05-26 22:00:41] [INFO ] Deduced a trap composed of 31 places in 997 ms of which 14 ms to minimize.
[2024-05-26 22:00:42] [INFO ] Deduced a trap composed of 26 places in 1149 ms of which 13 ms to minimize.
[2024-05-26 22:00:43] [INFO ] Deduced a trap composed of 33 places in 1062 ms of which 13 ms to minimize.
[2024-05-26 22:00:45] [INFO ] Deduced a trap composed of 66 places in 1025 ms of which 14 ms to minimize.
[2024-05-26 22:00:46] [INFO ] Deduced a trap composed of 48 places in 1251 ms of which 13 ms to minimize.
[2024-05-26 22:00:47] [INFO ] Deduced a trap composed of 49 places in 1135 ms of which 13 ms to minimize.
[2024-05-26 22:00:49] [INFO ] Deduced a trap composed of 13 places in 1117 ms of which 14 ms to minimize.
[2024-05-26 22:00:50] [INFO ] Deduced a trap composed of 74 places in 1199 ms of which 14 ms to minimize.
[2024-05-26 22:00:51] [INFO ] Deduced a trap composed of 50 places in 1219 ms of which 13 ms to minimize.
[2024-05-26 22:00:53] [INFO ] Deduced a trap composed of 71 places in 1039 ms of which 13 ms to minimize.
[2024-05-26 22:00:55] [INFO ] Deduced a trap composed of 50 places in 1299 ms of which 14 ms to minimize.
[2024-05-26 22:00:56] [INFO ] Deduced a trap composed of 29 places in 1237 ms of which 14 ms to minimize.
[2024-05-26 22:00:57] [INFO ] Deduced a trap composed of 37 places in 1191 ms of which 13 ms to minimize.
[2024-05-26 22:00:59] [INFO ] Deduced a trap composed of 13 places in 1163 ms of which 13 ms to minimize.
[2024-05-26 22:01:00] [INFO ] Deduced a trap composed of 80 places in 1282 ms of which 14 ms to minimize.
[2024-05-26 22:01:01] [INFO ] Deduced a trap composed of 72 places in 1256 ms of which 13 ms to minimize.
[2024-05-26 22:01:03] [INFO ] Deduced a trap composed of 123 places in 1050 ms of which 13 ms to minimize.
[2024-05-26 22:01:04] [INFO ] Deduced a trap composed of 19 places in 1259 ms of which 14 ms to minimize.
[2024-05-26 22:01:05] [INFO ] Deduced a trap composed of 135 places in 1152 ms of which 13 ms to minimize.
[2024-05-26 22:01:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 1] Max Struct:[8, 8]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 39 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 39 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-26 22:01:07] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 22:01:07] [INFO ] Invariant cache hit.
[2024-05-26 22:01:08] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2024-05-26 22:01:08] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 22:01:08] [INFO ] Invariant cache hit.
[2024-05-26 22:01:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 22:01:15] [INFO ] Implicit Places using invariants and state equation in 6913 ms returned []
Implicit Place search using SMT with State Equation took 7992 ms to find 0 implicit places.
[2024-05-26 22:01:15] [INFO ] Redundant transitions in 171 ms returned []
Running 2200 sub problems to find dead transitions.
[2024-05-26 22:01:15] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 22:01:15] [INFO ] Invariant cache hit.
[2024-05-26 22:01:15] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/2968 variables, and 23 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30164 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1096 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2200/2200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-05-26 22:01:50] [INFO ] Deduced a trap composed of 66 places in 1120 ms of which 14 ms to minimize.
[2024-05-26 22:01:52] [INFO ] Deduced a trap composed of 17 places in 1081 ms of which 9 ms to minimize.
[2024-05-26 22:01:53] [INFO ] Deduced a trap composed of 55 places in 1088 ms of which 14 ms to minimize.
[2024-05-26 22:01:54] [INFO ] Deduced a trap composed of 75 places in 1191 ms of which 12 ms to minimize.
[2024-05-26 22:01:55] [INFO ] Deduced a trap composed of 19 places in 1016 ms of which 9 ms to minimize.
[2024-05-26 22:01:56] [INFO ] Deduced a trap composed of 68 places in 1051 ms of which 13 ms to minimize.
[2024-05-26 22:01:57] [INFO ] Deduced a trap composed of 28 places in 1178 ms of which 12 ms to minimize.
[2024-05-26 22:01:58] [INFO ] Deduced a trap composed of 71 places in 1195 ms of which 15 ms to minimize.
[2024-05-26 22:02:00] [INFO ] Deduced a trap composed of 64 places in 1237 ms of which 14 ms to minimize.
[2024-05-26 22:02:01] [INFO ] Deduced a trap composed of 76 places in 1294 ms of which 15 ms to minimize.
[2024-05-26 22:02:02] [INFO ] Deduced a trap composed of 70 places in 1285 ms of which 14 ms to minimize.
[2024-05-26 22:02:04] [INFO ] Deduced a trap composed of 80 places in 1185 ms of which 14 ms to minimize.
[2024-05-26 22:02:05] [INFO ] Deduced a trap composed of 51 places in 1133 ms of which 13 ms to minimize.
[2024-05-26 22:02:06] [INFO ] Deduced a trap composed of 28 places in 1055 ms of which 9 ms to minimize.
[2024-05-26 22:02:07] [INFO ] Deduced a trap composed of 37 places in 857 ms of which 9 ms to minimize.
[2024-05-26 22:02:08] [INFO ] Deduced a trap composed of 80 places in 1172 ms of which 13 ms to minimize.
[2024-05-26 22:02:09] [INFO ] Deduced a trap composed of 38 places in 1111 ms of which 8 ms to minimize.
[2024-05-26 22:02:10] [INFO ] Deduced a trap composed of 62 places in 1033 ms of which 13 ms to minimize.
[2024-05-26 22:02:11] [INFO ] Deduced a trap composed of 49 places in 1267 ms of which 13 ms to minimize.
[2024-05-26 22:02:13] [INFO ] Deduced a trap composed of 40 places in 1042 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1096 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-05-26 22:02:15] [INFO ] Deduced a trap composed of 59 places in 987 ms of which 13 ms to minimize.
[2024-05-26 22:02:16] [INFO ] Deduced a trap composed of 49 places in 1013 ms of which 12 ms to minimize.
[2024-05-26 22:02:17] [INFO ] Deduced a trap composed of 49 places in 1001 ms of which 11 ms to minimize.
SMT process timed out in 61881ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 61949ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70178 ms. Remains : 1096/1096 places, 2208/2208 transitions.
RANDOM walk for 40000 steps (8 resets) in 2651 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1140 ms. (35 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
[2024-05-26 22:02:18] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 22:02:18] [INFO ] Invariant cache hit.
[2024-05-26 22:02:18] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/1040 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1872/2912 variables, 1040/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2912 variables, 497/1553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2912 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/2968 variables, 56/1609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2968 variables, 7/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2968 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2968 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2968/2968 variables, and 1616 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1096/1096 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/1040 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1872/2912 variables, 1040/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2912 variables, 497/1553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2912 variables, 2/1555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/2968 variables, 56/1611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2968 variables, 7/1618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:02:23] [INFO ] Deduced a trap composed of 36 places in 951 ms of which 9 ms to minimize.
[2024-05-26 22:02:24] [INFO ] Deduced a trap composed of 71 places in 907 ms of which 13 ms to minimize.
[2024-05-26 22:02:26] [INFO ] Deduced a trap composed of 95 places in 1289 ms of which 15 ms to minimize.
SMT process timed out in 7515ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 2 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 196 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 592/1096 places, 1704/2208 transitions.
RANDOM walk for 40000 steps (8 resets) in 867 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 293940 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 293940 steps, saw 51941 distinct states, run finished after 3006 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-26 22:02:29] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2024-05-26 22:02:29] [INFO ] Computed 23 invariants in 6 ms
[2024-05-26 22:02:29] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:02:33] [INFO ] Deduced a trap composed of 77 places in 711 ms of which 8 ms to minimize.
[2024-05-26 22:02:33] [INFO ] Deduced a trap composed of 86 places in 616 ms of which 5 ms to minimize.
[2024-05-26 22:02:34] [INFO ] Deduced a trap composed of 64 places in 412 ms of which 5 ms to minimize.
[2024-05-26 22:02:34] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 5 ms to minimize.
[2024-05-26 22:02:35] [INFO ] Deduced a trap composed of 67 places in 437 ms of which 5 ms to minimize.
[2024-05-26 22:02:36] [INFO ] Deduced a trap composed of 60 places in 637 ms of which 8 ms to minimize.
[2024-05-26 22:02:36] [INFO ] Deduced a trap composed of 50 places in 689 ms of which 8 ms to minimize.
[2024-05-26 22:02:37] [INFO ] Deduced a trap composed of 26 places in 684 ms of which 8 ms to minimize.
[2024-05-26 22:02:38] [INFO ] Deduced a trap composed of 36 places in 668 ms of which 8 ms to minimize.
[2024-05-26 22:02:38] [INFO ] Deduced a trap composed of 41 places in 695 ms of which 8 ms to minimize.
[2024-05-26 22:02:39] [INFO ] Deduced a trap composed of 15 places in 692 ms of which 8 ms to minimize.
[2024-05-26 22:02:40] [INFO ] Deduced a trap composed of 67 places in 686 ms of which 8 ms to minimize.
[2024-05-26 22:02:41] [INFO ] Deduced a trap composed of 44 places in 569 ms of which 8 ms to minimize.
[2024-05-26 22:02:41] [INFO ] Deduced a trap composed of 59 places in 697 ms of which 8 ms to minimize.
[2024-05-26 22:02:42] [INFO ] Deduced a trap composed of 55 places in 691 ms of which 8 ms to minimize.
[2024-05-26 22:02:43] [INFO ] Deduced a trap composed of 42 places in 677 ms of which 8 ms to minimize.
[2024-05-26 22:02:44] [INFO ] Deduced a trap composed of 33 places in 693 ms of which 8 ms to minimize.
[2024-05-26 22:02:44] [INFO ] Deduced a trap composed of 49 places in 641 ms of which 7 ms to minimize.
[2024-05-26 22:02:45] [INFO ] Deduced a trap composed of 51 places in 689 ms of which 7 ms to minimize.
[2024-05-26 22:02:46] [INFO ] Deduced a trap composed of 42 places in 666 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:02:46] [INFO ] Deduced a trap composed of 41 places in 591 ms of which 7 ms to minimize.
[2024-05-26 22:02:47] [INFO ] Deduced a trap composed of 96 places in 706 ms of which 8 ms to minimize.
[2024-05-26 22:02:48] [INFO ] Deduced a trap composed of 58 places in 703 ms of which 8 ms to minimize.
[2024-05-26 22:02:49] [INFO ] Deduced a trap composed of 68 places in 718 ms of which 8 ms to minimize.
[2024-05-26 22:02:49] [INFO ] Deduced a trap composed of 31 places in 608 ms of which 8 ms to minimize.
[2024-05-26 22:02:50] [INFO ] Deduced a trap composed of 63 places in 636 ms of which 8 ms to minimize.
[2024-05-26 22:02:51] [INFO ] Deduced a trap composed of 22 places in 681 ms of which 8 ms to minimize.
[2024-05-26 22:02:52] [INFO ] Deduced a trap composed of 24 places in 663 ms of which 8 ms to minimize.
[2024-05-26 22:02:52] [INFO ] Deduced a trap composed of 36 places in 679 ms of which 7 ms to minimize.
[2024-05-26 22:02:53] [INFO ] Deduced a trap composed of 41 places in 697 ms of which 8 ms to minimize.
[2024-05-26 22:02:54] [INFO ] Deduced a trap composed of 12 places in 679 ms of which 8 ms to minimize.
[2024-05-26 22:02:54] [INFO ] Deduced a trap composed of 29 places in 658 ms of which 8 ms to minimize.
[2024-05-26 22:02:55] [INFO ] Deduced a trap composed of 13 places in 535 ms of which 8 ms to minimize.
[2024-05-26 22:02:56] [INFO ] Deduced a trap composed of 12 places in 700 ms of which 8 ms to minimize.
[2024-05-26 22:02:57] [INFO ] Deduced a trap composed of 57 places in 692 ms of which 7 ms to minimize.
[2024-05-26 22:02:57] [INFO ] Deduced a trap composed of 48 places in 703 ms of which 9 ms to minimize.
[2024-05-26 22:02:58] [INFO ] Deduced a trap composed of 40 places in 674 ms of which 7 ms to minimize.
[2024-05-26 22:02:59] [INFO ] Deduced a trap composed of 70 places in 658 ms of which 8 ms to minimize.
[2024-05-26 22:02:59] [INFO ] Deduced a trap composed of 97 places in 671 ms of which 8 ms to minimize.
[2024-05-26 22:03:00] [INFO ] Deduced a trap composed of 119 places in 692 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:03:01] [INFO ] Deduced a trap composed of 59 places in 562 ms of which 9 ms to minimize.
[2024-05-26 22:03:02] [INFO ] Deduced a trap composed of 52 places in 709 ms of which 8 ms to minimize.
[2024-05-26 22:03:02] [INFO ] Deduced a trap composed of 30 places in 703 ms of which 8 ms to minimize.
[2024-05-26 22:03:03] [INFO ] Deduced a trap composed of 22 places in 653 ms of which 8 ms to minimize.
[2024-05-26 22:03:04] [INFO ] Deduced a trap composed of 51 places in 691 ms of which 8 ms to minimize.
[2024-05-26 22:03:05] [INFO ] Deduced a trap composed of 35 places in 686 ms of which 8 ms to minimize.
[2024-05-26 22:03:05] [INFO ] Deduced a trap composed of 39 places in 624 ms of which 8 ms to minimize.
[2024-05-26 22:03:06] [INFO ] Deduced a trap composed of 56 places in 654 ms of which 7 ms to minimize.
[2024-05-26 22:03:07] [INFO ] Deduced a trap composed of 23 places in 658 ms of which 8 ms to minimize.
[2024-05-26 22:03:07] [INFO ] Deduced a trap composed of 43 places in 678 ms of which 8 ms to minimize.
[2024-05-26 22:03:08] [INFO ] Deduced a trap composed of 34 places in 633 ms of which 7 ms to minimize.
[2024-05-26 22:03:09] [INFO ] Deduced a trap composed of 34 places in 667 ms of which 8 ms to minimize.
[2024-05-26 22:03:10] [INFO ] Deduced a trap composed of 28 places in 660 ms of which 8 ms to minimize.
[2024-05-26 22:03:10] [INFO ] Deduced a trap composed of 34 places in 615 ms of which 7 ms to minimize.
Problem MAX1 is UNSAT
[2024-05-26 22:03:11] [INFO ] Deduced a trap composed of 30 places in 667 ms of which 7 ms to minimize.
[2024-05-26 22:03:12] [INFO ] Deduced a trap composed of 16 places in 667 ms of which 8 ms to minimize.
[2024-05-26 22:03:13] [INFO ] Deduced a trap composed of 77 places in 680 ms of which 8 ms to minimize.
[2024-05-26 22:03:13] [INFO ] Deduced a trap composed of 101 places in 695 ms of which 8 ms to minimize.
[2024-05-26 22:03:14] [INFO ] Deduced a trap composed of 41 places in 677 ms of which 8 ms to minimize.
[2024-05-26 22:03:15] [INFO ] Deduced a trap composed of 16 places in 694 ms of which 8 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 22:03:16] [INFO ] Deduced a trap composed of 23 places in 682 ms of which 8 ms to minimize.
[2024-05-26 22:03:16] [INFO ] Deduced a trap composed of 23 places in 697 ms of which 8 ms to minimize.
SMT process timed out in 47072ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 56 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 377748 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 377748 steps, saw 61732 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2024-05-26 22:03:20] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:03:20] [INFO ] Invariant cache hit.
[2024-05-26 22:03:20] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:03:21] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/536 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1368/1904 variables, 536/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 497/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:03:23] [INFO ] Deduced a trap composed of 27 places in 660 ms of which 8 ms to minimize.
[2024-05-26 22:03:23] [INFO ] Deduced a trap composed of 36 places in 661 ms of which 8 ms to minimize.
[2024-05-26 22:03:24] [INFO ] Deduced a trap composed of 34 places in 664 ms of which 8 ms to minimize.
[2024-05-26 22:03:25] [INFO ] Deduced a trap composed of 42 places in 661 ms of which 7 ms to minimize.
[2024-05-26 22:03:25] [INFO ] Deduced a trap composed of 20 places in 651 ms of which 8 ms to minimize.
[2024-05-26 22:03:26] [INFO ] Deduced a trap composed of 11 places in 630 ms of which 8 ms to minimize.
[2024-05-26 22:03:27] [INFO ] Deduced a trap composed of 33 places in 673 ms of which 8 ms to minimize.
[2024-05-26 22:03:28] [INFO ] Deduced a trap composed of 28 places in 648 ms of which 7 ms to minimize.
[2024-05-26 22:03:28] [INFO ] Deduced a trap composed of 25 places in 638 ms of which 8 ms to minimize.
[2024-05-26 22:03:29] [INFO ] Deduced a trap composed of 19 places in 618 ms of which 7 ms to minimize.
[2024-05-26 22:03:30] [INFO ] Deduced a trap composed of 25 places in 591 ms of which 8 ms to minimize.
[2024-05-26 22:03:30] [INFO ] Deduced a trap composed of 14 places in 635 ms of which 7 ms to minimize.
[2024-05-26 22:03:31] [INFO ] Deduced a trap composed of 13 places in 653 ms of which 7 ms to minimize.
[2024-05-26 22:03:32] [INFO ] Deduced a trap composed of 35 places in 598 ms of which 7 ms to minimize.
[2024-05-26 22:03:32] [INFO ] Deduced a trap composed of 38 places in 649 ms of which 7 ms to minimize.
[2024-05-26 22:03:33] [INFO ] Deduced a trap composed of 28 places in 632 ms of which 7 ms to minimize.
[2024-05-26 22:03:34] [INFO ] Deduced a trap composed of 65 places in 612 ms of which 7 ms to minimize.
[2024-05-26 22:03:34] [INFO ] Deduced a trap composed of 57 places in 634 ms of which 7 ms to minimize.
[2024-05-26 22:03:35] [INFO ] Deduced a trap composed of 45 places in 615 ms of which 7 ms to minimize.
[2024-05-26 22:03:36] [INFO ] Deduced a trap composed of 70 places in 689 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:03:37] [INFO ] Deduced a trap composed of 63 places in 682 ms of which 7 ms to minimize.
[2024-05-26 22:03:37] [INFO ] Deduced a trap composed of 74 places in 640 ms of which 8 ms to minimize.
[2024-05-26 22:03:39] [INFO ] Deduced a trap composed of 33 places in 605 ms of which 7 ms to minimize.
[2024-05-26 22:03:40] [INFO ] Deduced a trap composed of 31 places in 611 ms of which 7 ms to minimize.
[2024-05-26 22:03:40] [INFO ] Deduced a trap composed of 34 places in 625 ms of which 8 ms to minimize.
[2024-05-26 22:03:41] [INFO ] Deduced a trap composed of 32 places in 635 ms of which 8 ms to minimize.
[2024-05-26 22:03:42] [INFO ] Deduced a trap composed of 69 places in 649 ms of which 8 ms to minimize.
[2024-05-26 22:03:43] [INFO ] Deduced a trap composed of 34 places in 628 ms of which 7 ms to minimize.
[2024-05-26 22:03:43] [INFO ] Deduced a trap composed of 53 places in 617 ms of which 7 ms to minimize.
[2024-05-26 22:03:44] [INFO ] Deduced a trap composed of 78 places in 617 ms of which 7 ms to minimize.
[2024-05-26 22:03:45] [INFO ] Deduced a trap composed of 23 places in 623 ms of which 9 ms to minimize.
[2024-05-26 22:03:46] [INFO ] Deduced a trap composed of 61 places in 675 ms of which 8 ms to minimize.
[2024-05-26 22:03:46] [INFO ] Deduced a trap composed of 33 places in 639 ms of which 8 ms to minimize.
[2024-05-26 22:03:47] [INFO ] Deduced a trap composed of 20 places in 634 ms of which 7 ms to minimize.
[2024-05-26 22:03:48] [INFO ] Deduced a trap composed of 32 places in 622 ms of which 8 ms to minimize.
[2024-05-26 22:03:48] [INFO ] Deduced a trap composed of 27 places in 619 ms of which 7 ms to minimize.
[2024-05-26 22:03:49] [INFO ] Deduced a trap composed of 85 places in 600 ms of which 7 ms to minimize.
[2024-05-26 22:03:50] [INFO ] Deduced a trap composed of 47 places in 652 ms of which 7 ms to minimize.
[2024-05-26 22:03:51] [INFO ] Deduced a trap composed of 30 places in 648 ms of which 8 ms to minimize.
[2024-05-26 22:03:51] [INFO ] Deduced a trap composed of 21 places in 630 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:03:53] [INFO ] Deduced a trap composed of 30 places in 437 ms of which 7 ms to minimize.
[2024-05-26 22:03:53] [INFO ] Deduced a trap composed of 15 places in 597 ms of which 7 ms to minimize.
[2024-05-26 22:03:54] [INFO ] Deduced a trap composed of 47 places in 530 ms of which 6 ms to minimize.
[2024-05-26 22:03:54] [INFO ] Deduced a trap composed of 57 places in 488 ms of which 5 ms to minimize.
[2024-05-26 22:03:55] [INFO ] Deduced a trap composed of 25 places in 564 ms of which 8 ms to minimize.
[2024-05-26 22:03:56] [INFO ] Deduced a trap composed of 29 places in 584 ms of which 7 ms to minimize.
[2024-05-26 22:03:56] [INFO ] Deduced a trap composed of 22 places in 671 ms of which 8 ms to minimize.
[2024-05-26 22:03:57] [INFO ] Deduced a trap composed of 13 places in 657 ms of which 8 ms to minimize.
[2024-05-26 22:03:58] [INFO ] Deduced a trap composed of 27 places in 632 ms of which 8 ms to minimize.
[2024-05-26 22:03:59] [INFO ] Deduced a trap composed of 26 places in 667 ms of which 8 ms to minimize.
[2024-05-26 22:03:59] [INFO ] Deduced a trap composed of 21 places in 678 ms of which 7 ms to minimize.
[2024-05-26 22:04:00] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 8 ms to minimize.
[2024-05-26 22:04:01] [INFO ] Deduced a trap composed of 14 places in 693 ms of which 8 ms to minimize.
[2024-05-26 22:04:01] [INFO ] Deduced a trap composed of 51 places in 639 ms of which 8 ms to minimize.
[2024-05-26 22:04:02] [INFO ] Deduced a trap composed of 68 places in 643 ms of which 8 ms to minimize.
[2024-05-26 22:04:03] [INFO ] Deduced a trap composed of 53 places in 649 ms of which 8 ms to minimize.
[2024-05-26 22:04:04] [INFO ] Deduced a trap composed of 52 places in 641 ms of which 8 ms to minimize.
[2024-05-26 22:04:04] [INFO ] Deduced a trap composed of 29 places in 600 ms of which 8 ms to minimize.
[2024-05-26 22:04:05] [INFO ] Deduced a trap composed of 77 places in 585 ms of which 7 ms to minimize.
[2024-05-26 22:04:06] [INFO ] Deduced a trap composed of 66 places in 585 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:04:06] [INFO ] Deduced a trap composed of 62 places in 589 ms of which 8 ms to minimize.
[2024-05-26 22:04:07] [INFO ] Deduced a trap composed of 61 places in 573 ms of which 7 ms to minimize.
[2024-05-26 22:04:07] [INFO ] Deduced a trap composed of 54 places in 525 ms of which 7 ms to minimize.
[2024-05-26 22:04:08] [INFO ] Deduced a trap composed of 101 places in 582 ms of which 7 ms to minimize.
[2024-05-26 22:04:09] [INFO ] Deduced a trap composed of 41 places in 581 ms of which 7 ms to minimize.
[2024-05-26 22:04:10] [INFO ] Deduced a trap composed of 25 places in 563 ms of which 7 ms to minimize.
[2024-05-26 22:04:10] [INFO ] Deduced a trap composed of 22 places in 590 ms of which 7 ms to minimize.
[2024-05-26 22:04:11] [INFO ] Deduced a trap composed of 20 places in 580 ms of which 7 ms to minimize.
[2024-05-26 22:04:12] [INFO ] Deduced a trap composed of 20 places in 597 ms of which 7 ms to minimize.
[2024-05-26 22:04:13] [INFO ] Deduced a trap composed of 11 places in 604 ms of which 7 ms to minimize.
[2024-05-26 22:04:13] [INFO ] Deduced a trap composed of 21 places in 600 ms of which 8 ms to minimize.
[2024-05-26 22:04:14] [INFO ] Deduced a trap composed of 28 places in 551 ms of which 7 ms to minimize.
[2024-05-26 22:04:14] [INFO ] Deduced a trap composed of 29 places in 568 ms of which 7 ms to minimize.
[2024-05-26 22:04:15] [INFO ] Deduced a trap composed of 27 places in 592 ms of which 7 ms to minimize.
[2024-05-26 22:04:16] [INFO ] Deduced a trap composed of 44 places in 574 ms of which 6 ms to minimize.
[2024-05-26 22:04:17] [INFO ] Deduced a trap composed of 29 places in 560 ms of which 7 ms to minimize.
[2024-05-26 22:04:17] [INFO ] Deduced a trap composed of 71 places in 578 ms of which 7 ms to minimize.
[2024-05-26 22:04:18] [INFO ] Deduced a trap composed of 39 places in 599 ms of which 7 ms to minimize.
[2024-05-26 22:04:19] [INFO ] Deduced a trap composed of 30 places in 568 ms of which 8 ms to minimize.
[2024-05-26 22:04:19] [INFO ] Deduced a trap composed of 87 places in 602 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:04:20] [INFO ] Deduced a trap composed of 63 places in 513 ms of which 7 ms to minimize.
[2024-05-26 22:04:21] [INFO ] Deduced a trap composed of 78 places in 583 ms of which 7 ms to minimize.
[2024-05-26 22:04:21] [INFO ] Deduced a trap composed of 66 places in 535 ms of which 13 ms to minimize.
[2024-05-26 22:04:22] [INFO ] Deduced a trap composed of 39 places in 624 ms of which 8 ms to minimize.
[2024-05-26 22:04:23] [INFO ] Deduced a trap composed of 41 places in 595 ms of which 7 ms to minimize.
[2024-05-26 22:04:23] [INFO ] Deduced a trap composed of 30 places in 625 ms of which 15 ms to minimize.
[2024-05-26 22:04:24] [INFO ] Deduced a trap composed of 25 places in 621 ms of which 7 ms to minimize.
[2024-05-26 22:04:25] [INFO ] Deduced a trap composed of 56 places in 523 ms of which 6 ms to minimize.
[2024-05-26 22:04:26] [INFO ] Deduced a trap composed of 31 places in 606 ms of which 7 ms to minimize.
[2024-05-26 22:04:27] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 4 ms to minimize.
[2024-05-26 22:04:28] [INFO ] Deduced a trap composed of 51 places in 402 ms of which 7 ms to minimize.
[2024-05-26 22:04:29] [INFO ] Deduced a trap composed of 41 places in 586 ms of which 7 ms to minimize.
[2024-05-26 22:04:29] [INFO ] Deduced a trap composed of 54 places in 558 ms of which 7 ms to minimize.
[2024-05-26 22:04:30] [INFO ] Deduced a trap composed of 33 places in 604 ms of which 7 ms to minimize.
[2024-05-26 22:04:31] [INFO ] Deduced a trap composed of 47 places in 556 ms of which 6 ms to minimize.
[2024-05-26 22:04:32] [INFO ] Deduced a trap composed of 74 places in 514 ms of which 7 ms to minimize.
[2024-05-26 22:04:32] [INFO ] Deduced a trap composed of 108 places in 574 ms of which 7 ms to minimize.
[2024-05-26 22:04:33] [INFO ] Deduced a trap composed of 65 places in 606 ms of which 7 ms to minimize.
[2024-05-26 22:04:34] [INFO ] Deduced a trap composed of 47 places in 585 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 100/100 constraints]
After SMT, in 75874ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-05-26 22:04:36] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:04:36] [INFO ] Invariant cache hit.
[2024-05-26 22:04:36] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-05-26 22:04:36] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:04:36] [INFO ] Invariant cache hit.
[2024-05-26 22:04:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 22:04:41] [INFO ] Implicit Places using invariants and state equation in 4750 ms returned []
Implicit Place search using SMT with State Equation took 5615 ms to find 0 implicit places.
[2024-05-26 22:04:41] [INFO ] Redundant transitions in 127 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-05-26 22:04:41] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:04:41] [INFO ] Invariant cache hit.
[2024-05-26 22:04:41] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 23 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-05-26 22:05:14] [INFO ] Deduced a trap composed of 79 places in 465 ms of which 5 ms to minimize.
[2024-05-26 22:05:15] [INFO ] Deduced a trap composed of 61 places in 488 ms of which 8 ms to minimize.
[2024-05-26 22:05:16] [INFO ] Deduced a trap composed of 51 places in 692 ms of which 9 ms to minimize.
[2024-05-26 22:05:16] [INFO ] Deduced a trap composed of 68 places in 724 ms of which 9 ms to minimize.
[2024-05-26 22:05:17] [INFO ] Deduced a trap composed of 33 places in 721 ms of which 8 ms to minimize.
[2024-05-26 22:05:18] [INFO ] Deduced a trap composed of 41 places in 714 ms of which 8 ms to minimize.
[2024-05-26 22:05:19] [INFO ] Deduced a trap composed of 47 places in 706 ms of which 8 ms to minimize.
[2024-05-26 22:05:19] [INFO ] Deduced a trap composed of 13 places in 746 ms of which 9 ms to minimize.
[2024-05-26 22:05:20] [INFO ] Deduced a trap composed of 40 places in 762 ms of which 9 ms to minimize.
[2024-05-26 22:05:21] [INFO ] Deduced a trap composed of 48 places in 731 ms of which 8 ms to minimize.
[2024-05-26 22:05:22] [INFO ] Deduced a trap composed of 27 places in 660 ms of which 8 ms to minimize.
[2024-05-26 22:05:22] [INFO ] Deduced a trap composed of 21 places in 738 ms of which 8 ms to minimize.
[2024-05-26 22:05:23] [INFO ] Deduced a trap composed of 34 places in 705 ms of which 7 ms to minimize.
[2024-05-26 22:05:24] [INFO ] Deduced a trap composed of 31 places in 682 ms of which 8 ms to minimize.
[2024-05-26 22:05:24] [INFO ] Deduced a trap composed of 21 places in 613 ms of which 7 ms to minimize.
[2024-05-26 22:05:25] [INFO ] Deduced a trap composed of 11 places in 672 ms of which 8 ms to minimize.
[2024-05-26 22:05:26] [INFO ] Deduced a trap composed of 66 places in 673 ms of which 8 ms to minimize.
[2024-05-26 22:05:26] [INFO ] Deduced a trap composed of 47 places in 671 ms of which 8 ms to minimize.
[2024-05-26 22:05:27] [INFO ] Deduced a trap composed of 15 places in 677 ms of which 7 ms to minimize.
[2024-05-26 22:05:28] [INFO ] Deduced a trap composed of 16 places in 628 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-05-26 22:05:29] [INFO ] Deduced a trap composed of 34 places in 376 ms of which 4 ms to minimize.
[2024-05-26 22:05:30] [INFO ] Deduced a trap composed of 17 places in 594 ms of which 8 ms to minimize.
[2024-05-26 22:05:31] [INFO ] Deduced a trap composed of 27 places in 681 ms of which 8 ms to minimize.
[2024-05-26 22:05:31] [INFO ] Deduced a trap composed of 27 places in 647 ms of which 8 ms to minimize.
[2024-05-26 22:05:32] [INFO ] Deduced a trap composed of 27 places in 677 ms of which 7 ms to minimize.
[2024-05-26 22:05:33] [INFO ] Deduced a trap composed of 27 places in 640 ms of which 8 ms to minimize.
[2024-05-26 22:05:33] [INFO ] Deduced a trap composed of 18 places in 644 ms of which 8 ms to minimize.
[2024-05-26 22:05:34] [INFO ] Deduced a trap composed of 37 places in 666 ms of which 20 ms to minimize.
[2024-05-26 22:05:35] [INFO ] Deduced a trap composed of 54 places in 639 ms of which 8 ms to minimize.
[2024-05-26 22:05:35] [INFO ] Deduced a trap composed of 61 places in 656 ms of which 8 ms to minimize.
[2024-05-26 22:05:36] [INFO ] Deduced a trap composed of 44 places in 676 ms of which 8 ms to minimize.
[2024-05-26 22:05:37] [INFO ] Deduced a trap composed of 26 places in 651 ms of which 8 ms to minimize.
[2024-05-26 22:05:37] [INFO ] Deduced a trap composed of 22 places in 577 ms of which 7 ms to minimize.
[2024-05-26 22:05:38] [INFO ] Deduced a trap composed of 26 places in 632 ms of which 7 ms to minimize.
[2024-05-26 22:05:38] [INFO ] Deduced a trap composed of 50 places in 588 ms of which 8 ms to minimize.
[2024-05-26 22:05:39] [INFO ] Deduced a trap composed of 14 places in 616 ms of which 7 ms to minimize.
[2024-05-26 22:05:40] [INFO ] Deduced a trap composed of 23 places in 685 ms of which 8 ms to minimize.
[2024-05-26 22:05:40] [INFO ] Deduced a trap composed of 62 places in 659 ms of which 8 ms to minimize.
[2024-05-26 22:05:41] [INFO ] Deduced a trap composed of 27 places in 615 ms of which 8 ms to minimize.
[2024-05-26 22:05:42] [INFO ] Deduced a trap composed of 26 places in 652 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/1960 variables, and 63 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 40/40 constraints]
After SMT, in 61121ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 61146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66935 ms. Remains : 592/592 places, 1704/1704 transitions.
FORMULA Peterson-COL-7-UpperBounds-08 8 TECHNIQUES REACHABILITY_MAX
FORMULA Peterson-COL-7-UpperBounds-13 8 TECHNIQUES REACHABILITY_MAX
FORMULA Peterson-COL-7-UpperBounds-01 8 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[1] Max Struct:[8]
Starting property specific reduction for Peterson-COL-7-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-26 22:05:42] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2024-05-26 22:05:42] [INFO ] Computed 23 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 42 ms. (232 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-05-26 22:05:42] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 22:05:43] [INFO ] Invariant cache hit.
[2024-05-26 22:05:43] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2024-05-26 22:05:44] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2024-05-26 22:05:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 22:05:44] [INFO ] [Real]Added 497 Read/Feed constraints in 68 ms returned sat
[2024-05-26 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:05:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2024-05-26 22:05:45] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2024-05-26 22:05:45] [INFO ] [Nat]Added 497 Read/Feed constraints in 542 ms returned sat
[2024-05-26 22:05:46] [INFO ] Deduced a trap composed of 104 places in 970 ms of which 14 ms to minimize.
[2024-05-26 22:05:48] [INFO ] Deduced a trap composed of 51 places in 1169 ms of which 13 ms to minimize.
[2024-05-26 22:05:49] [INFO ] Deduced a trap composed of 15 places in 1053 ms of which 12 ms to minimize.
[2024-05-26 22:05:50] [INFO ] Deduced a trap composed of 2 places in 1371 ms of which 14 ms to minimize.
[2024-05-26 22:05:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 142 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 592/1096 places, 1704/2208 transitions.
[2024-05-26 22:05:50] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2024-05-26 22:05:50] [INFO ] Computed 23 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 3551 ms. (281 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 896 ms. (1114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-05-26 22:05:55] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:05:55] [INFO ] Invariant cache hit.
[2024-05-26 22:05:55] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2024-05-26 22:05:55] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-26 22:05:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 22:05:56] [INFO ] [Real]Added 497 Read/Feed constraints in 61 ms returned sat
[2024-05-26 22:05:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:05:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2024-05-26 22:05:56] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-05-26 22:05:56] [INFO ] [Nat]Added 497 Read/Feed constraints in 186 ms returned sat
[2024-05-26 22:05:57] [INFO ] Deduced a trap composed of 22 places in 491 ms of which 6 ms to minimize.
[2024-05-26 22:05:57] [INFO ] Deduced a trap composed of 13 places in 463 ms of which 7 ms to minimize.
[2024-05-26 22:05:58] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 5 ms to minimize.
[2024-05-26 22:05:58] [INFO ] Deduced a trap composed of 36 places in 594 ms of which 8 ms to minimize.
[2024-05-26 22:05:59] [INFO ] Deduced a trap composed of 45 places in 566 ms of which 7 ms to minimize.
[2024-05-26 22:06:00] [INFO ] Deduced a trap composed of 36 places in 453 ms of which 5 ms to minimize.
[2024-05-26 22:06:00] [INFO ] Deduced a trap composed of 36 places in 501 ms of which 8 ms to minimize.
[2024-05-26 22:06:01] [INFO ] Deduced a trap composed of 12 places in 639 ms of which 7 ms to minimize.
[2024-05-26 22:06:02] [INFO ] Deduced a trap composed of 48 places in 632 ms of which 7 ms to minimize.
[2024-05-26 22:06:02] [INFO ] Deduced a trap composed of 60 places in 584 ms of which 8 ms to minimize.
[2024-05-26 22:06:03] [INFO ] Deduced a trap composed of 36 places in 664 ms of which 11 ms to minimize.
[2024-05-26 22:06:04] [INFO ] Deduced a trap composed of 45 places in 663 ms of which 8 ms to minimize.
[2024-05-26 22:06:05] [INFO ] Deduced a trap composed of 22 places in 669 ms of which 8 ms to minimize.
[2024-05-26 22:06:05] [INFO ] Deduced a trap composed of 48 places in 659 ms of which 7 ms to minimize.
[2024-05-26 22:06:06] [INFO ] Deduced a trap composed of 67 places in 673 ms of which 8 ms to minimize.
[2024-05-26 22:06:07] [INFO ] Deduced a trap composed of 65 places in 672 ms of which 9 ms to minimize.
[2024-05-26 22:06:07] [INFO ] Deduced a trap composed of 22 places in 527 ms of which 7 ms to minimize.
[2024-05-26 22:06:08] [INFO ] Deduced a trap composed of 32 places in 644 ms of which 8 ms to minimize.
[2024-05-26 22:06:09] [INFO ] Deduced a trap composed of 62 places in 654 ms of which 8 ms to minimize.
[2024-05-26 22:06:10] [INFO ] Deduced a trap composed of 22 places in 675 ms of which 8 ms to minimize.
[2024-05-26 22:06:10] [INFO ] Deduced a trap composed of 14 places in 608 ms of which 8 ms to minimize.
[2024-05-26 22:06:11] [INFO ] Deduced a trap composed of 12 places in 646 ms of which 8 ms to minimize.
[2024-05-26 22:06:12] [INFO ] Deduced a trap composed of 25 places in 619 ms of which 8 ms to minimize.
[2024-05-26 22:06:12] [INFO ] Deduced a trap composed of 19 places in 530 ms of which 7 ms to minimize.
[2024-05-26 22:06:13] [INFO ] Deduced a trap composed of 21 places in 617 ms of which 7 ms to minimize.
[2024-05-26 22:06:14] [INFO ] Deduced a trap composed of 31 places in 633 ms of which 7 ms to minimize.
[2024-05-26 22:06:15] [INFO ] Deduced a trap composed of 21 places in 621 ms of which 7 ms to minimize.
[2024-05-26 22:06:15] [INFO ] Deduced a trap composed of 59 places in 634 ms of which 7 ms to minimize.
[2024-05-26 22:06:16] [INFO ] Deduced a trap composed of 39 places in 612 ms of which 8 ms to minimize.
[2024-05-26 22:06:17] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 8 ms to minimize.
[2024-05-26 22:06:17] [INFO ] Deduced a trap composed of 68 places in 633 ms of which 7 ms to minimize.
[2024-05-26 22:06:18] [INFO ] Deduced a trap composed of 64 places in 637 ms of which 8 ms to minimize.
[2024-05-26 22:06:19] [INFO ] Deduced a trap composed of 83 places in 639 ms of which 7 ms to minimize.
[2024-05-26 22:06:20] [INFO ] Deduced a trap composed of 48 places in 659 ms of which 8 ms to minimize.
[2024-05-26 22:06:20] [INFO ] Deduced a trap composed of 42 places in 638 ms of which 8 ms to minimize.
[2024-05-26 22:06:21] [INFO ] Deduced a trap composed of 47 places in 606 ms of which 8 ms to minimize.
[2024-05-26 22:06:22] [INFO ] Deduced a trap composed of 33 places in 633 ms of which 7 ms to minimize.
[2024-05-26 22:06:22] [INFO ] Deduced a trap composed of 41 places in 657 ms of which 8 ms to minimize.
[2024-05-26 22:06:23] [INFO ] Deduced a trap composed of 31 places in 636 ms of which 7 ms to minimize.
[2024-05-26 22:06:24] [INFO ] Deduced a trap composed of 29 places in 538 ms of which 7 ms to minimize.
[2024-05-26 22:06:25] [INFO ] Deduced a trap composed of 47 places in 606 ms of which 8 ms to minimize.
[2024-05-26 22:06:26] [INFO ] Deduced a trap composed of 49 places in 619 ms of which 7 ms to minimize.
[2024-05-26 22:06:27] [INFO ] Deduced a trap composed of 20 places in 616 ms of which 7 ms to minimize.
[2024-05-26 22:06:30] [INFO ] Deduced a trap composed of 30 places in 510 ms of which 8 ms to minimize.
[2024-05-26 22:06:31] [INFO ] Deduced a trap composed of 30 places in 638 ms of which 7 ms to minimize.
[2024-05-26 22:06:35] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 5 ms to minimize.
[2024-05-26 22:06:36] [INFO ] Deduced a trap composed of 58 places in 537 ms of which 8 ms to minimize.
[2024-05-26 22:06:37] [INFO ] Deduced a trap composed of 68 places in 614 ms of which 7 ms to minimize.
[2024-05-26 22:06:37] [INFO ] Deduced a trap composed of 103 places in 592 ms of which 7 ms to minimize.
[2024-05-26 22:06:38] [INFO ] Deduced a trap composed of 65 places in 608 ms of which 8 ms to minimize.
[2024-05-26 22:06:39] [INFO ] Deduced a trap composed of 60 places in 626 ms of which 7 ms to minimize.
[2024-05-26 22:06:39] [INFO ] Deduced a trap composed of 39 places in 620 ms of which 7 ms to minimize.
[2024-05-26 22:06:40] [INFO ] Deduced a trap composed of 29 places in 551 ms of which 7 ms to minimize.
[2024-05-26 22:06:41] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 44280 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 43 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 42 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-05-26 22:06:41] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:06:41] [INFO ] Invariant cache hit.
[2024-05-26 22:06:42] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2024-05-26 22:06:42] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:06:42] [INFO ] Invariant cache hit.
[2024-05-26 22:06:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 22:06:47] [INFO ] Implicit Places using invariants and state equation in 5660 ms returned []
Implicit Place search using SMT with State Equation took 6732 ms to find 0 implicit places.
[2024-05-26 22:06:48] [INFO ] Redundant transitions in 84 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-05-26 22:06:48] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:06:48] [INFO ] Invariant cache hit.
[2024-05-26 22:06:48] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 23 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-05-26 22:07:21] [INFO ] Deduced a trap composed of 79 places in 406 ms of which 9 ms to minimize.
[2024-05-26 22:07:22] [INFO ] Deduced a trap composed of 61 places in 732 ms of which 8 ms to minimize.
[2024-05-26 22:07:23] [INFO ] Deduced a trap composed of 51 places in 709 ms of which 8 ms to minimize.
[2024-05-26 22:07:24] [INFO ] Deduced a trap composed of 68 places in 727 ms of which 9 ms to minimize.
[2024-05-26 22:07:24] [INFO ] Deduced a trap composed of 33 places in 739 ms of which 8 ms to minimize.
[2024-05-26 22:07:25] [INFO ] Deduced a trap composed of 41 places in 694 ms of which 7 ms to minimize.
[2024-05-26 22:07:26] [INFO ] Deduced a trap composed of 47 places in 744 ms of which 8 ms to minimize.
[2024-05-26 22:07:27] [INFO ] Deduced a trap composed of 13 places in 763 ms of which 8 ms to minimize.
[2024-05-26 22:07:27] [INFO ] Deduced a trap composed of 40 places in 744 ms of which 8 ms to minimize.
[2024-05-26 22:07:28] [INFO ] Deduced a trap composed of 48 places in 735 ms of which 8 ms to minimize.
[2024-05-26 22:07:29] [INFO ] Deduced a trap composed of 27 places in 750 ms of which 8 ms to minimize.
[2024-05-26 22:07:30] [INFO ] Deduced a trap composed of 21 places in 779 ms of which 8 ms to minimize.
[2024-05-26 22:07:30] [INFO ] Deduced a trap composed of 34 places in 683 ms of which 8 ms to minimize.
[2024-05-26 22:07:31] [INFO ] Deduced a trap composed of 31 places in 708 ms of which 8 ms to minimize.
[2024-05-26 22:07:32] [INFO ] Deduced a trap composed of 21 places in 680 ms of which 8 ms to minimize.
[2024-05-26 22:07:33] [INFO ] Deduced a trap composed of 11 places in 657 ms of which 7 ms to minimize.
[2024-05-26 22:07:33] [INFO ] Deduced a trap composed of 66 places in 607 ms of which 7 ms to minimize.
[2024-05-26 22:07:34] [INFO ] Deduced a trap composed of 47 places in 635 ms of which 8 ms to minimize.
[2024-05-26 22:07:34] [INFO ] Deduced a trap composed of 15 places in 614 ms of which 8 ms to minimize.
[2024-05-26 22:07:35] [INFO ] Deduced a trap composed of 16 places in 612 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-05-26 22:07:36] [INFO ] Deduced a trap composed of 34 places in 386 ms of which 6 ms to minimize.
[2024-05-26 22:07:37] [INFO ] Deduced a trap composed of 17 places in 533 ms of which 7 ms to minimize.
[2024-05-26 22:07:38] [INFO ] Deduced a trap composed of 27 places in 543 ms of which 6 ms to minimize.
[2024-05-26 22:07:38] [INFO ] Deduced a trap composed of 27 places in 571 ms of which 8 ms to minimize.
[2024-05-26 22:07:39] [INFO ] Deduced a trap composed of 27 places in 672 ms of which 8 ms to minimize.
[2024-05-26 22:07:40] [INFO ] Deduced a trap composed of 27 places in 667 ms of which 8 ms to minimize.
[2024-05-26 22:07:40] [INFO ] Deduced a trap composed of 18 places in 661 ms of which 8 ms to minimize.
[2024-05-26 22:07:41] [INFO ] Deduced a trap composed of 37 places in 659 ms of which 7 ms to minimize.
[2024-05-26 22:07:42] [INFO ] Deduced a trap composed of 54 places in 695 ms of which 7 ms to minimize.
[2024-05-26 22:07:42] [INFO ] Deduced a trap composed of 61 places in 638 ms of which 8 ms to minimize.
[2024-05-26 22:07:43] [INFO ] Deduced a trap composed of 44 places in 664 ms of which 8 ms to minimize.
[2024-05-26 22:07:44] [INFO ] Deduced a trap composed of 26 places in 690 ms of which 8 ms to minimize.
[2024-05-26 22:07:44] [INFO ] Deduced a trap composed of 22 places in 580 ms of which 7 ms to minimize.
[2024-05-26 22:07:45] [INFO ] Deduced a trap composed of 26 places in 662 ms of which 8 ms to minimize.
[2024-05-26 22:07:46] [INFO ] Deduced a trap composed of 50 places in 622 ms of which 8 ms to minimize.
[2024-05-26 22:07:46] [INFO ] Deduced a trap composed of 14 places in 592 ms of which 8 ms to minimize.
[2024-05-26 22:07:47] [INFO ] Deduced a trap composed of 23 places in 663 ms of which 8 ms to minimize.
[2024-05-26 22:07:47] [INFO ] Deduced a trap composed of 62 places in 553 ms of which 8 ms to minimize.
[2024-05-26 22:07:48] [INFO ] Deduced a trap composed of 27 places in 638 ms of which 8 ms to minimize.
[2024-05-26 22:07:49] [INFO ] Deduced a trap composed of 26 places in 653 ms of which 8 ms to minimize.
SMT process timed out in 61149ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 61186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68059 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 703 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 298611 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 298611 steps, saw 52543 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-26 22:07:52] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:07:52] [INFO ] Invariant cache hit.
[2024-05-26 22:07:52] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:07:55] [INFO ] Deduced a trap composed of 24 places in 478 ms of which 8 ms to minimize.
[2024-05-26 22:07:56] [INFO ] Deduced a trap composed of 57 places in 572 ms of which 8 ms to minimize.
[2024-05-26 22:07:56] [INFO ] Deduced a trap composed of 25 places in 614 ms of which 8 ms to minimize.
[2024-05-26 22:07:57] [INFO ] Deduced a trap composed of 12 places in 670 ms of which 7 ms to minimize.
[2024-05-26 22:07:58] [INFO ] Deduced a trap composed of 32 places in 666 ms of which 8 ms to minimize.
[2024-05-26 22:07:58] [INFO ] Deduced a trap composed of 21 places in 662 ms of which 7 ms to minimize.
SMT process timed out in 6252ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 41 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 1052 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 303714 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 303714 steps, saw 53119 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-26 22:08:02] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:08:02] [INFO ] Invariant cache hit.
[2024-05-26 22:08:02] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:08:05] [INFO ] Deduced a trap composed of 24 places in 690 ms of which 8 ms to minimize.
[2024-05-26 22:08:06] [INFO ] Deduced a trap composed of 57 places in 658 ms of which 8 ms to minimize.
[2024-05-26 22:08:06] [INFO ] Deduced a trap composed of 25 places in 624 ms of which 8 ms to minimize.
[2024-05-26 22:08:07] [INFO ] Deduced a trap composed of 12 places in 688 ms of which 8 ms to minimize.
[2024-05-26 22:08:08] [INFO ] Deduced a trap composed of 32 places in 693 ms of which 8 ms to minimize.
[2024-05-26 22:08:09] [INFO ] Deduced a trap composed of 21 places in 639 ms of which 7 ms to minimize.
[2024-05-26 22:08:09] [INFO ] Deduced a trap composed of 38 places in 614 ms of which 6 ms to minimize.
[2024-05-26 22:08:10] [INFO ] Deduced a trap composed of 12 places in 600 ms of which 7 ms to minimize.
[2024-05-26 22:08:10] [INFO ] Deduced a trap composed of 12 places in 562 ms of which 8 ms to minimize.
[2024-05-26 22:08:11] [INFO ] Deduced a trap composed of 109 places in 668 ms of which 9 ms to minimize.
[2024-05-26 22:08:12] [INFO ] Deduced a trap composed of 56 places in 701 ms of which 7 ms to minimize.
[2024-05-26 22:08:13] [INFO ] Deduced a trap composed of 35 places in 592 ms of which 8 ms to minimize.
[2024-05-26 22:08:13] [INFO ] Deduced a trap composed of 46 places in 672 ms of which 8 ms to minimize.
[2024-05-26 22:08:14] [INFO ] Deduced a trap composed of 40 places in 699 ms of which 8 ms to minimize.
[2024-05-26 22:08:15] [INFO ] Deduced a trap composed of 26 places in 674 ms of which 8 ms to minimize.
[2024-05-26 22:08:15] [INFO ] Deduced a trap composed of 15 places in 587 ms of which 8 ms to minimize.
[2024-05-26 22:08:16] [INFO ] Deduced a trap composed of 68 places in 681 ms of which 8 ms to minimize.
[2024-05-26 22:08:17] [INFO ] Deduced a trap composed of 30 places in 661 ms of which 8 ms to minimize.
[2024-05-26 22:08:18] [INFO ] Deduced a trap composed of 54 places in 659 ms of which 7 ms to minimize.
[2024-05-26 22:08:18] [INFO ] Deduced a trap composed of 62 places in 668 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:08:19] [INFO ] Deduced a trap composed of 38 places in 664 ms of which 8 ms to minimize.
[2024-05-26 22:08:20] [INFO ] Deduced a trap composed of 100 places in 677 ms of which 8 ms to minimize.
[2024-05-26 22:08:21] [INFO ] Deduced a trap composed of 60 places in 629 ms of which 8 ms to minimize.
[2024-05-26 22:08:21] [INFO ] Deduced a trap composed of 46 places in 641 ms of which 8 ms to minimize.
[2024-05-26 22:08:22] [INFO ] Deduced a trap composed of 30 places in 690 ms of which 8 ms to minimize.
[2024-05-26 22:08:23] [INFO ] Deduced a trap composed of 56 places in 682 ms of which 7 ms to minimize.
[2024-05-26 22:08:23] [INFO ] Deduced a trap composed of 23 places in 689 ms of which 8 ms to minimize.
[2024-05-26 22:08:24] [INFO ] Deduced a trap composed of 12 places in 700 ms of which 8 ms to minimize.
[2024-05-26 22:08:25] [INFO ] Deduced a trap composed of 57 places in 668 ms of which 8 ms to minimize.
[2024-05-26 22:08:26] [INFO ] Deduced a trap composed of 17 places in 654 ms of which 8 ms to minimize.
[2024-05-26 22:08:26] [INFO ] Deduced a trap composed of 12 places in 676 ms of which 8 ms to minimize.
[2024-05-26 22:08:27] [INFO ] Deduced a trap composed of 83 places in 672 ms of which 7 ms to minimize.
[2024-05-26 22:08:28] [INFO ] Deduced a trap composed of 24 places in 657 ms of which 8 ms to minimize.
[2024-05-26 22:08:28] [INFO ] Deduced a trap composed of 45 places in 676 ms of which 8 ms to minimize.
[2024-05-26 22:08:29] [INFO ] Deduced a trap composed of 96 places in 672 ms of which 8 ms to minimize.
[2024-05-26 22:08:30] [INFO ] Deduced a trap composed of 129 places in 681 ms of which 7 ms to minimize.
[2024-05-26 22:08:31] [INFO ] Deduced a trap composed of 73 places in 658 ms of which 8 ms to minimize.
[2024-05-26 22:08:31] [INFO ] Deduced a trap composed of 53 places in 698 ms of which 8 ms to minimize.
[2024-05-26 22:08:32] [INFO ] Deduced a trap composed of 58 places in 633 ms of which 7 ms to minimize.
[2024-05-26 22:08:33] [INFO ] Deduced a trap composed of 45 places in 637 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 22:08:34] [INFO ] Deduced a trap composed of 44 places in 670 ms of which 9 ms to minimize.
[2024-05-26 22:08:34] [INFO ] Deduced a trap composed of 92 places in 688 ms of which 7 ms to minimize.
[2024-05-26 22:08:35] [INFO ] Deduced a trap composed of 22 places in 675 ms of which 7 ms to minimize.
[2024-05-26 22:08:36] [INFO ] Deduced a trap composed of 21 places in 681 ms of which 7 ms to minimize.
[2024-05-26 22:08:37] [INFO ] Deduced a trap composed of 24 places in 713 ms of which 8 ms to minimize.
[2024-05-26 22:08:37] [INFO ] Deduced a trap composed of 46 places in 665 ms of which 8 ms to minimize.
[2024-05-26 22:08:38] [INFO ] Deduced a trap composed of 20 places in 648 ms of which 8 ms to minimize.
[2024-05-26 22:08:39] [INFO ] Deduced a trap composed of 37 places in 666 ms of which 8 ms to minimize.
[2024-05-26 22:08:39] [INFO ] Deduced a trap composed of 41 places in 664 ms of which 7 ms to minimize.
[2024-05-26 22:08:40] [INFO ] Deduced a trap composed of 78 places in 689 ms of which 8 ms to minimize.
[2024-05-26 22:08:41] [INFO ] Deduced a trap composed of 34 places in 674 ms of which 8 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-26 22:08:42] [INFO ] Deduced a trap composed of 15 places in 664 ms of which 8 ms to minimize.
[2024-05-26 22:08:42] [INFO ] Deduced a trap composed of 81 places in 570 ms of which 7 ms to minimize.
[2024-05-26 22:08:43] [INFO ] Deduced a trap composed of 68 places in 616 ms of which 7 ms to minimize.
[2024-05-26 22:08:44] [INFO ] Deduced a trap composed of 68 places in 619 ms of which 8 ms to minimize.
[2024-05-26 22:08:44] [INFO ] Deduced a trap composed of 55 places in 618 ms of which 7 ms to minimize.
[2024-05-26 22:08:45] [INFO ] Deduced a trap composed of 47 places in 618 ms of which 8 ms to minimize.
[2024-05-26 22:08:46] [INFO ] Deduced a trap composed of 35 places in 601 ms of which 7 ms to minimize.
[2024-05-26 22:08:46] [INFO ] Deduced a trap composed of 45 places in 575 ms of which 7 ms to minimize.
[2024-05-26 22:08:47] [INFO ] Deduced a trap composed of 21 places in 626 ms of which 7 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 22:08:48] [INFO ] Deduced a trap composed of 14 places in 652 ms of which 7 ms to minimize.
SMT process timed out in 46133ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 40 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 387729 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 387729 steps, saw 62398 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-26 22:08:51] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:08:51] [INFO ] Invariant cache hit.
[2024-05-26 22:08:51] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:08:52] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/536 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1368/1904 variables, 536/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 497/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:08:54] [INFO ] Deduced a trap composed of 27 places in 487 ms of which 8 ms to minimize.
[2024-05-26 22:08:54] [INFO ] Deduced a trap composed of 36 places in 662 ms of which 7 ms to minimize.
[2024-05-26 22:08:55] [INFO ] Deduced a trap composed of 34 places in 653 ms of which 8 ms to minimize.
[2024-05-26 22:08:56] [INFO ] Deduced a trap composed of 42 places in 658 ms of which 8 ms to minimize.
[2024-05-26 22:08:56] [INFO ] Deduced a trap composed of 20 places in 678 ms of which 8 ms to minimize.
[2024-05-26 22:08:57] [INFO ] Deduced a trap composed of 11 places in 655 ms of which 8 ms to minimize.
[2024-05-26 22:08:58] [INFO ] Deduced a trap composed of 33 places in 663 ms of which 8 ms to minimize.
[2024-05-26 22:08:59] [INFO ] Deduced a trap composed of 28 places in 659 ms of which 8 ms to minimize.
[2024-05-26 22:08:59] [INFO ] Deduced a trap composed of 25 places in 719 ms of which 7 ms to minimize.
[2024-05-26 22:09:00] [INFO ] Deduced a trap composed of 19 places in 618 ms of which 7 ms to minimize.
[2024-05-26 22:09:01] [INFO ] Deduced a trap composed of 25 places in 678 ms of which 8 ms to minimize.
[2024-05-26 22:09:02] [INFO ] Deduced a trap composed of 14 places in 633 ms of which 8 ms to minimize.
[2024-05-26 22:09:02] [INFO ] Deduced a trap composed of 13 places in 630 ms of which 8 ms to minimize.
[2024-05-26 22:09:03] [INFO ] Deduced a trap composed of 35 places in 637 ms of which 7 ms to minimize.
[2024-05-26 22:09:04] [INFO ] Deduced a trap composed of 38 places in 612 ms of which 7 ms to minimize.
[2024-05-26 22:09:04] [INFO ] Deduced a trap composed of 28 places in 567 ms of which 7 ms to minimize.
[2024-05-26 22:09:05] [INFO ] Deduced a trap composed of 65 places in 619 ms of which 7 ms to minimize.
[2024-05-26 22:09:06] [INFO ] Deduced a trap composed of 57 places in 617 ms of which 7 ms to minimize.
[2024-05-26 22:09:06] [INFO ] Deduced a trap composed of 45 places in 623 ms of which 7 ms to minimize.
[2024-05-26 22:09:07] [INFO ] Deduced a trap composed of 70 places in 632 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:09:08] [INFO ] Deduced a trap composed of 63 places in 637 ms of which 7 ms to minimize.
[2024-05-26 22:09:08] [INFO ] Deduced a trap composed of 74 places in 549 ms of which 7 ms to minimize.
[2024-05-26 22:09:10] [INFO ] Deduced a trap composed of 33 places in 576 ms of which 7 ms to minimize.
[2024-05-26 22:09:11] [INFO ] Deduced a trap composed of 31 places in 638 ms of which 7 ms to minimize.
[2024-05-26 22:09:11] [INFO ] Deduced a trap composed of 34 places in 626 ms of which 7 ms to minimize.
[2024-05-26 22:09:12] [INFO ] Deduced a trap composed of 32 places in 617 ms of which 8 ms to minimize.
[2024-05-26 22:09:13] [INFO ] Deduced a trap composed of 69 places in 602 ms of which 7 ms to minimize.
[2024-05-26 22:09:14] [INFO ] Deduced a trap composed of 34 places in 547 ms of which 6 ms to minimize.
[2024-05-26 22:09:14] [INFO ] Deduced a trap composed of 53 places in 558 ms of which 8 ms to minimize.
[2024-05-26 22:09:15] [INFO ] Deduced a trap composed of 78 places in 632 ms of which 8 ms to minimize.
[2024-05-26 22:09:16] [INFO ] Deduced a trap composed of 23 places in 597 ms of which 7 ms to minimize.
[2024-05-26 22:09:16] [INFO ] Deduced a trap composed of 61 places in 636 ms of which 8 ms to minimize.
[2024-05-26 22:09:17] [INFO ] Deduced a trap composed of 33 places in 613 ms of which 7 ms to minimize.
[2024-05-26 22:09:18] [INFO ] Deduced a trap composed of 20 places in 585 ms of which 7 ms to minimize.
[2024-05-26 22:09:18] [INFO ] Deduced a trap composed of 32 places in 543 ms of which 7 ms to minimize.
[2024-05-26 22:09:19] [INFO ] Deduced a trap composed of 27 places in 602 ms of which 7 ms to minimize.
[2024-05-26 22:09:20] [INFO ] Deduced a trap composed of 85 places in 662 ms of which 8 ms to minimize.
[2024-05-26 22:09:20] [INFO ] Deduced a trap composed of 47 places in 640 ms of which 7 ms to minimize.
[2024-05-26 22:09:21] [INFO ] Deduced a trap composed of 30 places in 637 ms of which 7 ms to minimize.
[2024-05-26 22:09:22] [INFO ] Deduced a trap composed of 21 places in 609 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:09:23] [INFO ] Deduced a trap composed of 30 places in 486 ms of which 8 ms to minimize.
[2024-05-26 22:09:24] [INFO ] Deduced a trap composed of 15 places in 674 ms of which 7 ms to minimize.
[2024-05-26 22:09:24] [INFO ] Deduced a trap composed of 47 places in 591 ms of which 7 ms to minimize.
[2024-05-26 22:09:25] [INFO ] Deduced a trap composed of 57 places in 628 ms of which 7 ms to minimize.
[2024-05-26 22:09:26] [INFO ] Deduced a trap composed of 25 places in 635 ms of which 8 ms to minimize.
[2024-05-26 22:09:26] [INFO ] Deduced a trap composed of 29 places in 593 ms of which 8 ms to minimize.
[2024-05-26 22:09:27] [INFO ] Deduced a trap composed of 22 places in 650 ms of which 8 ms to minimize.
[2024-05-26 22:09:28] [INFO ] Deduced a trap composed of 13 places in 658 ms of which 7 ms to minimize.
[2024-05-26 22:09:29] [INFO ] Deduced a trap composed of 27 places in 633 ms of which 8 ms to minimize.
[2024-05-26 22:09:29] [INFO ] Deduced a trap composed of 26 places in 678 ms of which 8 ms to minimize.
[2024-05-26 22:09:30] [INFO ] Deduced a trap composed of 21 places in 654 ms of which 8 ms to minimize.
[2024-05-26 22:09:31] [INFO ] Deduced a trap composed of 26 places in 643 ms of which 8 ms to minimize.
[2024-05-26 22:09:32] [INFO ] Deduced a trap composed of 14 places in 653 ms of which 8 ms to minimize.
[2024-05-26 22:09:32] [INFO ] Deduced a trap composed of 51 places in 642 ms of which 7 ms to minimize.
[2024-05-26 22:09:33] [INFO ] Deduced a trap composed of 68 places in 626 ms of which 7 ms to minimize.
[2024-05-26 22:09:34] [INFO ] Deduced a trap composed of 53 places in 612 ms of which 7 ms to minimize.
[2024-05-26 22:09:34] [INFO ] Deduced a trap composed of 52 places in 593 ms of which 7 ms to minimize.
[2024-05-26 22:09:35] [INFO ] Deduced a trap composed of 29 places in 633 ms of which 8 ms to minimize.
[2024-05-26 22:09:36] [INFO ] Deduced a trap composed of 77 places in 587 ms of which 7 ms to minimize.
[2024-05-26 22:09:36] [INFO ] Deduced a trap composed of 66 places in 553 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:09:37] [INFO ] Deduced a trap composed of 62 places in 613 ms of which 7 ms to minimize.
[2024-05-26 22:09:38] [INFO ] Deduced a trap composed of 61 places in 590 ms of which 7 ms to minimize.
[2024-05-26 22:09:38] [INFO ] Deduced a trap composed of 54 places in 593 ms of which 7 ms to minimize.
[2024-05-26 22:09:39] [INFO ] Deduced a trap composed of 101 places in 598 ms of which 7 ms to minimize.
[2024-05-26 22:09:40] [INFO ] Deduced a trap composed of 41 places in 611 ms of which 7 ms to minimize.
[2024-05-26 22:09:40] [INFO ] Deduced a trap composed of 25 places in 521 ms of which 7 ms to minimize.
[2024-05-26 22:09:41] [INFO ] Deduced a trap composed of 22 places in 598 ms of which 7 ms to minimize.
[2024-05-26 22:09:42] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 5 ms to minimize.
[2024-05-26 22:09:42] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 7 ms to minimize.
[2024-05-26 22:09:43] [INFO ] Deduced a trap composed of 11 places in 637 ms of which 8 ms to minimize.
[2024-05-26 22:09:44] [INFO ] Deduced a trap composed of 21 places in 645 ms of which 8 ms to minimize.
[2024-05-26 22:09:44] [INFO ] Deduced a trap composed of 28 places in 573 ms of which 7 ms to minimize.
[2024-05-26 22:09:45] [INFO ] Deduced a trap composed of 29 places in 595 ms of which 7 ms to minimize.
[2024-05-26 22:09:46] [INFO ] Deduced a trap composed of 27 places in 579 ms of which 7 ms to minimize.
[2024-05-26 22:09:46] [INFO ] Deduced a trap composed of 44 places in 449 ms of which 7 ms to minimize.
[2024-05-26 22:09:47] [INFO ] Deduced a trap composed of 29 places in 607 ms of which 7 ms to minimize.
[2024-05-26 22:09:48] [INFO ] Deduced a trap composed of 71 places in 607 ms of which 7 ms to minimize.
[2024-05-26 22:09:48] [INFO ] Deduced a trap composed of 39 places in 601 ms of which 8 ms to minimize.
[2024-05-26 22:09:49] [INFO ] Deduced a trap composed of 30 places in 592 ms of which 7 ms to minimize.
[2024-05-26 22:09:50] [INFO ] Deduced a trap composed of 87 places in 659 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 22:09:50] [INFO ] Deduced a trap composed of 63 places in 475 ms of which 7 ms to minimize.
[2024-05-26 22:09:51] [INFO ] Deduced a trap composed of 78 places in 618 ms of which 8 ms to minimize.
[2024-05-26 22:09:52] [INFO ] Deduced a trap composed of 66 places in 616 ms of which 7 ms to minimize.
[2024-05-26 22:09:52] [INFO ] Deduced a trap composed of 39 places in 472 ms of which 7 ms to minimize.
[2024-05-26 22:09:53] [INFO ] Deduced a trap composed of 41 places in 599 ms of which 8 ms to minimize.
[2024-05-26 22:09:54] [INFO ] Deduced a trap composed of 30 places in 592 ms of which 8 ms to minimize.
[2024-05-26 22:09:54] [INFO ] Deduced a trap composed of 25 places in 591 ms of which 7 ms to minimize.
[2024-05-26 22:09:55] [INFO ] Deduced a trap composed of 56 places in 413 ms of which 8 ms to minimize.
[2024-05-26 22:09:56] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 7 ms to minimize.
[2024-05-26 22:09:58] [INFO ] Deduced a trap composed of 40 places in 505 ms of which 7 ms to minimize.
[2024-05-26 22:09:59] [INFO ] Deduced a trap composed of 51 places in 575 ms of which 7 ms to minimize.
[2024-05-26 22:09:59] [INFO ] Deduced a trap composed of 41 places in 604 ms of which 7 ms to minimize.
[2024-05-26 22:10:00] [INFO ] Deduced a trap composed of 54 places in 589 ms of which 7 ms to minimize.
[2024-05-26 22:10:01] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 5 ms to minimize.
[2024-05-26 22:10:01] [INFO ] Deduced a trap composed of 47 places in 588 ms of which 7 ms to minimize.
[2024-05-26 22:10:02] [INFO ] Deduced a trap composed of 74 places in 573 ms of which 7 ms to minimize.
[2024-05-26 22:10:03] [INFO ] Deduced a trap composed of 108 places in 586 ms of which 7 ms to minimize.
[2024-05-26 22:10:03] [INFO ] Deduced a trap composed of 65 places in 477 ms of which 7 ms to minimize.
[2024-05-26 22:10:04] [INFO ] Deduced a trap composed of 47 places in 540 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75008 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 100/100 constraints]
After SMT, in 75841ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-05-26 22:10:07] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:10:07] [INFO ] Invariant cache hit.
[2024-05-26 22:10:08] [INFO ] Implicit Places using invariants in 979 ms returned []
[2024-05-26 22:10:08] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:10:08] [INFO ] Invariant cache hit.
[2024-05-26 22:10:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 22:10:14] [INFO ] Implicit Places using invariants and state equation in 5787 ms returned []
Implicit Place search using SMT with State Equation took 6768 ms to find 0 implicit places.
[2024-05-26 22:10:14] [INFO ] Redundant transitions in 51 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-05-26 22:10:14] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 22:10:14] [INFO ] Invariant cache hit.
[2024-05-26 22:10:14] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 23 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-05-26 22:10:48] [INFO ] Deduced a trap composed of 79 places in 658 ms of which 8 ms to minimize.
[2024-05-26 22:10:48] [INFO ] Deduced a trap composed of 61 places in 706 ms of which 8 ms to minimize.
[2024-05-26 22:10:49] [INFO ] Deduced a trap composed of 51 places in 712 ms of which 8 ms to minimize.
[2024-05-26 22:10:50] [INFO ] Deduced a trap composed of 68 places in 724 ms of which 8 ms to minimize.
[2024-05-26 22:10:50] [INFO ] Deduced a trap composed of 33 places in 732 ms of which 9 ms to minimize.
[2024-05-26 22:10:51] [INFO ] Deduced a trap composed of 41 places in 711 ms of which 9 ms to minimize.
[2024-05-26 22:10:52] [INFO ] Deduced a trap composed of 47 places in 710 ms of which 8 ms to minimize.
[2024-05-26 22:10:53] [INFO ] Deduced a trap composed of 13 places in 587 ms of which 8 ms to minimize.
[2024-05-26 22:10:53] [INFO ] Deduced a trap composed of 40 places in 676 ms of which 8 ms to minimize.
[2024-05-26 22:10:54] [INFO ] Deduced a trap composed of 48 places in 720 ms of which 8 ms to minimize.
[2024-05-26 22:10:55] [INFO ] Deduced a trap composed of 27 places in 691 ms of which 8 ms to minimize.
[2024-05-26 22:10:55] [INFO ] Deduced a trap composed of 21 places in 653 ms of which 8 ms to minimize.
[2024-05-26 22:10:56] [INFO ] Deduced a trap composed of 34 places in 635 ms of which 7 ms to minimize.
[2024-05-26 22:10:57] [INFO ] Deduced a trap composed of 31 places in 627 ms of which 8 ms to minimize.
[2024-05-26 22:10:57] [INFO ] Deduced a trap composed of 21 places in 664 ms of which 8 ms to minimize.
[2024-05-26 22:10:58] [INFO ] Deduced a trap composed of 11 places in 630 ms of which 7 ms to minimize.
[2024-05-26 22:10:59] [INFO ] Deduced a trap composed of 66 places in 565 ms of which 7 ms to minimize.
[2024-05-26 22:10:59] [INFO ] Deduced a trap composed of 47 places in 596 ms of which 8 ms to minimize.
[2024-05-26 22:11:00] [INFO ] Deduced a trap composed of 15 places in 629 ms of which 8 ms to minimize.
[2024-05-26 22:11:00] [INFO ] Deduced a trap composed of 16 places in 607 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-05-26 22:11:02] [INFO ] Deduced a trap composed of 34 places in 366 ms of which 4 ms to minimize.
[2024-05-26 22:11:03] [INFO ] Deduced a trap composed of 17 places in 677 ms of which 8 ms to minimize.
[2024-05-26 22:11:03] [INFO ] Deduced a trap composed of 27 places in 653 ms of which 8 ms to minimize.
[2024-05-26 22:11:04] [INFO ] Deduced a trap composed of 27 places in 654 ms of which 8 ms to minimize.
[2024-05-26 22:11:05] [INFO ] Deduced a trap composed of 27 places in 652 ms of which 8 ms to minimize.
[2024-05-26 22:11:05] [INFO ] Deduced a trap composed of 27 places in 672 ms of which 8 ms to minimize.
[2024-05-26 22:11:06] [INFO ] Deduced a trap composed of 18 places in 660 ms of which 7 ms to minimize.
[2024-05-26 22:11:07] [INFO ] Deduced a trap composed of 37 places in 629 ms of which 7 ms to minimize.
[2024-05-26 22:11:07] [INFO ] Deduced a trap composed of 54 places in 633 ms of which 8 ms to minimize.
[2024-05-26 22:11:08] [INFO ] Deduced a trap composed of 61 places in 659 ms of which 7 ms to minimize.
[2024-05-26 22:11:08] [INFO ] Deduced a trap composed of 44 places in 517 ms of which 7 ms to minimize.
[2024-05-26 22:11:09] [INFO ] Deduced a trap composed of 26 places in 623 ms of which 7 ms to minimize.
[2024-05-26 22:11:10] [INFO ] Deduced a trap composed of 22 places in 651 ms of which 7 ms to minimize.
[2024-05-26 22:11:10] [INFO ] Deduced a trap composed of 26 places in 569 ms of which 8 ms to minimize.
[2024-05-26 22:11:11] [INFO ] Deduced a trap composed of 50 places in 656 ms of which 7 ms to minimize.
[2024-05-26 22:11:12] [INFO ] Deduced a trap composed of 14 places in 584 ms of which 8 ms to minimize.
[2024-05-26 22:11:12] [INFO ] Deduced a trap composed of 23 places in 672 ms of which 8 ms to minimize.
[2024-05-26 22:11:13] [INFO ] Deduced a trap composed of 62 places in 655 ms of which 7 ms to minimize.
[2024-05-26 22:11:14] [INFO ] Deduced a trap composed of 27 places in 655 ms of which 8 ms to minimize.
[2024-05-26 22:11:14] [INFO ] Deduced a trap composed of 26 places in 683 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/1960 variables, and 63 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 40/40 constraints]
After SMT, in 61225ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 61260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68120 ms. Remains : 592/592 places, 1704/1704 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Ending property specific reduction for Peterson-COL-7-UpperBounds-02 in 332752 ms.
[2024-05-26 22:11:16] [INFO ] Flatten gal took : 520 ms
[2024-05-26 22:11:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-26 22:11:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1096 places, 2208 transitions and 7792 arcs took 24 ms.
Total runtime 900732 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Peterson-COL-7
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1096
TRANSITIONS: 2208
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.060s, Sys 0.000s]
SAVING FILE /home/mcc/execution/409/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: 2745
MODEL NAME: /home/mcc/execution/409/model
1096 places, 2208 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.
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="Peterson-COL-7"
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 Peterson-COL-7, 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 r267-smll-171654406000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;