About the Execution of ITS-Tools for Peterson-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.516 | 2906489.00 | 3211828.00 | 11403.20 | 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.r268-smll-171654407200245.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 itstools
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 r268-smll-171654407200245
=====================================================================
--------------------
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 1716758511643
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-26 21:21:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 21:21:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 21:21:54] [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:21:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 21:21:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1336 ms
[2024-05-26 21:21:55] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-26 21:21:55] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-26 21:21:55] [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:21:55] [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:21:55] [INFO ] Invariant cache hit.
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-26 21:21:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-26 21:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-26 21:21:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 21:21:56] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 15 ms.
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-26 21:21:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 21:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-26 21:21:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 21:21:56] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 21:21:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:21:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 21:21:56] [INFO ] Added : 12 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 21:21:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-26 21:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:21:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:21:57] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 21:21:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:21:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:21:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:21:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:21:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 21:21:57] [INFO ] Added : 11 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 21:21:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:57] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-26 21:21:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:21:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 21:21:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 21:21:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:21:57] [INFO ] Added : 11 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 21:21:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:21:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 21:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:21:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 21:21:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 21:21:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 21:21:57] [INFO ] Added : 11 causal constraints over 5 iterations in 23 ms. Result :sat
Minimization took 8 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:21:57] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 185 ms.
[2024-05-26 21:21:57] [INFO ] Unfolded 7 HLPN properties in 2 ms.
Deduced a syphon composed of 56 places in 57 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:21:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-05-26 21:21:57] [INFO ] Computed 31 invariants in 68 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 613 ms. (16 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-12 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 500 ms. (99 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1] Max Struct:[8, 8]
[2024-05-26 21:21:59] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-26 21:21:59] [INFO ] Invariant cache hit.
[2024-05-26 21:21:59] [INFO ] [Real]Absence check using 23 positive place invariants in 65 ms returned sat
[2024-05-26 21:21:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 21 ms returned sat
[2024-05-26 21:22:01] [INFO ] [Real]Absence check using state equation in 1494 ms returned sat
[2024-05-26 21:22:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:22:01] [INFO ] [Real]Added 497 Read/Feed constraints in 195 ms returned sat
[2024-05-26 21:22:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:22:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 80 ms returned sat
[2024-05-26 21:22:02] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2024-05-26 21:22:03] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2024-05-26 21:22:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 21:22:04] [INFO ] [Nat]Added 497 Read/Feed constraints in 845 ms returned sat
[2024-05-26 21:22:05] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 390 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Minimization took 6 ms.
[2024-05-26 21:22:07] [INFO ] [Real]Absence check using 23 positive place invariants in 79 ms returned sat
[2024-05-26 21:22:07] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2024-05-26 21:22:08] [INFO ] [Real]Absence check using state equation in 1600 ms returned sat
[2024-05-26 21:22:09] [INFO ] [Real]Added 497 Read/Feed constraints in 264 ms returned sat
[2024-05-26 21:22:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:22:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 55 ms returned sat
[2024-05-26 21:22:09] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2024-05-26 21:22:11] [INFO ] [Nat]Absence check using state equation in 1683 ms returned sat
[2024-05-26 21:22:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 21:22:12] [INFO ] [Nat]Added 497 Read/Feed constraints in 1074 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 1] Max Struct:[8, 8]
Support contains 456 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 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2208
Deduced a syphon composed of 104 places in 6 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Applied a total of 1776 rules in 682 ms. Remains 1104 /1992 variables (removed 888) and now considering 2208/3096 (removed 888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 1104/1992 places, 2208/3096 transitions.
[2024-05-26 21:22:13] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2024-05-26 21:22:13] [INFO ] Computed 31 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 1] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 10301 ms. (97 steps per ms)
BEST_FIRST walk for 1581447 steps (3 resets) in 6777 ms. (233 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1] Max Struct:[8, 8]
[2024-05-26 21:22:30] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:22:30] [INFO ] Invariant cache hit.
[2024-05-26 21:22:30] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2024-05-26 21:22:30] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2024-05-26 21:22:31] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2024-05-26 21:22:31] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:22:31] [INFO ] [Real]Added 497 Read/Feed constraints in 174 ms returned sat
[2024-05-26 21:22:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:22:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 48 ms returned sat
[2024-05-26 21:22:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2024-05-26 21:22:33] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2024-05-26 21:22:33] [INFO ] [Nat]Added 497 Read/Feed constraints in 287 ms returned sat
[2024-05-26 21:22:34] [INFO ] Deduced a trap composed of 17 places in 1129 ms of which 143 ms to minimize.
[2024-05-26 21:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1348 ms
[2024-05-26 21:22:35] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 271 ms.
[2024-05-26 21:22:41] [INFO ] Deduced a trap composed of 126 places in 1076 ms of which 12 ms to minimize.
[2024-05-26 21:22:43] [INFO ] Deduced a trap composed of 23 places in 1171 ms of which 10 ms to minimize.
[2024-05-26 21:22:44] [INFO ] Deduced a trap composed of 78 places in 1018 ms of which 14 ms to minimize.
[2024-05-26 21:22:45] [INFO ] Deduced a trap composed of 63 places in 1116 ms of which 13 ms to minimize.
[2024-05-26 21:22:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5676 ms
[2024-05-26 21:22:46] [INFO ] Added : 113 causal constraints over 23 iterations in 11851 ms. Result :sat
Minimization took 1449 ms.
[2024-05-26 21:22:48] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2024-05-26 21:22:48] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-26 21:22:49] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2024-05-26 21:22:49] [INFO ] [Real]Added 497 Read/Feed constraints in 138 ms returned sat
[2024-05-26 21:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:22:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 44 ms returned sat
[2024-05-26 21:22:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2024-05-26 21:22:50] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2024-05-26 21:22:51] [INFO ] [Nat]Added 497 Read/Feed constraints in 840 ms returned sat
[2024-05-26 21:22:52] [INFO ] Deduced a trap composed of 15 places in 1084 ms of which 9 ms to minimize.
[2024-05-26 21:22:54] [INFO ] Deduced a trap composed of 49 places in 1152 ms of which 13 ms to minimize.
[2024-05-26 21:22:55] [INFO ] Deduced a trap composed of 39 places in 1221 ms of which 14 ms to minimize.
[2024-05-26 21:22:56] [INFO ] Deduced a trap composed of 58 places in 801 ms of which 9 ms to minimize.
[2024-05-26 21:22:57] [INFO ] Deduced a trap composed of 33 places in 914 ms of which 9 ms to minimize.
[2024-05-26 21:22:58] [INFO ] Deduced a trap composed of 28 places in 1026 ms of which 9 ms to minimize.
[2024-05-26 21:22:59] [INFO ] Deduced a trap composed of 13 places in 1030 ms of which 9 ms to minimize.
[2024-05-26 21:23:00] [INFO ] Deduced a trap composed of 31 places in 1250 ms of which 13 ms to minimize.
[2024-05-26 21:23:02] [INFO ] Deduced a trap composed of 108 places in 999 ms of which 9 ms to minimize.
[2024-05-26 21:23:03] [INFO ] Deduced a trap composed of 120 places in 1047 ms of which 9 ms to minimize.
[2024-05-26 21:23:04] [INFO ] Deduced a trap composed of 88 places in 1168 ms of which 13 ms to minimize.
[2024-05-26 21:23:05] [INFO ] Deduced a trap composed of 92 places in 1057 ms of which 8 ms to minimize.
[2024-05-26 21:23:06] [INFO ] Deduced a trap composed of 27 places in 882 ms of which 8 ms to minimize.
[2024-05-26 21:23:08] [INFO ] Deduced a trap composed of 56 places in 1058 ms of which 13 ms to minimize.
[2024-05-26 21:23:09] [INFO ] Deduced a trap composed of 39 places in 1006 ms of which 8 ms to minimize.
[2024-05-26 21:23:10] [INFO ] Deduced a trap composed of 21 places in 1019 ms of which 14 ms to minimize.
[2024-05-26 21:23:11] [INFO ] Deduced a trap composed of 36 places in 1149 ms of which 12 ms to minimize.
[2024-05-26 21:23:12] [INFO ] Deduced a trap composed of 26 places in 1176 ms of which 13 ms to minimize.
[2024-05-26 21:23:14] [INFO ] Deduced a trap composed of 17 places in 1141 ms of which 8 ms to minimize.
[2024-05-26 21:23:15] [INFO ] Deduced a trap composed of 31 places in 831 ms of which 10 ms to minimize.
[2024-05-26 21:23:15] [INFO ] Deduced a trap composed of 36 places in 805 ms of which 9 ms to minimize.
[2024-05-26 21:23:16] [INFO ] Deduced a trap composed of 71 places in 918 ms of which 10 ms to minimize.
[2024-05-26 21:23:18] [INFO ] Deduced a trap composed of 64 places in 1036 ms of which 10 ms to minimize.
[2024-05-26 21:23:18] [INFO ] Deduced a trap composed of 34 places in 807 ms of which 10 ms to minimize.
[2024-05-26 21:23:20] [INFO ] Deduced a trap composed of 32 places in 960 ms of which 8 ms to minimize.
[2024-05-26 21:23:21] [INFO ] Deduced a trap composed of 114 places in 791 ms of which 14 ms to minimize.
[2024-05-26 21:23:22] [INFO ] Deduced a trap composed of 70 places in 1178 ms of which 13 ms to minimize.
[2024-05-26 21:23:23] [INFO ] Deduced a trap composed of 47 places in 1099 ms of which 11 ms to minimize.
[2024-05-26 21:23:24] [INFO ] Deduced a trap composed of 32 places in 1132 ms of which 14 ms to minimize.
[2024-05-26 21:23:26] [INFO ] Deduced a trap composed of 30 places in 1164 ms of which 13 ms to minimize.
[2024-05-26 21:23:27] [INFO ] Deduced a trap composed of 29 places in 1146 ms of which 12 ms to minimize.
[2024-05-26 21:23:28] [INFO ] Deduced a trap composed of 20 places in 1098 ms of which 8 ms to minimize.
[2024-05-26 21:23:29] [INFO ] Deduced a trap composed of 59 places in 745 ms of which 8 ms to minimize.
[2024-05-26 21:23:30] [INFO ] Deduced a trap composed of 13 places in 741 ms of which 8 ms to minimize.
[2024-05-26 21:23:31] [INFO ] Deduced a trap composed of 32 places in 812 ms of which 12 ms to minimize.
[2024-05-26 21:23:32] [INFO ] Deduced a trap composed of 70 places in 1108 ms of which 13 ms to minimize.
[2024-05-26 21:23:33] [INFO ] Deduced a trap composed of 23 places in 991 ms of which 10 ms to minimize.
[2024-05-26 21:23:34] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 42964 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:[7, 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 80 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 80 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 79 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-26 21:23:36] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:23:36] [INFO ] Invariant cache hit.
[2024-05-26 21:23:37] [INFO ] Implicit Places using invariants in 991 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 995 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 47 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 1126 ms. Remains : 1096/1104 places, 2208/2208 transitions.
[2024-05-26 21:23:37] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2024-05-26 21:23:37] [INFO ] Computed 23 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 1] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 9653 ms. (103 steps per ms)
BEST_FIRST walk for 1604640 steps (3 resets) in 7084 ms. (226 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1] Max Struct:[8, 8]
[2024-05-26 21:23:53] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:23:53] [INFO ] Invariant cache hit.
[2024-05-26 21:23:54] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2024-05-26 21:23:55] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2024-05-26 21:23:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:23:55] [INFO ] [Real]Added 497 Read/Feed constraints in 242 ms returned sat
[2024-05-26 21:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:23:55] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2024-05-26 21:23:56] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2024-05-26 21:23:56] [INFO ] [Nat]Added 497 Read/Feed constraints in 271 ms returned sat
[2024-05-26 21:23:58] [INFO ] Deduced a trap composed of 77 places in 1461 ms of which 16 ms to minimize.
[2024-05-26 21:24:00] [INFO ] Deduced a trap composed of 34 places in 1470 ms of which 15 ms to minimize.
[2024-05-26 21:24:01] [INFO ] Deduced a trap composed of 38 places in 1393 ms of which 16 ms to minimize.
[2024-05-26 21:24:02] [INFO ] Deduced a trap composed of 65 places in 1230 ms of which 9 ms to minimize.
[2024-05-26 21:24:04] [INFO ] Deduced a trap composed of 57 places in 1411 ms of which 16 ms to minimize.
[2024-05-26 21:24:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 7567 ms
[2024-05-26 21:24:04] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 242 ms.
[2024-05-26 21:24:13] [INFO ] Deduced a trap composed of 34 places in 1414 ms of which 15 ms to minimize.
[2024-05-26 21:24:14] [INFO ] Deduced a trap composed of 11 places in 1134 ms of which 9 ms to minimize.
[2024-05-26 21:24:16] [INFO ] Deduced a trap composed of 52 places in 1258 ms of which 15 ms to minimize.
[2024-05-26 21:24:17] [INFO ] Deduced a trap composed of 62 places in 1373 ms of which 15 ms to minimize.
[2024-05-26 21:24:19] [INFO ] Deduced a trap composed of 46 places in 1407 ms of which 15 ms to minimize.
[2024-05-26 21:24:20] [INFO ] Deduced a trap composed of 42 places in 1398 ms of which 15 ms to minimize.
[2024-05-26 21:24:22] [INFO ] Deduced a trap composed of 55 places in 1243 ms of which 9 ms to minimize.
[2024-05-26 21:24:23] [INFO ] Deduced a trap composed of 15 places in 1191 ms of which 14 ms to minimize.
[2024-05-26 21:24:25] [INFO ] Deduced a trap composed of 33 places in 1058 ms of which 13 ms to minimize.
[2024-05-26 21:24:27] [INFO ] Deduced a trap composed of 43 places in 1242 ms of which 15 ms to minimize.
[2024-05-26 21:24:28] [INFO ] Deduced a trap composed of 55 places in 1384 ms of which 15 ms to minimize.
[2024-05-26 21:24:30] [INFO ] Deduced a trap composed of 24 places in 1107 ms of which 14 ms to minimize.
[2024-05-26 21:24:34] [INFO ] Deduced a trap composed of 35 places in 1178 ms of which 15 ms to minimize.
[2024-05-26 21:24:36] [INFO ] Deduced a trap composed of 13 places in 1195 ms of which 15 ms to minimize.
[2024-05-26 21:24:38] [INFO ] Deduced a trap composed of 13 places in 1061 ms of which 16 ms to minimize.
[2024-05-26 21:24:39] [INFO ] Deduced a trap composed of 118 places in 1301 ms of which 14 ms to minimize.
[2024-05-26 21:24:41] [INFO ] Deduced a trap composed of 29 places in 1152 ms of which 9 ms to minimize.
[2024-05-26 21:24:41] [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.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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)
[2024-05-26 21:24:41] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2024-05-26 21:24:42] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2024-05-26 21:24:42] [INFO ] [Real]Added 497 Read/Feed constraints in 97 ms returned sat
[2024-05-26 21:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:24:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2024-05-26 21:24:43] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2024-05-26 21:24:44] [INFO ] [Nat]Added 497 Read/Feed constraints in 633 ms returned sat
[2024-05-26 21:24:45] [INFO ] Deduced a trap composed of 85 places in 935 ms of which 13 ms to minimize.
[2024-05-26 21:24:46] [INFO ] Deduced a trap composed of 24 places in 1238 ms of which 13 ms to minimize.
[2024-05-26 21:24:48] [INFO ] Deduced a trap composed of 33 places in 1221 ms of which 14 ms to minimize.
[2024-05-26 21:24:49] [INFO ] Deduced a trap composed of 92 places in 1160 ms of which 14 ms to minimize.
[2024-05-26 21:24:50] [INFO ] Deduced a trap composed of 39 places in 1083 ms of which 8 ms to minimize.
[2024-05-26 21:24:51] [INFO ] Deduced a trap composed of 29 places in 1033 ms of which 12 ms to minimize.
[2024-05-26 21:24:53] [INFO ] Deduced a trap composed of 24 places in 1197 ms of which 14 ms to minimize.
[2024-05-26 21:24:54] [INFO ] Deduced a trap composed of 42 places in 1206 ms of which 14 ms to minimize.
[2024-05-26 21:24:55] [INFO ] Deduced a trap composed of 35 places in 1258 ms of which 14 ms to minimize.
[2024-05-26 21:24:57] [INFO ] Deduced a trap composed of 24 places in 1216 ms of which 12 ms to minimize.
[2024-05-26 21:24:58] [INFO ] Deduced a trap composed of 49 places in 1265 ms of which 14 ms to minimize.
[2024-05-26 21:24:59] [INFO ] Deduced a trap composed of 15 places in 1130 ms of which 13 ms to minimize.
[2024-05-26 21:25:01] [INFO ] Deduced a trap composed of 24 places in 1088 ms of which 12 ms to minimize.
[2024-05-26 21:25:02] [INFO ] Deduced a trap composed of 24 places in 1156 ms of which 13 ms to minimize.
[2024-05-26 21:25:03] [INFO ] Deduced a trap composed of 74 places in 1279 ms of which 14 ms to minimize.
[2024-05-26 21:25:05] [INFO ] Deduced a trap composed of 53 places in 1277 ms of which 13 ms to minimize.
[2024-05-26 21:25:06] [INFO ] Deduced a trap composed of 33 places in 1243 ms of which 14 ms to minimize.
[2024-05-26 21:25:07] [INFO ] Deduced a trap composed of 31 places in 1212 ms of which 12 ms to minimize.
[2024-05-26 21:25:09] [INFO ] Deduced a trap composed of 13 places in 1122 ms of which 14 ms to minimize.
[2024-05-26 21:25:10] [INFO ] Deduced a trap composed of 31 places in 1229 ms of which 13 ms to minimize.
[2024-05-26 21:25:12] [INFO ] Deduced a trap composed of 13 places in 1144 ms of which 12 ms to minimize.
[2024-05-26 21:25:13] [INFO ] Deduced a trap composed of 83 places in 1066 ms of which 13 ms to minimize.
[2024-05-26 21:25:14] [INFO ] Deduced a trap composed of 64 places in 974 ms of which 12 ms to minimize.
[2024-05-26 21:25:15] [INFO ] Deduced a trap composed of 62 places in 1155 ms of which 14 ms to minimize.
[2024-05-26 21:25:17] [INFO ] Deduced a trap composed of 28 places in 1260 ms of which 14 ms to minimize.
[2024-05-26 21:25:18] [INFO ] Deduced a trap composed of 35 places in 1247 ms of which 14 ms to minimize.
[2024-05-26 21:25:20] [INFO ] Deduced a trap composed of 84 places in 1200 ms of which 13 ms to minimize.
[2024-05-26 21:25:21] [INFO ] Deduced a trap composed of 90 places in 1304 ms of which 14 ms to minimize.
[2024-05-26 21:25:23] [INFO ] Deduced a trap composed of 101 places in 1197 ms of which 13 ms to minimize.
[2024-05-26 21:25:24] [INFO ] Deduced a trap composed of 47 places in 1142 ms of which 13 ms to minimize.
[2024-05-26 21:25:25] [INFO ] Deduced a trap composed of 80 places in 899 ms of which 8 ms to minimize.
[2024-05-26 21:25:26] [INFO ] Deduced a trap composed of 55 places in 1195 ms of which 14 ms to minimize.
[2024-05-26 21:25:27] [INFO ] Deduced a trap composed of 103 places in 1216 ms of which 14 ms to minimize.
[2024-05-26 21:25:27] [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:[7, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 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 75 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 75 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 67 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-26 21:25:28] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:25:28] [INFO ] Invariant cache hit.
[2024-05-26 21:25:29] [INFO ] Implicit Places using invariants in 919 ms returned []
[2024-05-26 21:25:29] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:25:29] [INFO ] Invariant cache hit.
[2024-05-26 21:25:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:25:37] [INFO ] Implicit Places using invariants and state equation in 8617 ms returned []
Implicit Place search using SMT with State Equation took 9539 ms to find 0 implicit places.
[2024-05-26 21:25:37] [INFO ] Redundant transitions in 185 ms returned []
Running 2200 sub problems to find dead transitions.
[2024-05-26 21:25:37] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:25:37] [INFO ] Invariant cache hit.
[2024-05-26 21:25:37] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 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 30151 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 21:26:12] [INFO ] Deduced a trap composed of 25 places in 840 ms of which 8 ms to minimize.
[2024-05-26 21:26:13] [INFO ] Deduced a trap composed of 48 places in 1051 ms of which 9 ms to minimize.
[2024-05-26 21:26:14] [INFO ] Deduced a trap composed of 58 places in 1050 ms of which 9 ms to minimize.
[2024-05-26 21:26:15] [INFO ] Deduced a trap composed of 115 places in 949 ms of which 9 ms to minimize.
[2024-05-26 21:26:16] [INFO ] Deduced a trap composed of 27 places in 1018 ms of which 9 ms to minimize.
[2024-05-26 21:26:18] [INFO ] Deduced a trap composed of 37 places in 1030 ms of which 9 ms to minimize.
[2024-05-26 21:26:19] [INFO ] Deduced a trap composed of 35 places in 1102 ms of which 9 ms to minimize.
[2024-05-26 21:26:20] [INFO ] Deduced a trap composed of 77 places in 1029 ms of which 9 ms to minimize.
[2024-05-26 21:26:21] [INFO ] Deduced a trap composed of 33 places in 881 ms of which 9 ms to minimize.
[2024-05-26 21:26:22] [INFO ] Deduced a trap composed of 59 places in 890 ms of which 9 ms to minimize.
[2024-05-26 21:26:23] [INFO ] Deduced a trap composed of 63 places in 1007 ms of which 9 ms to minimize.
[2024-05-26 21:26:24] [INFO ] Deduced a trap composed of 41 places in 1113 ms of which 9 ms to minimize.
[2024-05-26 21:26:25] [INFO ] Deduced a trap composed of 28 places in 869 ms of which 9 ms to minimize.
[2024-05-26 21:26:25] [INFO ] Deduced a trap composed of 48 places in 868 ms of which 9 ms to minimize.
[2024-05-26 21:26:26] [INFO ] Deduced a trap composed of 35 places in 987 ms of which 9 ms to minimize.
[2024-05-26 21:26:28] [INFO ] Deduced a trap composed of 82 places in 1030 ms of which 9 ms to minimize.
[2024-05-26 21:26:29] [INFO ] Deduced a trap composed of 61 places in 1050 ms of which 14 ms to minimize.
[2024-05-26 21:26:30] [INFO ] Deduced a trap composed of 160 places in 1095 ms of which 9 ms to minimize.
[2024-05-26 21:26:31] [INFO ] Deduced a trap composed of 55 places in 1020 ms of which 9 ms to minimize.
[2024-05-26 21:26:32] [INFO ] Deduced a trap composed of 73 places in 1147 ms of which 14 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 21:26:35] [INFO ] Deduced a trap composed of 50 places in 1297 ms of which 13 ms to minimize.
[2024-05-26 21:26:36] [INFO ] Deduced a trap composed of 33 places in 1306 ms of which 14 ms to minimize.
[2024-05-26 21:26:37] [INFO ] Deduced a trap composed of 33 places in 1305 ms of which 13 ms to minimize.
[2024-05-26 21:26:39] [INFO ] Deduced a trap composed of 62 places in 1194 ms of which 13 ms to minimize.
[2024-05-26 21:26:40] [INFO ] Deduced a trap composed of 28 places in 1094 ms of which 14 ms to minimize.
SMT process timed out in 62316ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72208 ms. Remains : 1096/1096 places, 2208/2208 transitions.
RANDOM walk for 40000 steps (8 resets) in 2923 ms. (13 steps per ms) remains 4/4 properties
[2024-05-26 21:26:41] [INFO ] Flatten gal took : 664 ms
BEST_FIRST walk for 40004 steps (8 resets) in 825 ms. (48 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
[2024-05-26 21:26:41] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:26:41] [INFO ] Invariant cache hit.
[2024-05-26 21:26:41] [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
[2024-05-26 21:26:41] [INFO ] Flatten gal took : 471 ms
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 21:26:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14895071328894788859.gal : 156 ms
[2024-05-26 21:26:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6409505886558411755.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14895071328894788859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6409505886558411755.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6409505886558411755.prop.
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 2046 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
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 24
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 30
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
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 48
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :48 after 132
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :132 after 367
[2024-05-26 21:26:46] [INFO ] Deduced a trap composed of 27 places in 822 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :367 after 766
[2024-05-26 21:26:46] [INFO ] Deduced a trap composed of 33 places in 817 ms of which 9 ms to minimize.
[2024-05-26 21:26:47] [INFO ] Deduced a trap composed of 35 places in 717 ms of which 9 ms to minimize.
[2024-05-26 21:26:48] [INFO ] Deduced a trap composed of 15 places in 814 ms of which 9 ms to minimize.
SMT process timed out in 7226ms, 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 127 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 128 ms. Remains : 592/1096 places, 1704/2208 transitions.
RANDOM walk for 40000 steps (8 resets) in 840 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :766 after 3375
Interrupted probabilistic random walk after 261612 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 261612 steps, saw 48405 distinct states, run finished after 3006 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-26 21:26:52] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2024-05-26 21:26:52] [INFO ] Computed 23 invariants in 5 ms
[2024-05-26 21:26: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 1137 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 21:26:54] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 5 ms to minimize.
[2024-05-26 21:26:55] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 5 ms to minimize.
[2024-05-26 21:26:55] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 5 ms to minimize.
[2024-05-26 21:26:56] [INFO ] Deduced a trap composed of 66 places in 448 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3375 after 11187
[2024-05-26 21:26:56] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 5 ms to minimize.
[2024-05-26 21:26:57] [INFO ] Deduced a trap composed of 47 places in 438 ms of which 5 ms to minimize.
[2024-05-26 21:26:57] [INFO ] Deduced a trap composed of 23 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:26:58] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 5 ms to minimize.
[2024-05-26 21:26:58] [INFO ] Deduced a trap composed of 22 places in 444 ms of which 5 ms to minimize.
[2024-05-26 21:26:59] [INFO ] Deduced a trap composed of 90 places in 461 ms of which 5 ms to minimize.
[2024-05-26 21:26:59] [INFO ] Deduced a trap composed of 22 places in 433 ms of which 5 ms to minimize.
[2024-05-26 21:26:59] [INFO ] Deduced a trap composed of 72 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:27:00] [INFO ] Deduced a trap composed of 50 places in 440 ms of which 5 ms to minimize.
[2024-05-26 21:27:00] [INFO ] Deduced a trap composed of 108 places in 440 ms of which 5 ms to minimize.
[2024-05-26 21:27:01] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:27:01] [INFO ] Deduced a trap composed of 64 places in 430 ms of which 4 ms to minimize.
[2024-05-26 21:27:02] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 5 ms to minimize.
[2024-05-26 21:27:03] [INFO ] Deduced a trap composed of 36 places in 752 ms of which 17 ms to minimize.
[2024-05-26 21:27:03] [INFO ] Deduced a trap composed of 86 places in 538 ms of which 6 ms to minimize.
[2024-05-26 21:27:04] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11187 after 17836
[2024-05-26 21:27:04] [INFO ] Deduced a trap composed of 21 places in 440 ms of which 5 ms to minimize.
[2024-05-26 21:27:05] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 5 ms to minimize.
[2024-05-26 21:27:05] [INFO ] Deduced a trap composed of 46 places in 439 ms of which 5 ms to minimize.
[2024-05-26 21:27:06] [INFO ] Deduced a trap composed of 44 places in 432 ms of which 5 ms to minimize.
[2024-05-26 21:27:06] [INFO ] Deduced a trap composed of 83 places in 439 ms of which 5 ms to minimize.
[2024-05-26 21:27:07] [INFO ] Deduced a trap composed of 66 places in 430 ms of which 5 ms to minimize.
[2024-05-26 21:27:07] [INFO ] Deduced a trap composed of 65 places in 427 ms of which 5 ms to minimize.
[2024-05-26 21:27:07] [INFO ] Deduced a trap composed of 89 places in 432 ms of which 6 ms to minimize.
[2024-05-26 21:27:08] [INFO ] Deduced a trap composed of 83 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:27:08] [INFO ] Deduced a trap composed of 40 places in 427 ms of which 5 ms to minimize.
[2024-05-26 21:27:09] [INFO ] Deduced a trap composed of 47 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:27:09] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 5 ms to minimize.
[2024-05-26 21:27:10] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 5 ms to minimize.
[2024-05-26 21:27:10] [INFO ] Deduced a trap composed of 57 places in 440 ms of which 5 ms to minimize.
[2024-05-26 21:27:11] [INFO ] Deduced a trap composed of 69 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:27:11] [INFO ] Deduced a trap composed of 45 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:27:12] [INFO ] Deduced a trap composed of 82 places in 442 ms of which 5 ms to minimize.
[2024-05-26 21:27:12] [INFO ] Deduced a trap composed of 15 places in 447 ms of which 5 ms to minimize.
[2024-05-26 21:27:13] [INFO ] Deduced a trap composed of 12 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:27:13] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 5 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 21:27:14] [INFO ] Deduced a trap composed of 48 places in 436 ms of which 4 ms to minimize.
[2024-05-26 21:27:14] [INFO ] Deduced a trap composed of 62 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:27:15] [INFO ] Deduced a trap composed of 51 places in 434 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :17836 after 100663
[2024-05-26 21:27:15] [INFO ] Deduced a trap composed of 56 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:27:16] [INFO ] Deduced a trap composed of 50 places in 431 ms of which 5 ms to minimize.
[2024-05-26 21:27:16] [INFO ] Deduced a trap composed of 56 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:27:17] [INFO ] Deduced a trap composed of 75 places in 462 ms of which 5 ms to minimize.
[2024-05-26 21:27:17] [INFO ] Deduced a trap composed of 96 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:27:17] [INFO ] Deduced a trap composed of 94 places in 438 ms of which 5 ms to minimize.
[2024-05-26 21:27:18] [INFO ] Deduced a trap composed of 42 places in 443 ms of which 5 ms to minimize.
[2024-05-26 21:27:18] [INFO ] Deduced a trap composed of 68 places in 439 ms of which 5 ms to minimize.
[2024-05-26 21:27:19] [INFO ] Deduced a trap composed of 55 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:27:19] [INFO ] Deduced a trap composed of 43 places in 436 ms of which 6 ms to minimize.
[2024-05-26 21:27:20] [INFO ] Deduced a trap composed of 47 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:27:20] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:27:21] [INFO ] Deduced a trap composed of 69 places in 435 ms of which 4 ms to minimize.
[2024-05-26 21:27:21] [INFO ] Deduced a trap composed of 72 places in 444 ms of which 5 ms to minimize.
[2024-05-26 21:27:22] [INFO ] Deduced a trap composed of 49 places in 429 ms of which 5 ms to minimize.
[2024-05-26 21:27:22] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:27:23] [INFO ] Deduced a trap composed of 60 places in 437 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 21:27:23] [INFO ] Deduced a trap composed of 80 places in 403 ms of which 5 ms to minimize.
[2024-05-26 21:27:24] [INFO ] Deduced a trap composed of 57 places in 402 ms of which 5 ms to minimize.
[2024-05-26 21:27:24] [INFO ] Deduced a trap composed of 50 places in 382 ms of which 5 ms to minimize.
[2024-05-26 21:27:25] [INFO ] Deduced a trap composed of 44 places in 399 ms of which 5 ms to minimize.
[2024-05-26 21:27:25] [INFO ] Deduced a trap composed of 61 places in 431 ms of which 5 ms to minimize.
[2024-05-26 21:27:26] [INFO ] Deduced a trap composed of 83 places in 439 ms of which 5 ms to minimize.
[2024-05-26 21:27:26] [INFO ] Deduced a trap composed of 39 places in 429 ms of which 5 ms to minimize.
Problem MAX1 is UNSAT
[2024-05-26 21:27:27] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 5 ms to minimize.
[2024-05-26 21:27:27] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 5 ms to minimize.
[2024-05-26 21:27:28] [INFO ] Deduced a trap composed of 48 places in 401 ms of which 5 ms to minimize.
[2024-05-26 21:27:28] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 5 ms to minimize.
[2024-05-26 21:27:28] [INFO ] Deduced a trap composed of 28 places in 386 ms of which 5 ms to minimize.
[2024-05-26 21:27:29] [INFO ] Deduced a trap composed of 66 places in 401 ms of which 5 ms to minimize.
[2024-05-26 21:27:29] [INFO ] Deduced a trap composed of 54 places in 403 ms of which 5 ms to minimize.
[2024-05-26 21:27:30] [INFO ] Deduced a trap composed of 39 places in 428 ms of which 5 ms to minimize.
[2024-05-26 21:27:30] [INFO ] Deduced a trap composed of 56 places in 402 ms of which 5 ms to minimize.
[2024-05-26 21:27:31] [INFO ] Deduced a trap composed of 41 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:27:31] [INFO ] Deduced a trap composed of 24 places in 422 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 21:27:32] [INFO ] Deduced a trap composed of 40 places in 392 ms of which 4 ms to minimize.
[2024-05-26 21:27:32] [INFO ] Flatten gal took : 115 ms
[2024-05-26 21:27:32] [INFO ] Applying decomposition
[2024-05-26 21:27:32] [INFO ] Flatten gal took : 91 ms
[2024-05-26 21:27:32] [INFO ] Deduced a trap composed of 15 places in 559 ms of which 13 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5197218979369433297.txt' '-o' '/tmp/graph5197218979369433297.bin' '-w' '/tmp/graph5197218979369433297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5197218979369433297.bin' '-l' '-1' '-v' '-w' '/tmp/graph5197218979369433297.weights' '-q' '0' '-e' '0.001'
[2024-05-26 21:27:32] [INFO ] Decomposing Gal with order
Problem MAX1 is UNSAT
[2024-05-26 21:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 21:27:33] [INFO ] Deduced a trap composed of 95 places in 365 ms of which 5 ms to minimize.
[2024-05-26 21:27:33] [INFO ] Removed a total of 3183 redundant transitions.
[2024-05-26 21:27:33] [INFO ] Flatten gal took : 298 ms
[2024-05-26 21:27:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 60 ms.
[2024-05-26 21:27:33] [INFO ] Deduced a trap composed of 76 places in 370 ms of which 4 ms to minimize.
[2024-05-26 21:27:34] [INFO ] Deduced a trap composed of 20 places in 378 ms of which 5 ms to minimize.
[2024-05-26 21:27:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7618808542756826458.gal : 55 ms
[2024-05-26 21:27:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1552645745054238356.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7618808542756826458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1552645745054238356.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2024-05-26 21:27:34] [INFO ] Deduced a trap composed of 48 places in 343 ms of which 5 ms to minimize.
Loading property file /tmp/ReachabilityCardinality1552645745054238356.prop.
[2024-05-26 21:27:35] [INFO ] Deduced a trap composed of 68 places in 346 ms of which 4 ms to minimize.
[2024-05-26 21:27:35] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 4 ms to minimize.
[2024-05-26 21:27:35] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 5 ms to minimize.
[2024-05-26 21:27:36] [INFO ] Deduced a trap composed of 27 places in 402 ms of which 5 ms to minimize.
[2024-05-26 21:27:36] [INFO ] Deduced a trap composed of 92 places in 433 ms of which 5 ms to minimize.
[2024-05-26 21:27:37] [INFO ] Deduced a trap composed of 101 places in 430 ms of which 6 ms to minimize.
[2024-05-26 21:27:37] [INFO ] Deduced a trap composed of 38 places in 389 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 44
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :44 after 48
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :48 after 66
[2024-05-26 21:27:38] [INFO ] Deduced a trap composed of 24 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:27:38] [INFO ] Deduced a trap composed of 62 places in 396 ms of which 4 ms to minimize.
SMT process timed out in 46300ms, 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 33 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 33 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :66 after 489
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :489 after 853
Interrupted probabilistic random walk after 394884 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 394884 steps, saw 63032 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-26 21:27:41] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:27:41] [INFO ] Invariant cache hit.
[2024-05-26 21:27:41] [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 726 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 21:27:42] [INFO ] Deduced a trap composed of 89 places in 86 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
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :853 after 5176
[2024-05-26 21:27:43] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 4 ms to minimize.
[2024-05-26 21:27:44] [INFO ] Deduced a trap composed of 11 places in 413 ms of which 4 ms to minimize.
[2024-05-26 21:27:44] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 5 ms to minimize.
[2024-05-26 21:27:45] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 5 ms to minimize.
[2024-05-26 21:27:45] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 4 ms to minimize.
[2024-05-26 21:27:45] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 5 ms to minimize.
[2024-05-26 21:27:46] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 4 ms to minimize.
[2024-05-26 21:27:46] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 5 ms to minimize.
[2024-05-26 21:27:47] [INFO ] Deduced a trap composed of 66 places in 411 ms of which 4 ms to minimize.
[2024-05-26 21:27:47] [INFO ] Deduced a trap composed of 48 places in 407 ms of which 6 ms to minimize.
[2024-05-26 21:27:48] [INFO ] Deduced a trap composed of 48 places in 409 ms of which 5 ms to minimize.
[2024-05-26 21:27:48] [INFO ] Deduced a trap composed of 19 places in 405 ms of which 5 ms to minimize.
[2024-05-26 21:27:49] [INFO ] Deduced a trap composed of 73 places in 404 ms of which 5 ms to minimize.
[2024-05-26 21:27:49] [INFO ] Deduced a trap composed of 48 places in 373 ms of which 4 ms to minimize.
[2024-05-26 21:27:49] [INFO ] Deduced a trap composed of 48 places in 362 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5176 after 11514
[2024-05-26 21:27:50] [INFO ] Deduced a trap composed of 65 places in 333 ms of which 5 ms to minimize.
[2024-05-26 21:27:50] [INFO ] Deduced a trap composed of 50 places in 398 ms of which 5 ms to minimize.
[2024-05-26 21:27:51] [INFO ] Deduced a trap composed of 50 places in 414 ms of which 4 ms to minimize.
[2024-05-26 21:27:51] [INFO ] Deduced a trap composed of 57 places in 414 ms of which 5 ms to minimize.
[2024-05-26 21:27:52] [INFO ] Deduced a trap composed of 86 places in 416 ms of which 5 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 21:27:52] [INFO ] Deduced a trap composed of 50 places in 413 ms of which 5 ms to minimize.
[2024-05-26 21:27:53] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 5 ms to minimize.
[2024-05-26 21:27:53] [INFO ] Deduced a trap composed of 78 places in 422 ms of which 4 ms to minimize.
[2024-05-26 21:27:54] [INFO ] Deduced a trap composed of 50 places in 433 ms of which 5 ms to minimize.
[2024-05-26 21:27:54] [INFO ] Deduced a trap composed of 90 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:27:55] [INFO ] Deduced a trap composed of 11 places in 444 ms of which 5 ms to minimize.
[2024-05-26 21:27:55] [INFO ] Deduced a trap composed of 113 places in 411 ms of which 5 ms to minimize.
[2024-05-26 21:27:55] [INFO ] Deduced a trap composed of 73 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:27:56] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 5 ms to minimize.
[2024-05-26 21:27:56] [INFO ] Deduced a trap composed of 35 places in 415 ms of which 5 ms to minimize.
[2024-05-26 21:27:57] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :11514 after 17238
[2024-05-26 21:27:57] [INFO ] Deduced a trap composed of 106 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:27:58] [INFO ] Deduced a trap composed of 77 places in 419 ms of which 5 ms to minimize.
[2024-05-26 21:27:58] [INFO ] Deduced a trap composed of 80 places in 418 ms of which 5 ms to minimize.
[2024-05-26 21:27:59] [INFO ] Deduced a trap composed of 83 places in 418 ms of which 5 ms to minimize.
[2024-05-26 21:27:59] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 5 ms to minimize.
[2024-05-26 21:28:00] [INFO ] Deduced a trap composed of 66 places in 419 ms of which 4 ms to minimize.
[2024-05-26 21:28:00] [INFO ] Deduced a trap composed of 91 places in 426 ms of which 5 ms to minimize.
[2024-05-26 21:28:00] [INFO ] Deduced a trap composed of 83 places in 373 ms of which 5 ms to minimize.
[2024-05-26 21:28:01] [INFO ] Deduced a trap composed of 92 places in 407 ms of which 5 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 21:28:01] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 4 ms to minimize.
[2024-05-26 21:28:02] [INFO ] Deduced a trap composed of 81 places in 412 ms of which 4 ms to minimize.
[2024-05-26 21:28:02] [INFO ] Deduced a trap composed of 32 places in 411 ms of which 4 ms to minimize.
[2024-05-26 21:28:03] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 5 ms to minimize.
[2024-05-26 21:28:03] [INFO ] Deduced a trap composed of 20 places in 427 ms of which 5 ms to minimize.
[2024-05-26 21:28:04] [INFO ] Deduced a trap composed of 40 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:28:04] [INFO ] Deduced a trap composed of 90 places in 417 ms of which 5 ms to minimize.
[2024-05-26 21:28:05] [INFO ] Deduced a trap composed of 98 places in 416 ms of which 5 ms to minimize.
[2024-05-26 21:28:05] [INFO ] Deduced a trap composed of 108 places in 429 ms of which 5 ms to minimize.
[2024-05-26 21:28:06] [INFO ] Deduced a trap composed of 68 places in 423 ms of which 4 ms to minimize.
[2024-05-26 21:28:06] [INFO ] Deduced a trap composed of 20 places in 424 ms of which 5 ms to minimize.
[2024-05-26 21:28:07] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 5 ms to minimize.
[2024-05-26 21:28:07] [INFO ] Deduced a trap composed of 29 places in 406 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :17238 after 98958
[2024-05-26 21:28:08] [INFO ] Deduced a trap composed of 65 places in 443 ms of which 4 ms to minimize.
[2024-05-26 21:28:08] [INFO ] Deduced a trap composed of 87 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:28:09] [INFO ] Deduced a trap composed of 11 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:28:09] [INFO ] Deduced a trap composed of 41 places in 414 ms of which 5 ms to minimize.
[2024-05-26 21:28:10] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 5 ms to minimize.
[2024-05-26 21:28:10] [INFO ] Deduced a trap composed of 99 places in 418 ms of which 5 ms to minimize.
[2024-05-26 21:28:11] [INFO ] Deduced a trap composed of 56 places in 401 ms of which 5 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 21:28:11] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:28:12] [INFO ] Deduced a trap composed of 115 places in 383 ms of which 5 ms to minimize.
[2024-05-26 21:28:12] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 5 ms to minimize.
[2024-05-26 21:28:13] [INFO ] Deduced a trap composed of 58 places in 392 ms of which 5 ms to minimize.
[2024-05-26 21:28:13] [INFO ] Deduced a trap composed of 51 places in 417 ms of which 4 ms to minimize.
[2024-05-26 21:28:14] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 4 ms to minimize.
[2024-05-26 21:28:14] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 4 ms to minimize.
[2024-05-26 21:28:15] [INFO ] Deduced a trap composed of 50 places in 429 ms of which 5 ms to minimize.
[2024-05-26 21:28:16] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:28:17] [INFO ] Deduced a trap composed of 30 places in 304 ms of which 4 ms to minimize.
[2024-05-26 21:28:17] [INFO ] Deduced a trap composed of 57 places in 397 ms of which 5 ms to minimize.
[2024-05-26 21:28:17] [INFO ] Deduced a trap composed of 44 places in 388 ms of which 5 ms to minimize.
[2024-05-26 21:28:18] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 4 ms to minimize.
[2024-05-26 21:28:18] [INFO ] Deduced a trap composed of 49 places in 382 ms of which 5 ms to minimize.
[2024-05-26 21:28:19] [INFO ] Deduced a trap composed of 50 places in 394 ms of which 5 ms to minimize.
[2024-05-26 21:28:19] [INFO ] Deduced a trap composed of 73 places in 398 ms of which 5 ms to minimize.
[2024-05-26 21:28:20] [INFO ] Deduced a trap composed of 43 places in 391 ms of which 4 ms to minimize.
[2024-05-26 21:28:20] [INFO ] Deduced a trap composed of 50 places in 382 ms of which 4 ms to minimize.
[2024-05-26 21:28:21] [INFO ] Deduced a trap composed of 78 places in 389 ms of which 4 ms to minimize.
[2024-05-26 21:28:21] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 4 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 21:28:22] [INFO ] Deduced a trap composed of 32 places in 376 ms of which 4 ms to minimize.
[2024-05-26 21:28:22] [INFO ] Deduced a trap composed of 38 places in 428 ms of which 5 ms to minimize.
[2024-05-26 21:28:23] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 4 ms to minimize.
[2024-05-26 21:28:23] [INFO ] Deduced a trap composed of 61 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:28:24] [INFO ] Deduced a trap composed of 40 places in 411 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 21:28:24] [INFO ] Deduced a trap composed of 57 places in 408 ms of which 5 ms to minimize.
[2024-05-26 21:28:25] [INFO ] Deduced a trap composed of 40 places in 398 ms of which 5 ms to minimize.
[2024-05-26 21:28:25] [INFO ] Deduced a trap composed of 57 places in 403 ms of which 4 ms to minimize.
[2024-05-26 21:28:26] [INFO ] Deduced a trap composed of 57 places in 549 ms of which 7 ms to minimize.
[2024-05-26 21:28:26] [INFO ] Deduced a trap composed of 41 places in 552 ms of which 7 ms to minimize.
[2024-05-26 21:28:27] [INFO ] Deduced a trap composed of 69 places in 550 ms of which 8 ms to minimize.
[2024-05-26 21:28:27] [INFO ] Deduced a trap composed of 41 places in 544 ms of which 8 ms to minimize.
[2024-05-26 21:28:28] [INFO ] Deduced a trap composed of 25 places in 538 ms of which 8 ms to minimize.
[2024-05-26 21:28:29] [INFO ] Deduced a trap composed of 59 places in 549 ms of which 7 ms to minimize.
[2024-05-26 21:28:29] [INFO ] Deduced a trap composed of 35 places in 542 ms of which 7 ms to minimize.
[2024-05-26 21:28:30] [INFO ] Deduced a trap composed of 83 places in 549 ms of which 7 ms to minimize.
[2024-05-26 21:28:30] [INFO ] Deduced a trap composed of 62 places in 588 ms of which 5 ms to minimize.
[2024-05-26 21:28:31] [INFO ] Deduced a trap composed of 96 places in 479 ms of which 5 ms to minimize.
[2024-05-26 21:28:32] [INFO ] Deduced a trap composed of 104 places in 619 ms of which 8 ms to minimize.
[2024-05-26 21:28:33] [INFO ] Deduced a trap composed of 71 places in 651 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 21:28:33] [INFO ] Deduced a trap composed of 17 places in 626 ms of which 8 ms to minimize.
[2024-05-26 21:28:34] [INFO ] Deduced a trap composed of 68 places in 627 ms of which 7 ms to minimize.
[2024-05-26 21:28:35] [INFO ] Deduced a trap composed of 56 places in 606 ms of which 8 ms to minimize.
[2024-05-26 21:28:35] [INFO ] Deduced a trap composed of 77 places in 619 ms of which 7 ms to minimize.
[2024-05-26 21:28:36] [INFO ] Deduced a trap composed of 103 places in 605 ms of which 7 ms to minimize.
[2024-05-26 21:28:37] [INFO ] Deduced a trap composed of 60 places in 602 ms of which 7 ms to minimize.
[2024-05-26 21:28:37] [INFO ] Deduced a trap composed of 38 places in 641 ms of which 7 ms to minimize.
[2024-05-26 21:28:39] [INFO ] Deduced a trap composed of 102 places in 557 ms of which 4 ms to minimize.
[2024-05-26 21:28:39] [INFO ] Deduced a trap composed of 101 places in 382 ms of which 5 ms to minimize.
[2024-05-26 21:28:40] [INFO ] Deduced a trap composed of 53 places in 603 ms of which 7 ms to minimize.
[2024-05-26 21:28:40] [INFO ] Deduced a trap composed of 53 places in 576 ms of which 8 ms to minimize.
[2024-05-26 21:28:41] [INFO ] Deduced a trap composed of 90 places in 672 ms of which 8 ms to minimize.
[2024-05-26 21:28:42] [INFO ] Deduced a trap composed of 62 places in 664 ms of which 8 ms to minimize.
[2024-05-26 21:28:43] [INFO ] Deduced a trap composed of 26 places in 660 ms of which 7 ms to minimize.
[2024-05-26 21:28:44] [INFO ] Deduced a trap composed of 26 places in 620 ms of which 7 ms to minimize.
[2024-05-26 21:28:45] [INFO ] Deduced a trap composed of 35 places in 599 ms of which 7 ms to minimize.
[2024-05-26 21:28:45] [INFO ] Deduced a trap composed of 76 places in 564 ms of which 7 ms to minimize.
[2024-05-26 21:28:46] [INFO ] Deduced a trap composed of 59 places in 633 ms of which 7 ms to minimize.
[2024-05-26 21:28:47] [INFO ] Deduced a trap composed of 73 places in 628 ms of which 7 ms to minimize.
[2024-05-26 21:28:47] [INFO ] Deduced a trap composed of 68 places in 589 ms of which 8 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 21:28:48] [INFO ] Deduced a trap composed of 38 places in 621 ms of which 7 ms to minimize.
[2024-05-26 21:28:49] [INFO ] Deduced a trap composed of 38 places in 638 ms of which 8 ms to minimize.
[2024-05-26 21:28:50] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 7 ms to minimize.
[2024-05-26 21:28:51] [INFO ] Deduced a trap composed of 29 places in 622 ms of which 7 ms to minimize.
[2024-05-26 21:28:52] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 5 ms to minimize.
[2024-05-26 21:28:54] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 7 ms to minimize.
[2024-05-26 21:28:55] [INFO ] Deduced a trap composed of 71 places in 573 ms of which 7 ms to minimize.
[2024-05-26 21:28:55] [INFO ] Deduced a trap composed of 77 places in 570 ms of which 6 ms to minimize.
[2024-05-26 21:28:56] [INFO ] Deduced a trap composed of 44 places in 583 ms of which 7 ms to minimize.
[2024-05-26 21:28:57] [INFO ] Deduced a trap composed of 43 places in 596 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75011 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: 131/131 constraints]
After SMT, in 75759ms 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 53 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 54 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 62 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-05-26 21:28:57] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:28:57] [INFO ] Invariant cache hit.
[2024-05-26 21:28:58] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-26 21:28:58] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:28:58] [INFO ] Invariant cache hit.
[2024-05-26 21:28:58] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:29:03] [INFO ] Implicit Places using invariants and state equation in 5671 ms returned []
Implicit Place search using SMT with State Equation took 6339 ms to find 0 implicit places.
[2024-05-26 21:29:04] [INFO ] Redundant transitions in 213 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-05-26 21:29:04] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:29:04] [INFO ] Invariant cache hit.
[2024-05-26 21:29:04] [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 30064 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 21:29:37] [INFO ] Deduced a trap composed of 79 places in 527 ms of which 8 ms to minimize.
[2024-05-26 21:29:38] [INFO ] Deduced a trap composed of 41 places in 732 ms of which 9 ms to minimize.
[2024-05-26 21:29:39] [INFO ] Deduced a trap composed of 42 places in 538 ms of which 8 ms to minimize.
[2024-05-26 21:29:39] [INFO ] Deduced a trap composed of 22 places in 500 ms of which 5 ms to minimize.
[2024-05-26 21:29:40] [INFO ] Deduced a trap composed of 65 places in 548 ms of which 8 ms to minimize.
[2024-05-26 21:29:40] [INFO ] Deduced a trap composed of 46 places in 501 ms of which 6 ms to minimize.
[2024-05-26 21:29:41] [INFO ] Deduced a trap composed of 67 places in 726 ms of which 8 ms to minimize.
[2024-05-26 21:29:41] [INFO ] Deduced a trap composed of 61 places in 604 ms of which 9 ms to minimize.
[2024-05-26 21:29:42] [INFO ] Deduced a trap composed of 16 places in 466 ms of which 5 ms to minimize.
[2024-05-26 21:29:42] [INFO ] Deduced a trap composed of 24 places in 498 ms of which 7 ms to minimize.
[2024-05-26 21:29:43] [INFO ] Deduced a trap composed of 35 places in 544 ms of which 7 ms to minimize.
[2024-05-26 21:29:43] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 4 ms to minimize.
[2024-05-26 21:29:44] [INFO ] Deduced a trap composed of 44 places in 636 ms of which 8 ms to minimize.
[2024-05-26 21:29:45] [INFO ] Deduced a trap composed of 56 places in 582 ms of which 7 ms to minimize.
[2024-05-26 21:29:45] [INFO ] Deduced a trap composed of 48 places in 574 ms of which 6 ms to minimize.
[2024-05-26 21:29:46] [INFO ] Deduced a trap composed of 50 places in 599 ms of which 7 ms to minimize.
[2024-05-26 21:29:47] [INFO ] Deduced a trap composed of 24 places in 603 ms of which 8 ms to minimize.
[2024-05-26 21:29:47] [INFO ] Deduced a trap composed of 87 places in 623 ms of which 7 ms to minimize.
[2024-05-26 21:29:48] [INFO ] Deduced a trap composed of 48 places in 582 ms of which 7 ms to minimize.
[2024-05-26 21:29:48] [INFO ] Deduced a trap composed of 41 places in 664 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 21:29:50] [INFO ] Deduced a trap composed of 58 places in 671 ms of which 8 ms to minimize.
[2024-05-26 21:29:50] [INFO ] Deduced a trap composed of 39 places in 667 ms of which 8 ms to minimize.
[2024-05-26 21:29:51] [INFO ] Deduced a trap composed of 22 places in 586 ms of which 7 ms to minimize.
[2024-05-26 21:29:52] [INFO ] Deduced a trap composed of 23 places in 611 ms of which 7 ms to minimize.
[2024-05-26 21:29:52] [INFO ] Deduced a trap composed of 13 places in 530 ms of which 6 ms to minimize.
[2024-05-26 21:29:53] [INFO ] Deduced a trap composed of 32 places in 546 ms of which 6 ms to minimize.
[2024-05-26 21:29:53] [INFO ] Deduced a trap composed of 22 places in 507 ms of which 5 ms to minimize.
[2024-05-26 21:29:54] [INFO ] Deduced a trap composed of 102 places in 479 ms of which 6 ms to minimize.
[2024-05-26 21:29:54] [INFO ] Deduced a trap composed of 41 places in 484 ms of which 8 ms to minimize.
[2024-05-26 21:29:55] [INFO ] Deduced a trap composed of 46 places in 606 ms of which 7 ms to minimize.
[2024-05-26 21:29:56] [INFO ] Deduced a trap composed of 41 places in 670 ms of which 8 ms to minimize.
[2024-05-26 21:29:56] [INFO ] Deduced a trap composed of 47 places in 632 ms of which 8 ms to minimize.
[2024-05-26 21:29:57] [INFO ] Deduced a trap composed of 46 places in 612 ms of which 7 ms to minimize.
[2024-05-26 21:29:57] [INFO ] Deduced a trap composed of 61 places in 609 ms of which 8 ms to minimize.
[2024-05-26 21:29:58] [INFO ] Deduced a trap composed of 78 places in 528 ms of which 6 ms to minimize.
[2024-05-26 21:29:59] [INFO ] Deduced a trap composed of 23 places in 503 ms of which 6 ms to minimize.
[2024-05-26 21:29:59] [INFO ] Deduced a trap composed of 26 places in 494 ms of which 6 ms to minimize.
[2024-05-26 21:29:59] [INFO ] Deduced a trap composed of 28 places in 328 ms of which 5 ms to minimize.
[2024-05-26 21:30:00] [INFO ] Deduced a trap composed of 14 places in 473 ms of which 5 ms to minimize.
[2024-05-26 21:30:00] [INFO ] Deduced a trap composed of 24 places in 572 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
[2024-05-26 21:30:02] [INFO ] Deduced a trap composed of 35 places in 493 ms of which 8 ms to minimize.
[2024-05-26 21:30:02] [INFO ] Deduced a trap composed of 44 places in 677 ms of which 8 ms to minimize.
[2024-05-26 21:30:03] [INFO ] Deduced a trap composed of 23 places in 555 ms of which 7 ms to minimize.
[2024-05-26 21:30:04] [INFO ] Deduced a trap composed of 27 places in 589 ms of which 8 ms to minimize.
[2024-05-26 21:30:04] [INFO ] Deduced a trap composed of 14 places in 495 ms of which 5 ms to minimize.
[2024-05-26 21:30:05] [INFO ] Deduced a trap composed of 14 places in 651 ms of which 7 ms to minimize.
SMT process timed out in 61211ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 61248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67882 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 21:30:05] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2024-05-26 21:30:05] [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 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-05-26 21:30:05] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-05-26 21:30:05] [INFO ] Invariant cache hit.
[2024-05-26 21:30:05] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2024-05-26 21:30:06] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2024-05-26 21:30:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:30:06] [INFO ] [Real]Added 497 Read/Feed constraints in 153 ms returned sat
[2024-05-26 21:30:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:30:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2024-05-26 21:30:08] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2024-05-26 21:30:08] [INFO ] [Nat]Added 497 Read/Feed constraints in 546 ms returned sat
[2024-05-26 21:30:09] [INFO ] Deduced a trap composed of 85 places in 1104 ms of which 8 ms to minimize.
[2024-05-26 21:30:10] [INFO ] Deduced a trap composed of 24 places in 1035 ms of which 12 ms to minimize.
[2024-05-26 21:30:12] [INFO ] Deduced a trap composed of 33 places in 1138 ms of which 8 ms to minimize.
[2024-05-26 21:30:12] [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 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 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 116 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 118 ms. Remains : 592/1096 places, 1704/2208 transitions.
[2024-05-26 21:30:12] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2024-05-26 21:30:12] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2580 ms. (387 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 985 ms. (1014 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-05-26 21:30:15] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:30:15] [INFO ] Invariant cache hit.
[2024-05-26 21:30:15] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2024-05-26 21:30:16] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2024-05-26 21:30:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:30:16] [INFO ] [Real]Added 497 Read/Feed constraints in 93 ms returned sat
[2024-05-26 21:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 21:30:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2024-05-26 21:30:17] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-26 21:30:17] [INFO ] [Nat]Added 497 Read/Feed constraints in 237 ms returned sat
[2024-05-26 21:30:18] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 8 ms to minimize.
[2024-05-26 21:30:18] [INFO ] Deduced a trap composed of 19 places in 627 ms of which 8 ms to minimize.
[2024-05-26 21:30:19] [INFO ] Deduced a trap composed of 82 places in 705 ms of which 8 ms to minimize.
[2024-05-26 21:30:20] [INFO ] Deduced a trap composed of 52 places in 686 ms of which 8 ms to minimize.
[2024-05-26 21:30:21] [INFO ] Deduced a trap composed of 67 places in 649 ms of which 8 ms to minimize.
[2024-05-26 21:30:21] [INFO ] Deduced a trap composed of 13 places in 670 ms of which 8 ms to minimize.
[2024-05-26 21:30:22] [INFO ] Deduced a trap composed of 32 places in 688 ms of which 8 ms to minimize.
[2024-05-26 21:30:23] [INFO ] Deduced a trap composed of 78 places in 665 ms of which 8 ms to minimize.
[2024-05-26 21:30:24] [INFO ] Deduced a trap composed of 62 places in 670 ms of which 7 ms to minimize.
[2024-05-26 21:30:24] [INFO ] Deduced a trap composed of 39 places in 627 ms of which 8 ms to minimize.
[2024-05-26 21:30:25] [INFO ] Deduced a trap composed of 37 places in 606 ms of which 7 ms to minimize.
[2024-05-26 21:30:26] [INFO ] Deduced a trap composed of 13 places in 620 ms of which 7 ms to minimize.
[2024-05-26 21:30:27] [INFO ] Deduced a trap composed of 22 places in 713 ms of which 8 ms to minimize.
[2024-05-26 21:30:27] [INFO ] Deduced a trap composed of 13 places in 662 ms of which 8 ms to minimize.
[2024-05-26 21:30:28] [INFO ] Deduced a trap composed of 125 places in 706 ms of which 8 ms to minimize.
[2024-05-26 21:30:29] [INFO ] Deduced a trap composed of 37 places in 668 ms of which 8 ms to minimize.
[2024-05-26 21:30:30] [INFO ] Deduced a trap composed of 30 places in 685 ms of which 8 ms to minimize.
[2024-05-26 21:30:30] [INFO ] Deduced a trap composed of 33 places in 651 ms of which 8 ms to minimize.
[2024-05-26 21:30:31] [INFO ] Deduced a trap composed of 43 places in 666 ms of which 8 ms to minimize.
[2024-05-26 21:30:32] [INFO ] Deduced a trap composed of 25 places in 700 ms of which 8 ms to minimize.
[2024-05-26 21:30:33] [INFO ] Deduced a trap composed of 22 places in 641 ms of which 8 ms to minimize.
[2024-05-26 21:30:33] [INFO ] Deduced a trap composed of 22 places in 675 ms of which 8 ms to minimize.
[2024-05-26 21:30:34] [INFO ] Deduced a trap composed of 74 places in 657 ms of which 8 ms to minimize.
[2024-05-26 21:30:35] [INFO ] Deduced a trap composed of 21 places in 665 ms of which 8 ms to minimize.
[2024-05-26 21:30:36] [INFO ] Deduced a trap composed of 80 places in 609 ms of which 7 ms to minimize.
[2024-05-26 21:30:37] [INFO ] Deduced a trap composed of 56 places in 610 ms of which 7 ms to minimize.
[2024-05-26 21:30:38] [INFO ] Deduced a trap composed of 76 places in 625 ms of which 7 ms to minimize.
[2024-05-26 21:30:38] [INFO ] Deduced a trap composed of 89 places in 651 ms of which 7 ms to minimize.
[2024-05-26 21:30:39] [INFO ] Deduced a trap composed of 31 places in 638 ms of which 8 ms to minimize.
[2024-05-26 21:30:40] [INFO ] Deduced a trap composed of 41 places in 655 ms of which 8 ms to minimize.
[2024-05-26 21:30:40] [INFO ] Deduced a trap composed of 32 places in 623 ms of which 7 ms to minimize.
[2024-05-26 21:30:41] [INFO ] Deduced a trap composed of 79 places in 692 ms of which 8 ms to minimize.
[2024-05-26 21:30:42] [INFO ] Deduced a trap composed of 15 places in 662 ms of which 8 ms to minimize.
[2024-05-26 21:30:43] [INFO ] Deduced a trap composed of 65 places in 683 ms of which 7 ms to minimize.
[2024-05-26 21:30:43] [INFO ] Deduced a trap composed of 23 places in 627 ms of which 8 ms to minimize.
[2024-05-26 21:30:44] [INFO ] Deduced a trap composed of 21 places in 656 ms of which 7 ms to minimize.
[2024-05-26 21:30:45] [INFO ] Deduced a trap composed of 22 places in 630 ms of which 8 ms to minimize.
[2024-05-26 21:30:46] [INFO ] Deduced a trap composed of 75 places in 571 ms of which 7 ms to minimize.
[2024-05-26 21:30:47] [INFO ] Deduced a trap composed of 34 places in 488 ms of which 6 ms to minimize.
[2024-05-26 21:30:48] [INFO ] Deduced a trap composed of 79 places in 392 ms of which 5 ms to minimize.
[2024-05-26 21:30:49] [INFO ] Deduced a trap composed of 77 places in 427 ms of which 7 ms to minimize.
[2024-05-26 21:30:49] [INFO ] Deduced a trap composed of 46 places in 638 ms of which 8 ms to minimize.
[2024-05-26 21:30:50] [INFO ] Deduced a trap composed of 41 places in 666 ms of which 8 ms to minimize.
[2024-05-26 21:30:52] [INFO ] Deduced a trap composed of 52 places in 421 ms of which 6 ms to minimize.
[2024-05-26 21:30:52] [INFO ] Deduced a trap composed of 49 places in 528 ms of which 7 ms to minimize.
[2024-05-26 21:30:53] [INFO ] Deduced a trap composed of 33 places in 628 ms of which 7 ms to minimize.
[2024-05-26 21:30:57] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 40374 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 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 46 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-05-26 21:30:58] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:30:58] [INFO ] Invariant cache hit.
[2024-05-26 21:30:58] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-26 21:30:58] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:30:58] [INFO ] Invariant cache hit.
[2024-05-26 21:30:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:31:04] [INFO ] Implicit Places using invariants and state equation in 5760 ms returned []
Implicit Place search using SMT with State Equation took 6578 ms to find 0 implicit places.
[2024-05-26 21:31:04] [INFO ] Redundant transitions in 89 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-05-26 21:31:04] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:31:04] [INFO ] Invariant cache hit.
[2024-05-26 21:31:04] [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 30048 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 21:31:38] [INFO ] Deduced a trap composed of 79 places in 523 ms of which 8 ms to minimize.
[2024-05-26 21:31:38] [INFO ] Deduced a trap composed of 41 places in 631 ms of which 8 ms to minimize.
[2024-05-26 21:31:39] [INFO ] Deduced a trap composed of 42 places in 701 ms of which 7 ms to minimize.
[2024-05-26 21:31:40] [INFO ] Deduced a trap composed of 22 places in 714 ms of which 9 ms to minimize.
[2024-05-26 21:31:41] [INFO ] Deduced a trap composed of 65 places in 701 ms of which 9 ms to minimize.
[2024-05-26 21:31:41] [INFO ] Deduced a trap composed of 46 places in 710 ms of which 8 ms to minimize.
[2024-05-26 21:31:42] [INFO ] Deduced a trap composed of 67 places in 737 ms of which 8 ms to minimize.
[2024-05-26 21:31:43] [INFO ] Deduced a trap composed of 61 places in 728 ms of which 8 ms to minimize.
[2024-05-26 21:31:43] [INFO ] Deduced a trap composed of 16 places in 667 ms of which 8 ms to minimize.
[2024-05-26 21:31:44] [INFO ] Deduced a trap composed of 24 places in 635 ms of which 7 ms to minimize.
[2024-05-26 21:31:45] [INFO ] Deduced a trap composed of 35 places in 635 ms of which 7 ms to minimize.
[2024-05-26 21:31:45] [INFO ] Deduced a trap composed of 23 places in 589 ms of which 8 ms to minimize.
[2024-05-26 21:31:46] [INFO ] Deduced a trap composed of 44 places in 676 ms of which 8 ms to minimize.
[2024-05-26 21:31:47] [INFO ] Deduced a trap composed of 56 places in 532 ms of which 7 ms to minimize.
[2024-05-26 21:31:47] [INFO ] Deduced a trap composed of 48 places in 605 ms of which 7 ms to minimize.
[2024-05-26 21:31:48] [INFO ] Deduced a trap composed of 50 places in 640 ms of which 8 ms to minimize.
[2024-05-26 21:31:49] [INFO ] Deduced a trap composed of 24 places in 677 ms of which 8 ms to minimize.
[2024-05-26 21:31:49] [INFO ] Deduced a trap composed of 87 places in 687 ms of which 8 ms to minimize.
[2024-05-26 21:31:50] [INFO ] Deduced a trap composed of 48 places in 736 ms of which 9 ms to minimize.
[2024-05-26 21:31:51] [INFO ] Deduced a trap composed of 41 places in 749 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 21:31:52] [INFO ] Deduced a trap composed of 58 places in 481 ms of which 9 ms to minimize.
[2024-05-26 21:31:53] [INFO ] Deduced a trap composed of 39 places in 544 ms of which 8 ms to minimize.
[2024-05-26 21:31:53] [INFO ] Deduced a trap composed of 22 places in 651 ms of which 8 ms to minimize.
[2024-05-26 21:31:54] [INFO ] Deduced a trap composed of 23 places in 735 ms of which 9 ms to minimize.
[2024-05-26 21:31:55] [INFO ] Deduced a trap composed of 13 places in 693 ms of which 8 ms to minimize.
[2024-05-26 21:31:56] [INFO ] Deduced a trap composed of 32 places in 685 ms of which 8 ms to minimize.
[2024-05-26 21:31:56] [INFO ] Deduced a trap composed of 22 places in 636 ms of which 7 ms to minimize.
[2024-05-26 21:31:57] [INFO ] Deduced a trap composed of 102 places in 618 ms of which 7 ms to minimize.
[2024-05-26 21:31:57] [INFO ] Deduced a trap composed of 41 places in 602 ms of which 7 ms to minimize.
[2024-05-26 21:31:58] [INFO ] Deduced a trap composed of 46 places in 659 ms of which 8 ms to minimize.
[2024-05-26 21:31:59] [INFO ] Deduced a trap composed of 41 places in 691 ms of which 8 ms to minimize.
[2024-05-26 21:31:59] [INFO ] Deduced a trap composed of 47 places in 627 ms of which 8 ms to minimize.
[2024-05-26 21:32:00] [INFO ] Deduced a trap composed of 46 places in 703 ms of which 8 ms to minimize.
[2024-05-26 21:32:01] [INFO ] Deduced a trap composed of 61 places in 698 ms of which 8 ms to minimize.
[2024-05-26 21:32:02] [INFO ] Deduced a trap composed of 78 places in 670 ms of which 8 ms to minimize.
[2024-05-26 21:32:02] [INFO ] Deduced a trap composed of 23 places in 631 ms of which 8 ms to minimize.
[2024-05-26 21:32:03] [INFO ] Deduced a trap composed of 26 places in 671 ms of which 8 ms to minimize.
[2024-05-26 21:32:04] [INFO ] Deduced a trap composed of 28 places in 629 ms of which 7 ms to minimize.
[2024-05-26 21:32:04] [INFO ] Deduced a trap composed of 14 places in 651 ms of which 8 ms to minimize.
[2024-05-26 21:32:05] [INFO ] Deduced a trap composed of 24 places in 637 ms of which 7 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 30051 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 61170ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 61207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67934 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 470 ms. (84 steps per ms) remains 2/2 properties
[2024-05-26 21:32:06] [INFO ] Flatten gal took : 220 ms
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
[2024-05-26 21:32:06] [INFO ] Flatten gal took : 149 ms
[2024-05-26 21:32:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16910942743658344837.gal : 34 ms
[2024-05-26 21:32:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3680322724435416314.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16910942743658344837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3680322724435416314.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3680322724435416314.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :32 after 77
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :77 after 184
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :184 after 382
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :382 after 506
Interrupted probabilistic random walk after 269298 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 269298 steps, saw 49242 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-26 21:32:09] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:32:09] [INFO ] Invariant cache hit.
[2024-05-26 21:32:09] [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 965 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 21:32:12] [INFO ] Deduced a trap composed of 53 places in 593 ms of which 9 ms to minimize.
[2024-05-26 21:32:13] [INFO ] Deduced a trap composed of 32 places in 632 ms of which 8 ms to minimize.
[2024-05-26 21:32:13] [INFO ] Deduced a trap composed of 64 places in 587 ms of which 7 ms to minimize.
[2024-05-26 21:32:14] [INFO ] Deduced a trap composed of 63 places in 598 ms of which 7 ms to minimize.
[2024-05-26 21:32:15] [INFO ] Deduced a trap composed of 25 places in 573 ms of which 4 ms to minimize.
[2024-05-26 21:32:15] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 5 ms to minimize.
SMT process timed out in 6109ms, 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 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 31 ms. Remains : 592/592 places, 1704/1704 transitions.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :506 after 3621
RANDOM walk for 40000 steps (8 resets) in 1258 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 283122 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 283122 steps, saw 50814 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-26 21:32:19] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:32:19] [INFO ] Invariant cache hit.
[2024-05-26 21:32:19] [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 957 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 21:32:21] [INFO ] Deduced a trap composed of 53 places in 369 ms of which 5 ms to minimize.
[2024-05-26 21:32:21] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 5 ms to minimize.
[2024-05-26 21:32:22] [INFO ] Deduced a trap composed of 64 places in 373 ms of which 5 ms to minimize.
[2024-05-26 21:32:22] [INFO ] Deduced a trap composed of 63 places in 380 ms of which 5 ms to minimize.
[2024-05-26 21:32:23] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3621 after 7265
[2024-05-26 21:32:23] [INFO ] Deduced a trap composed of 12 places in 376 ms of which 5 ms to minimize.
[2024-05-26 21:32:23] [INFO ] Deduced a trap composed of 61 places in 368 ms of which 5 ms to minimize.
[2024-05-26 21:32:24] [INFO ] Deduced a trap composed of 22 places in 373 ms of which 5 ms to minimize.
[2024-05-26 21:32:24] [INFO ] Deduced a trap composed of 65 places in 381 ms of which 5 ms to minimize.
[2024-05-26 21:32:25] [INFO ] Deduced a trap composed of 37 places in 485 ms of which 5 ms to minimize.
[2024-05-26 21:32:25] [INFO ] Deduced a trap composed of 81 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:32:26] [INFO ] Deduced a trap composed of 37 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:32:26] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 5 ms to minimize.
[2024-05-26 21:32:27] [INFO ] Deduced a trap composed of 40 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:32:27] [INFO ] Deduced a trap composed of 30 places in 429 ms of which 5 ms to minimize.
[2024-05-26 21:32:28] [INFO ] Deduced a trap composed of 51 places in 432 ms of which 5 ms to minimize.
[2024-05-26 21:32:28] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 5 ms to minimize.
[2024-05-26 21:32:29] [INFO ] Deduced a trap composed of 43 places in 433 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7265 after 9883
[2024-05-26 21:32:29] [INFO ] Deduced a trap composed of 12 places in 434 ms of which 5 ms to minimize.
[2024-05-26 21:32:30] [INFO ] Deduced a trap composed of 40 places in 439 ms of which 5 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 21:32:30] [INFO ] Deduced a trap composed of 98 places in 457 ms of which 24 ms to minimize.
[2024-05-26 21:32:31] [INFO ] Deduced a trap composed of 51 places in 437 ms of which 5 ms to minimize.
[2024-05-26 21:32:31] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:32:32] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:32:32] [INFO ] Deduced a trap composed of 59 places in 433 ms of which 5 ms to minimize.
[2024-05-26 21:32:32] [INFO ] Deduced a trap composed of 55 places in 433 ms of which 5 ms to minimize.
[2024-05-26 21:32:33] [INFO ] Deduced a trap composed of 60 places in 431 ms of which 5 ms to minimize.
[2024-05-26 21:32:33] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 5 ms to minimize.
[2024-05-26 21:32:34] [INFO ] Deduced a trap composed of 46 places in 434 ms of which 5 ms to minimize.
[2024-05-26 21:32:34] [INFO ] Deduced a trap composed of 68 places in 431 ms of which 5 ms to minimize.
[2024-05-26 21:32:35] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 5 ms to minimize.
[2024-05-26 21:32:35] [INFO ] Deduced a trap composed of 52 places in 433 ms of which 5 ms to minimize.
[2024-05-26 21:32:36] [INFO ] Deduced a trap composed of 23 places in 431 ms of which 5 ms to minimize.
[2024-05-26 21:32:36] [INFO ] Deduced a trap composed of 50 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:32:37] [INFO ] Deduced a trap composed of 52 places in 439 ms of which 5 ms to minimize.
[2024-05-26 21:32:37] [INFO ] Deduced a trap composed of 71 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:32:38] [INFO ] Deduced a trap composed of 51 places in 433 ms of which 5 ms to minimize.
[2024-05-26 21:32:38] [INFO ] Deduced a trap composed of 62 places in 430 ms of which 5 ms to minimize.
[2024-05-26 21:32:39] [INFO ] Deduced a trap composed of 46 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:32:39] [INFO ] Deduced a trap composed of 31 places in 433 ms of which 4 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 21:32:40] [INFO ] Deduced a trap composed of 50 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:32:40] [INFO ] Deduced a trap composed of 46 places in 439 ms of which 5 ms to minimize.
[2024-05-26 21:32:41] [INFO ] Deduced a trap composed of 34 places in 436 ms of which 5 ms to minimize.
[2024-05-26 21:32:41] [INFO ] Deduced a trap composed of 40 places in 438 ms of which 5 ms to minimize.
[2024-05-26 21:32:41] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 5 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-26 21:32:42] [INFO ] Deduced a trap composed of 71 places in 423 ms of which 5 ms to minimize.
[2024-05-26 21:32:42] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 5 ms to minimize.
[2024-05-26 21:32:43] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 5 ms to minimize.
[2024-05-26 21:32:43] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 5 ms to minimize.
[2024-05-26 21:32:44] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 5 ms to minimize.
[2024-05-26 21:32:44] [INFO ] Deduced a trap composed of 35 places in 421 ms of which 5 ms to minimize.
[2024-05-26 21:32:45] [INFO ] Deduced a trap composed of 55 places in 425 ms of which 5 ms to minimize.
[2024-05-26 21:32:45] [INFO ] Deduced a trap composed of 46 places in 426 ms of which 5 ms to minimize.
[2024-05-26 21:32:46] [INFO ] Deduced a trap composed of 57 places in 432 ms of which 5 ms to minimize.
[2024-05-26 21:32:46] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:32:47] [INFO ] Deduced a trap composed of 75 places in 434 ms of which 5 ms to minimize.
[2024-05-26 21:32:47] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 5 ms to minimize.
[2024-05-26 21:32:47] [INFO ] Deduced a trap composed of 22 places in 417 ms of which 5 ms to minimize.
[2024-05-26 21:32:48] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 5 ms to minimize.
[2024-05-26 21:32:48] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 5 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 21:32:49] [INFO ] Deduced a trap composed of 60 places in 408 ms of which 5 ms to minimize.
[2024-05-26 21:32:49] [INFO ] Deduced a trap composed of 87 places in 419 ms of which 4 ms to minimize.
[2024-05-26 21:32:50] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 4 ms to minimize.
[2024-05-26 21:32:50] [INFO ] Deduced a trap composed of 58 places in 446 ms of which 5 ms to minimize.
[2024-05-26 21:32:51] [INFO ] Deduced a trap composed of 46 places in 431 ms of which 5 ms to minimize.
[2024-05-26 21:32:51] [INFO ] Deduced a trap composed of 43 places in 424 ms of which 5 ms to minimize.
[2024-05-26 21:32:52] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 5 ms to minimize.
[2024-05-26 21:32:52] [INFO ] Deduced a trap composed of 58 places in 414 ms of which 5 ms to minimize.
[2024-05-26 21:32:53] [INFO ] Deduced a trap composed of 48 places in 417 ms of which 5 ms to minimize.
[2024-05-26 21:32:53] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 5 ms to minimize.
[2024-05-26 21:32:54] [INFO ] Deduced a trap composed of 15 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:32:54] [INFO ] Deduced a trap composed of 24 places in 412 ms of which 5 ms to minimize.
[2024-05-26 21:32:54] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:32:55] [INFO ] Deduced a trap composed of 51 places in 420 ms of which 5 ms to minimize.
[2024-05-26 21:32:55] [INFO ] Deduced a trap composed of 60 places in 419 ms of which 5 ms to minimize.
[2024-05-26 21:32:56] [INFO ] Deduced a trap composed of 96 places in 425 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 21:32:56] [INFO ] Flatten gal took : 61 ms
[2024-05-26 21:32:56] [INFO ] Applying decomposition
[2024-05-26 21:32:56] [INFO ] Flatten gal took : 64 ms
[2024-05-26 21:32:56] [INFO ] Deduced a trap composed of 73 places in 426 ms of which 5 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13213076564289777446.txt' '-o' '/tmp/graph13213076564289777446.bin' '-w' '/tmp/graph13213076564289777446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13213076564289777446.bin' '-l' '-1' '-v' '-w' '/tmp/graph13213076564289777446.weights' '-q' '0' '-e' '0.001'
[2024-05-26 21:32:56] [INFO ] Decomposing Gal with order
[2024-05-26 21:32:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 21:32:57] [INFO ] Removed a total of 2505 redundant transitions.
[2024-05-26 21:32:57] [INFO ] Flatten gal took : 161 ms
[2024-05-26 21:32:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2024-05-26 21:32:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8364078935371435762.gal : 23 ms
[2024-05-26 21:32:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality584940403356563653.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8364078935371435762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality584940403356563653.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
[2024-05-26 21:32:57] [INFO ] Deduced a trap composed of 96 places in 576 ms of which 7 ms to minimize.
Loading property file /tmp/ReachabilityCardinality584940403356563653.prop.
[2024-05-26 21:32:57] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 5 ms to minimize.
[2024-05-26 21:32:58] [INFO ] Deduced a trap composed of 125 places in 333 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :20 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 117
[2024-05-26 21:32:58] [INFO ] Deduced a trap composed of 144 places in 463 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :117 after 375
[2024-05-26 21:32:59] [INFO ] Deduced a trap composed of 48 places in 432 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :375 after 1467
[2024-05-26 21:32:59] [INFO ] Deduced a trap composed of 54 places in 434 ms of which 5 ms to minimize.
[2024-05-26 21:33:00] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 6 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1467 after 2623
[2024-05-26 21:33:00] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 5 ms to minimize.
[2024-05-26 21:33:01] [INFO ] Deduced a trap composed of 44 places in 369 ms of which 4 ms to minimize.
[2024-05-26 21:33:01] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 4 ms to minimize.
[2024-05-26 21:33:01] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 5 ms to minimize.
[2024-05-26 21:33:02] [INFO ] Deduced a trap composed of 37 places in 376 ms of which 4 ms to minimize.
[2024-05-26 21:33:02] [INFO ] Deduced a trap composed of 93 places in 359 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2623 after 8447
[2024-05-26 21:33:03] [INFO ] Deduced a trap composed of 83 places in 359 ms of which 5 ms to minimize.
[2024-05-26 21:33:03] [INFO ] Deduced a trap composed of 24 places in 349 ms of which 5 ms to minimize.
[2024-05-26 21:33:03] [INFO ] Deduced a trap composed of 56 places in 351 ms of which 4 ms to minimize.
[2024-05-26 21:33:04] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 5 ms to minimize.
[2024-05-26 21:33:04] [INFO ] Deduced a trap composed of 74 places in 316 ms of which 5 ms to minimize.
[2024-05-26 21:33:04] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 5 ms to minimize.
[2024-05-26 21:33:05] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 4 ms to minimize.
SMT process timed out in 46280ms, 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 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.
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8447 after 27482
Interrupted probabilistic random walk after 375039 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 375039 steps, saw 61434 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-26 21:33:08] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:33:08] [INFO ] Invariant cache hit.
[2024-05-26 21:33:08] [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 632 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 21:33:09] [INFO ] Deduced a trap composed of 89 places in 87 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 21:33:10] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 5 ms to minimize.
[2024-05-26 21:33:10] [INFO ] Deduced a trap composed of 11 places in 408 ms of which 5 ms to minimize.
[2024-05-26 21:33:11] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 5 ms to minimize.
[2024-05-26 21:33:11] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 5 ms to minimize.
[2024-05-26 21:33:12] [INFO ] Deduced a trap composed of 19 places in 378 ms of which 5 ms to minimize.
[2024-05-26 21:33:12] [INFO ] Deduced a trap composed of 20 places in 375 ms of which 5 ms to minimize.
[2024-05-26 21:33:13] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 5 ms to minimize.
[2024-05-26 21:33:13] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 5 ms to minimize.
[2024-05-26 21:33:13] [INFO ] Deduced a trap composed of 66 places in 357 ms of which 5 ms to minimize.
[2024-05-26 21:33:14] [INFO ] Deduced a trap composed of 48 places in 355 ms of which 5 ms to minimize.
[2024-05-26 21:33:14] [INFO ] Deduced a trap composed of 48 places in 360 ms of which 5 ms to minimize.
[2024-05-26 21:33:15] [INFO ] Deduced a trap composed of 19 places in 361 ms of which 5 ms to minimize.
[2024-05-26 21:33:15] [INFO ] Deduced a trap composed of 73 places in 409 ms of which 5 ms to minimize.
[2024-05-26 21:33:15] [INFO ] Deduced a trap composed of 48 places in 423 ms of which 4 ms to minimize.
[2024-05-26 21:33:16] [INFO ] Deduced a trap composed of 48 places in 424 ms of which 4 ms to minimize.
[2024-05-26 21:33:16] [INFO ] Deduced a trap composed of 65 places in 426 ms of which 4 ms to minimize.
[2024-05-26 21:33:17] [INFO ] Deduced a trap composed of 50 places in 422 ms of which 4 ms to minimize.
[2024-05-26 21:33:17] [INFO ] Deduced a trap composed of 50 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:33:18] [INFO ] Deduced a trap composed of 57 places in 402 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :27482 after 73989
[2024-05-26 21:33:18] [INFO ] Deduced a trap composed of 86 places in 407 ms of which 5 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 21:33:19] [INFO ] Deduced a trap composed of 50 places in 408 ms of which 4 ms to minimize.
[2024-05-26 21:33:19] [INFO ] Deduced a trap composed of 34 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:33:20] [INFO ] Deduced a trap composed of 78 places in 407 ms of which 4 ms to minimize.
[2024-05-26 21:33:20] [INFO ] Deduced a trap composed of 50 places in 403 ms of which 5 ms to minimize.
[2024-05-26 21:33:21] [INFO ] Deduced a trap composed of 90 places in 1023 ms of which 7 ms to minimize.
[2024-05-26 21:33:22] [INFO ] Deduced a trap composed of 11 places in 579 ms of which 5 ms to minimize.
[2024-05-26 21:33:22] [INFO ] Deduced a trap composed of 113 places in 403 ms of which 5 ms to minimize.
[2024-05-26 21:33:23] [INFO ] Deduced a trap composed of 73 places in 418 ms of which 5 ms to minimize.
[2024-05-26 21:33:23] [INFO ] Deduced a trap composed of 21 places in 408 ms of which 5 ms to minimize.
[2024-05-26 21:33:24] [INFO ] Deduced a trap composed of 35 places in 402 ms of which 5 ms to minimize.
[2024-05-26 21:33:24] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 5 ms to minimize.
[2024-05-26 21:33:24] [INFO ] Deduced a trap composed of 106 places in 411 ms of which 5 ms to minimize.
[2024-05-26 21:33:25] [INFO ] Deduced a trap composed of 77 places in 405 ms of which 5 ms to minimize.
[2024-05-26 21:33:25] [INFO ] Deduced a trap composed of 80 places in 415 ms of which 5 ms to minimize.
[2024-05-26 21:33:26] [INFO ] Deduced a trap composed of 83 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:33:26] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 5 ms to minimize.
[2024-05-26 21:33:27] [INFO ] Deduced a trap composed of 66 places in 406 ms of which 5 ms to minimize.
[2024-05-26 21:33:27] [INFO ] Deduced a trap composed of 91 places in 409 ms of which 5 ms to minimize.
[2024-05-26 21:33:28] [INFO ] Deduced a trap composed of 83 places in 401 ms of which 5 ms to minimize.
[2024-05-26 21:33:28] [INFO ] Deduced a trap composed of 92 places in 404 ms of which 5 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 21:33:29] [INFO ] Deduced a trap composed of 68 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:33:29] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 5 ms to minimize.
[2024-05-26 21:33:30] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 5 ms to minimize.
[2024-05-26 21:33:30] [INFO ] Deduced a trap composed of 19 places in 423 ms of which 7 ms to minimize.
[2024-05-26 21:33:31] [INFO ] Deduced a trap composed of 20 places in 424 ms of which 5 ms to minimize.
[2024-05-26 21:33:31] [INFO ] Deduced a trap composed of 40 places in 409 ms of which 5 ms to minimize.
[2024-05-26 21:33:32] [INFO ] Deduced a trap composed of 90 places in 408 ms of which 5 ms to minimize.
[2024-05-26 21:33:32] [INFO ] Deduced a trap composed of 98 places in 403 ms of which 5 ms to minimize.
[2024-05-26 21:33:33] [INFO ] Deduced a trap composed of 108 places in 439 ms of which 5 ms to minimize.
[2024-05-26 21:33:33] [INFO ] Deduced a trap composed of 68 places in 420 ms of which 5 ms to minimize.
[2024-05-26 21:33:34] [INFO ] Deduced a trap composed of 20 places in 420 ms of which 5 ms to minimize.
[2024-05-26 21:33:34] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:33:34] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 5 ms to minimize.
[2024-05-26 21:33:35] [INFO ] Deduced a trap composed of 65 places in 422 ms of which 5 ms to minimize.
[2024-05-26 21:33:36] [INFO ] Deduced a trap composed of 87 places in 425 ms of which 5 ms to minimize.
[2024-05-26 21:33:36] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:33:36] [INFO ] Deduced a trap composed of 41 places in 395 ms of which 5 ms to minimize.
[2024-05-26 21:33:37] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 5 ms to minimize.
[2024-05-26 21:33:37] [INFO ] Deduced a trap composed of 99 places in 413 ms of which 4 ms to minimize.
[2024-05-26 21:33:38] [INFO ] Deduced a trap composed of 56 places in 311 ms of which 4 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 21:33:39] [INFO ] Deduced a trap composed of 22 places in 416 ms of which 5 ms to minimize.
[2024-05-26 21:33:39] [INFO ] Deduced a trap composed of 115 places in 384 ms of which 4 ms to minimize.
[2024-05-26 21:33:39] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 5 ms to minimize.
[2024-05-26 21:33:40] [INFO ] Deduced a trap composed of 58 places in 381 ms of which 5 ms to minimize.
[2024-05-26 21:33:40] [INFO ] Deduced a trap composed of 51 places in 412 ms of which 5 ms to minimize.
[2024-05-26 21:33:41] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 5 ms to minimize.
[2024-05-26 21:33:41] [INFO ] Deduced a trap composed of 29 places in 364 ms of which 4 ms to minimize.
[2024-05-26 21:33:42] [INFO ] Deduced a trap composed of 50 places in 399 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :73989 after 210808
[2024-05-26 21:33:43] [INFO ] Deduced a trap composed of 22 places in 388 ms of which 5 ms to minimize.
[2024-05-26 21:33:44] [INFO ] Deduced a trap composed of 30 places in 382 ms of which 5 ms to minimize.
[2024-05-26 21:33:44] [INFO ] Deduced a trap composed of 57 places in 356 ms of which 4 ms to minimize.
[2024-05-26 21:33:45] [INFO ] Deduced a trap composed of 44 places in 357 ms of which 4 ms to minimize.
[2024-05-26 21:33:45] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 4 ms to minimize.
[2024-05-26 21:33:45] [INFO ] Deduced a trap composed of 49 places in 353 ms of which 5 ms to minimize.
[2024-05-26 21:33:46] [INFO ] Deduced a trap composed of 50 places in 369 ms of which 5 ms to minimize.
[2024-05-26 21:33:46] [INFO ] Deduced a trap composed of 73 places in 372 ms of which 4 ms to minimize.
[2024-05-26 21:33:47] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 21:33:47] [INFO ] Deduced a trap composed of 50 places in 356 ms of which 4 ms to minimize.
[2024-05-26 21:33:48] [INFO ] Deduced a trap composed of 78 places in 619 ms of which 7 ms to minimize.
[2024-05-26 21:33:49] [INFO ] Deduced a trap composed of 31 places in 517 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 21:33:50] [INFO ] Deduced a trap composed of 32 places in 667 ms of which 8 ms to minimize.
[2024-05-26 21:33:50] [INFO ] Deduced a trap composed of 38 places in 629 ms of which 6 ms to minimize.
[2024-05-26 21:33:51] [INFO ] Deduced a trap composed of 43 places in 592 ms of which 7 ms to minimize.
[2024-05-26 21:33:52] [INFO ] Deduced a trap composed of 61 places in 543 ms of which 8 ms to minimize.
[2024-05-26 21:33:52] [INFO ] Deduced a trap composed of 40 places in 642 ms of which 8 ms to minimize.
[2024-05-26 21:33:53] [INFO ] Deduced a trap composed of 57 places in 648 ms of which 8 ms to minimize.
[2024-05-26 21:33:54] [INFO ] Deduced a trap composed of 40 places in 660 ms of which 8 ms to minimize.
[2024-05-26 21:33:54] [INFO ] Deduced a trap composed of 57 places in 659 ms of which 8 ms to minimize.
[2024-05-26 21:33:55] [INFO ] Deduced a trap composed of 57 places in 646 ms of which 8 ms to minimize.
[2024-05-26 21:33:56] [INFO ] Deduced a trap composed of 41 places in 490 ms of which 7 ms to minimize.
[2024-05-26 21:33:56] [INFO ] Deduced a trap composed of 69 places in 525 ms of which 7 ms to minimize.
[2024-05-26 21:33:57] [INFO ] Deduced a trap composed of 41 places in 540 ms of which 6 ms to minimize.
[2024-05-26 21:33:57] [INFO ] Deduced a trap composed of 25 places in 540 ms of which 6 ms to minimize.
[2024-05-26 21:33:58] [INFO ] Deduced a trap composed of 59 places in 561 ms of which 7 ms to minimize.
[2024-05-26 21:33:59] [INFO ] Deduced a trap composed of 35 places in 557 ms of which 8 ms to minimize.
[2024-05-26 21:33:59] [INFO ] Deduced a trap composed of 83 places in 526 ms of which 7 ms to minimize.
[2024-05-26 21:34:00] [INFO ] Deduced a trap composed of 62 places in 525 ms of which 7 ms to minimize.
[2024-05-26 21:34:00] [INFO ] Deduced a trap composed of 96 places in 536 ms of which 8 ms to minimize.
[2024-05-26 21:34:01] [INFO ] Deduced a trap composed of 104 places in 550 ms of which 8 ms to minimize.
[2024-05-26 21:34:02] [INFO ] Deduced a trap composed of 71 places in 581 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 21:34:02] [INFO ] Deduced a trap composed of 17 places in 605 ms of which 8 ms to minimize.
[2024-05-26 21:34:03] [INFO ] Deduced a trap composed of 68 places in 632 ms of which 7 ms to minimize.
[2024-05-26 21:34:04] [INFO ] Deduced a trap composed of 56 places in 638 ms of which 7 ms to minimize.
[2024-05-26 21:34:05] [INFO ] Deduced a trap composed of 77 places in 603 ms of which 8 ms to minimize.
[2024-05-26 21:34:05] [INFO ] Deduced a trap composed of 103 places in 629 ms of which 8 ms to minimize.
[2024-05-26 21:34:06] [INFO ] Deduced a trap composed of 60 places in 623 ms of which 7 ms to minimize.
[2024-05-26 21:34:07] [INFO ] Deduced a trap composed of 38 places in 627 ms of which 8 ms to minimize.
[2024-05-26 21:34:08] [INFO ] Deduced a trap composed of 102 places in 453 ms of which 6 ms to minimize.
[2024-05-26 21:34:08] [INFO ] Deduced a trap composed of 101 places in 580 ms of which 7 ms to minimize.
[2024-05-26 21:34:09] [INFO ] Deduced a trap composed of 53 places in 596 ms of which 8 ms to minimize.
[2024-05-26 21:34:10] [INFO ] Deduced a trap composed of 53 places in 596 ms of which 8 ms to minimize.
[2024-05-26 21:34:10] [INFO ] Deduced a trap composed of 90 places in 582 ms of which 8 ms to minimize.
[2024-05-26 21:34:11] [INFO ] Deduced a trap composed of 62 places in 631 ms of which 8 ms to minimize.
[2024-05-26 21:34:12] [INFO ] Deduced a trap composed of 26 places in 611 ms of which 7 ms to minimize.
[2024-05-26 21:34:13] [INFO ] Deduced a trap composed of 26 places in 603 ms of which 7 ms to minimize.
[2024-05-26 21:34:13] [INFO ] Deduced a trap composed of 35 places in 481 ms of which 7 ms to minimize.
[2024-05-26 21:34:14] [INFO ] Deduced a trap composed of 76 places in 552 ms of which 7 ms to minimize.
[2024-05-26 21:34:15] [INFO ] Deduced a trap composed of 59 places in 571 ms of which 7 ms to minimize.
[2024-05-26 21:34:16] [INFO ] Deduced a trap composed of 73 places in 564 ms of which 6 ms to minimize.
[2024-05-26 21:34:16] [INFO ] Deduced a trap composed of 68 places in 537 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 21:34:17] [INFO ] Deduced a trap composed of 38 places in 554 ms of which 7 ms to minimize.
[2024-05-26 21:34:18] [INFO ] Deduced a trap composed of 38 places in 584 ms of which 7 ms to minimize.
[2024-05-26 21:34:19] [INFO ] Deduced a trap composed of 31 places in 558 ms of which 6 ms to minimize.
[2024-05-26 21:34:20] [INFO ] Deduced a trap composed of 29 places in 525 ms of which 7 ms to minimize.
[2024-05-26 21:34:21] [INFO ] Deduced a trap composed of 56 places in 542 ms of which 6 ms to minimize.
[2024-05-26 21:34:23] [INFO ] Deduced a trap composed of 14 places in 470 ms of which 8 ms to minimize.
[2024-05-26 21:34:23] [INFO ] Deduced a trap composed of 71 places in 531 ms of which 6 ms to minimize.
[2024-05-26 21:34:24] [INFO ] Deduced a trap composed of 77 places in 468 ms of which 6 ms to minimize.
SMT process timed out in 75828ms, After SMT, 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 47 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 47 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 51 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-05-26 21:34:24] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:34:24] [INFO ] Invariant cache hit.
[2024-05-26 21:34:25] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-26 21:34:25] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:34:25] [INFO ] Invariant cache hit.
[2024-05-26 21:34:26] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-26 21:34:31] [INFO ] Implicit Places using invariants and state equation in 5616 ms returned []
Implicit Place search using SMT with State Equation took 6695 ms to find 0 implicit places.
[2024-05-26 21:34:31] [INFO ] Redundant transitions in 34 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-05-26 21:34:31] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-05-26 21:34:31] [INFO ] Invariant cache hit.
[2024-05-26 21:34:31] [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
[2024-05-26 21:34:55] [INFO ] Deduced a trap composed of 79 places in 462 ms of which 5 ms to minimize.
[2024-05-26 21:34:55] [INFO ] Deduced a trap composed of 70 places in 451 ms of which 5 ms to minimize.
[2024-05-26 21:34:56] [INFO ] Deduced a trap composed of 58 places in 431 ms of which 5 ms to minimize.
[2024-05-26 21:34:56] [INFO ] Deduced a trap composed of 76 places in 449 ms of which 5 ms to minimize.
[2024-05-26 21:34:57] [INFO ] Deduced a trap composed of 50 places in 423 ms of which 5 ms to minimize.
[2024-05-26 21:34:57] [INFO ] Deduced a trap composed of 67 places in 630 ms of which 9 ms to minimize.
[2024-05-26 21:34:58] [INFO ] Deduced a trap composed of 45 places in 526 ms of which 5 ms to minimize.
[2024-05-26 21:34:59] [INFO ] Deduced a trap composed of 33 places in 594 ms of which 6 ms to minimize.
[2024-05-26 21:34:59] [INFO ] Deduced a trap composed of 34 places in 454 ms of which 5 ms to minimize.
[2024-05-26 21:35:00] [INFO ] Deduced a trap composed of 14 places in 460 ms of which 5 ms to minimize.
[2024-05-26 21:35:00] [INFO ] Deduced a trap composed of 29 places in 460 ms of which 5 ms to minimize.
[2024-05-26 21:35:00] [INFO ] Deduced a trap composed of 17 places in 435 ms of which 5 ms to minimize.
[2024-05-26 21:35:01] [INFO ] Deduced a trap composed of 49 places in 410 ms of which 5 ms to minimize.
[2024-05-26 21:35:01] [INFO ] Deduced a trap composed of 46 places in 416 ms of which 4 ms to minimize.
[2024-05-26 21:35:02] [INFO ] Deduced a trap composed of 43 places in 334 ms of which 5 ms to minimize.
SMT process timed out in 30994ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37807 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 296836 ms.
[2024-05-26 21:35:02] [INFO ] Flatten gal took : 102 ms
[2024-05-26 21:35:02] [INFO ] Applying decomposition
[2024-05-26 21:35:02] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15769369356757102137.txt' '-o' '/tmp/graph15769369356757102137.bin' '-w' '/tmp/graph15769369356757102137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15769369356757102137.bin' '-l' '-1' '-v' '-w' '/tmp/graph15769369356757102137.weights' '-q' '0' '-e' '0.001'
[2024-05-26 21:35:02] [INFO ] Decomposing Gal with order
[2024-05-26 21:35:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 21:35:02] [INFO ] Removed a total of 3174 redundant transitions.
[2024-05-26 21:35:03] [INFO ] Flatten gal took : 176 ms
[2024-05-26 21:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 99 ms.
[2024-05-26 21:35:03] [INFO ] Time to serialize gal into /tmp/UpperBounds1641087769014270494.gal : 32 ms
[2024-05-26 21:35:03] [INFO ] Time to serialize properties into /tmp/UpperBounds5425483133627119093.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1641087769014270494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5425483133627119093.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds5425483133627119093.prop.
ITS-tools command line returned an error code 137
[2024-05-26 21:46:06] [INFO ] Applying decomposition
[2024-05-26 21:46:06] [INFO ] Flatten gal took : 75 ms
[2024-05-26 21:46:06] [INFO ] Decomposing Gal with order
[2024-05-26 21:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 21:46:06] [INFO ] Removed a total of 3336 redundant transitions.
[2024-05-26 21:46:06] [INFO ] Flatten gal took : 141 ms
[2024-05-26 21:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-26 21:46:06] [INFO ] Time to serialize gal into /tmp/UpperBounds13752341734965428602.gal : 17 ms
[2024-05-26 21:46:06] [INFO ] Time to serialize properties into /tmp/UpperBounds13533699889249367826.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13752341734965428602.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13533699889249367826.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds13533699889249367826.prop.
ITS-tools command line returned an error code 137
[2024-05-26 21:57:09] [INFO ] Flatten gal took : 114 ms
[2024-05-26 21:57:09] [INFO ] Input system was already deterministic with 2208 transitions.
[2024-05-26 21:57:09] [INFO ] Transformed 1096 places.
[2024-05-26 21:57:09] [INFO ] Transformed 2208 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 21:57:10] [INFO ] Time to serialize gal into /tmp/UpperBounds2400845296123585451.gal : 16 ms
[2024-05-26 21:57:10] [INFO ] Time to serialize properties into /tmp/UpperBounds3350544280838768303.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2400845296123585451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3350544280838768303.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds3350544280838768303.prop.
ITS-tools command line returned an error code 137
Total runtime 2903917 ms.
BK_STOP 1716761418132
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
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 itstools"
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 r268-smll-171654407200245"
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 ;